Pàgina inicial > Documents de recerca > Resultats de la cerca: Centre de Recerca Matemàtica

Documents de recerca

  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Documents de recerca 507 registres trobats  inicianterior459 - 468següentfinal  anar al registre: La cerca s'ha fet en 0.01 segons. 
459.
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 - Creative Commons
460.
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 - Creative Commons
461.
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 - Creative Commons
462.
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 - Creative Commons
463.
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 - Creative Commons
464.
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 - Creative Commons
465.
18 p, 206.3 KB Convergence of singular integrals with general measures / Mattila, Pertti ; Verdera, Joan (Universitat Autònoma de Barcelona. Departament de Matemàtiques) ; Centre de Recerca Matemàtica
We show that L2-bounded singular integrals in metric spaces with respect to general measures and kernels converge weakly. This implies a kind of average convergence almost everywhere. For measures with zero density we prove the almost everywhere existence of principal values.
Centre de Recerca Matemàtica 2006 (Prepublicacions del Centre de Recerca Matemàtica ; 720)  
Registre complet - Creative Commons
466.
17 p, 222.6 KB Parabolic and quasiparabolic subgroups of free partially commutative groups / Duncan, A. J. ; Kazachkov, I. V. ; Remeslennikov, V. N. ; Centre de Recerca Matemàtica
Let Γ be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph Γ, which we call canonical parabolic subgroups. [...]
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 761)  
Registre complet - Creative Commons
467.
32 p, 318.1 KB Orthogonal systems in finite grahps / Duncan, A. J. ; Kazachkov, I. V. ; Remeslennikov, V. N. ; Centre de Recerca Matemàtica
To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. [...]
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 760)  
Registre complet - Creative Commons
468.
19 p, 234.8 KB Well-posedness and invariant measures for HJM models with deterministic volatility and Lévy noise / Marinelli, Carlo ; Centre de Recerca Matemàtica
We give sufficient conditions for existence, uniqueness and ergodicity of invariant measures for Musiela's stochastic partial differential equation with deterministic volatility and a Hilbert space valued driving Lévy noise. [...]
Centre de Recerca Matemàtica 2007 (Prepublicacions del Centre de Recerca Matemàtica ; 759)  
Registre complet - Creative Commons

Documents de recerca : 507 registres trobats   inicianterior459 - 468següentfinal  anar al registre:
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 :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem