visitant :: identificació

Pàgina inicial > Documents de recerca > Prepublicacions > Resultats de la cerca

Prepublicacions

Cerca col·leccions:

Ordena'ls per:	Mostrar els resultats:	Format de visualizació:

Prepublicacions	540 registres trobats 486 - 495 anar al registre:	La cerca s'ha fet en 0.01 segons.

486.

43 p, 360.9 KB

Orbit decidability and the conjugacy problem for some extensions of groups / Bogopolski, O. ; Martino, Armando ; Ventura, Enric ; Centre de Recerca Matemàtica
"Vegeu el resum a l'inici del document del fitxer adjunt".
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 766)

Registre complet -

487.

11 p, 191.6 KB

Subgroups of small index in Aut(Fn) and Kazhdan's property (T) / Bogopolski, O. ; Vikentiev, Ruslan ; Centre de Recerca Matemàtica
We give a series of interesting subgroups of finite index in Aut(Fn). One of them has index 42 in Aut(F3) and infinite abelianization. This implies that Aut(F3) does not have Kazhdan's property (T) (see [3] and [6] for another proofs). [...]
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 765)

Registre complet -

488.

18 p, 219.4 KB

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs / Marinelli, Carlo ; De Santis, Emilio ; Centre de Recerca Matemàtica
We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. [...]
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 763)

Registre complet -

489.

18 p, 218.9 KB

Brown representability follows from Rosicky / Neeman, Amnon ; Centre de Recerca Matemàtica
We prove that the dual of a well generated triangulated category satisfies Brown representability, as long as there is a combinatorial model. This settles the major open problem in [13]. We also prove that Brown representability holds for non-dualized well generated categories, but that only amounts to the fourth known proof of the fact. [...]
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 762)

Registre complet -

490.

13 p, 147.2 KB

The equation xpyq=zr and groups that act freely on Λ-trees / Brady, Noel ; Ciobanu, Laura ; Martino, Armando ; O'Rourke, Shane ; Centre de Recerca Matemàtica
"Vegeu el resum a l'inici del document del fitxer adjunt".
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 723)

Registre complet -

491.

21 p, 196.4 KB

Random graphs on surfaces / McDiarmid, Colin ; Centre de Recerca Matemàtica
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. [...]
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 722)

Registre complet -

492.

29 p, 251.5 KB

On the complexity of the Whitehead minimization problem / Roig, Abdó ; Ventura, Enric ; Weil, Pascal ; Centre de Recerca Matemàtica
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. [...]
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 721)

Registre complet -

493.

7 p, 157.8 KB

The word problem distinguishes counter languages / Cleary, Sean ; Elder, Murray ; Ostheimer, Gretchen ; Centre de Recerca Matemàtica
Counter automata are more powerful versions of finite state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of Zn is accepted by a nondeterministic m-counter automaton if and only if m >= n.
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 695)

Registre complet -

494.

20 p, 208.2 KB

Discriminating groups: a comprehensive overview / Fine, Benjamin ; Gaglione, Anthony M. ; Myasnikov, Alexei ; Spellman, Dennis ; Centre de Recerca Matemàtica
Discriminating groups were introduced by G. Baumslag, A. Myasnikov and V. Remeslennikov as an outgrowth of their theory of algebraic geometry over groups. However they have taken on a life of their own and have been an object of a considerable amount of study. [...]
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 724)

Registre complet -

495.

14 p, 185.1 KB

Encryption methods using formal power series rings / Baumslag, Gilbert ; Brukhov, Yegor ; Fine, Benjamin ; Rosenberger, Gerhard ; Centre de Recerca Matemàtica
Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. [...]
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 725)

Registre complet -

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.

Dipòsit Digital de Documents de la UAB :: :: :: ::
Powered by v1.1.6
Mantingut per ::

Col·laborem