Reconstructing permutations from cycle minors.
Monks, Maria (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Monks, Maria (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mantaci, Roberto, Rakotondrajao, Fanja (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Paweł Klinga (2016)
Colloquium Mathematicae
Similarity:
We prove that every permutation of ω² is a composition of a finite number of axial permutations, where each axial permutation moves only a finite number of elements on each axis.
Lugo, Michael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Marian Rejewski (1980)
Applicationes Mathematicae
Similarity:
Josef Kaucký (1971)
Matematický časopis
Similarity:
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Augustine Munagi (2014)
Open Mathematics
Similarity:
The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions - adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular...
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: