Langford sequences: Some connections with complete and additive permutations

DOI10.1016/0012-365X(90)90273-KzbMath0702.05001OpenAlexW2088645966MaRDI QIDQ914673

Takanori Hayasaka, Sadao Saito

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90273-k

zbMATH Keywords

permutationsLangford sequencespecial sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Special sequences and polynomials (11B83)

Related Items (3)

An arithmetic of complete permutations with constraints. I: An exposition of the general theory ⋮ An arithmetic of complete permutations with constraints. II: Case studies ⋮ A survey of Skolem-type sequences and Rosa’s use of them

Cites Work

• Langford sequences: Perfect and hooked
• Compatible additive permutations of finite integral bases
• An arithmetic of complete permutations with constraints. I: An exposition of the general theory
• Skolem sequences and additive permutations
• The Langford (4,n)-sequence: A trigonometric approach

This page was built for publication: Langford sequences: Some connections with complete and additive permutations