Dumont's statistic on words.

Skandera, Mark

Displaying similar documents to “Dumont's statistic on words.”

Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order.

Zara, Catalin (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

New upper bounds for the size of permutation codes via linear programming.

Bogaerts, Mathieu (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Uniformly bounded duplication codes

Peter Leupold, Victor Mitrana (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

Duplication is the replacement of a factor within a word by . This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word's duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite...

Note on decipherability of three-word codes.

Blanchet-Sadri, F., Howell, T. (2002)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Promotion and evacuation.

Stanley, Richard P. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A hierarchy for circular codes

Giuseppe Pirillo (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

We first prove an extremal property of the infinite Fibonacci word : the family of the palindromic prefixes {} of is not only a circular code but “almost” a comma-free one (see Prop. 12 in Sect. 4). We also extend to a more general situation the notion of a necklace introduced for the study of trinucleotides codes on the genetic alphabet, and we present a hierarchy relating two important classes of codes, the comma-free codes and the circular ones.