An arithmetic of complete permutations with constraints. I: An exposition of the general theory
From MaRDI portal
Publication:1110508
DOI10.1016/0012-365X(88)90001-5zbMath0657.05003OpenAlexW2034810241WikidataQ127064042 ScholiaQ127064042MaRDI QIDQ1110508
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(88)90001-5
Permutations, words, matrices (05A05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (5)
Uniform perfect systems of sets of iterated differences of size 4 ⋮ An arithmetic of complete permutations with constraints. II: Case studies ⋮ Langford sequences: Some connections with complete and additive permutations ⋮ Further results on irregular, critical perfect systems of difference sets. I: Split systems ⋮ Further results on irregular, critical perfect systems of difference sets. II: Systems without splits
Cites Work
- An arithmetic of complete permutations with constraints. II: Case studies
- Langford sequences: Some connections with complete and additive permutations
- Langford sequences: Perfect and hooked
- On a conjecture of Paul Erdoes for perfect systems of difference sets
- Compatible additive permutations of finite integral bases
- On the general Erdős conjecture for perfect systems of difference sets and embedding partial complete permutations
- Further results on irregular, critical perfect systems of difference sets. I: Split systems
- Combining Perfect Systems of Difference Sets
- Irregular Extremal Perfect Systems of Difference Sets
- Addition Theorems for Perfect Systems of Difference Sets
- Construction of Additive Sequences of Permutations of Arbitrary Lengths
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An arithmetic of complete permutations with constraints. I: An exposition of the general theory
