Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions.

Kulikauskas, Andrius; Remme, Jeffrey

Displaying similar documents to “Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions.”

Reconstructing permutations from cycle minors.

Monks, Maria (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

$k$ -fixed-points-permutations.

Rakotondrajao, Fanja (2007)

Integers

Similarity:

On a balanced property of derangements.

Bóna, Miklós (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A Contribution to the Theory of Permutations

Josef Kaucký (1971)

Matematický časopis

Similarity:

Profiles of permutations.

Lugo, Michael (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Decomposing complete tripartite graphs into closed trails of arbitrary lengths

Elizabeth J. Billington, Nicholas J. Cavenagh (2007)

Czechoslovak Mathematical Journal

Similarity:

The complete tripartite graph $K_{n, n, n}$ has $3 n^{2}$ edges. For any collection of positive integers $x_{1}, x_{2}, \dots, x_{m}$ with $\sum_{i = 1}^{m} x_{i} = 3 n^{2}$ and $x_{i} \geq 3$ for $1 \leq i \leq m$ , we exhibit an edge-disjoint decomposition of $K_{n, n, n}$ into closed trails (circuits) of lengths $x_{1}, x_{2}, \dots, x_{m}$ .

A combinatorial approach to hyperharmonic numbers.

Benjamin, Arthur T., Gaebler, David, Gaebler, Robert (2003)

Integers

Similarity:

Parity theorems for statistics on permutations and Catalan words.

Shattuck, Mark (2005)

Integers

Similarity: