Results 101 to 110 of about 67,579,596 (150)
International Journal of Mathematical Combinatorics, Vol.3A [PDF]
, 2009 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
COMBINATORICS ON WORDS – A TUTORIAL [PDF]
, 2004 Berstel, Jean, Karhumäki, J.
openaire +3 more sources
Enumerative combinatorics on words [PDF]
, 2001 Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem.
openaire +2 more sources
Cohomology and the Combinatorics of Words for Magnus Formations
, 2022 For a prime number $p$ and a free pro-$p$ group $G$ on a totally ordered basis $X$, we consider closed normal subgroups $G^Φ$ of $G$ which are generated by $p$-powers of iterated commutators associated with Lyndon words in the alphabet $X$. We express the profinite cohomology group $H^2(G/G^Φ)$ combinatorically, in terms of the shuffle algebra on $X ...
openaire +3 more sources
Abstract numeration systems and combinatorics on words
, 2010 We summary the main properties of abstract numeration systems and their links to combinatorics on words and combinatorial game ...
Rigo, Michel
core +1 more source
Generación de curvas fractales a partir de homomorfismos entre lenguajes [con Mathematica R]
Revista Integración, 2012 En este artículo se hace una implementación con el software Mathematica 8.0 de algunas propiedades combinatorias de la cadena o palabra de Fibonacci, la cual se puede generar a partir de la iteración de un homomorfismo entre lenguajes.
José L. Ramírez, Gustavo N. Rubiano
doaj
Combinatorics of Hall trees and Hall words
Journal of Combinatorial Theory, Series A, 1992 Hall bases are bases of the free Lie algebra, that can be constructed via special trees and words that are called Hall trees resp. Hall words. The author gives new combinatorial proofs of the unique factorisation of words in Hall words using a rewriting system and its properties.
openaire +3 more sources
Combinatorics of $(m,n)$-Word Lattices
The Electronic Journal of CombinatoricsWe study the $(m,n)$-word lattices recently introduced by V. Pilaud and D. Poliakova in their study of generalized Hochschild polytopes. We prove that these lattices are extremal and constructable by interval doublings. Moreover, we describe further combinatorial properties of these lattices, such as their cardinality, their canonical join ...
openaire +2 more sources
Combinatorics on words: Christoffel words and repetitions in words
, 2008 The two parts of this text are based on two series of lectures delivered by Jean Berstel and Christophe Reutenauer in March 2007 at the Centre de Recherches Mathématiques, Montréal, Canada.
Reutenauer, Christophe +3 more
core