On TDP permutations

DOI10.1007/BF02006224MaRDI QIDQ1822609zbMATH OpenOpenAlexFDO

Authors Weisheng Qiu

Publication date 1988

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02006224

zbMATH Keywords

permutations with congruence propertiesTDP permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Congruences; primitive roots; residue systems (11A07) Other combinatorial number theory (11B75) Symmetric groups (20B30) Probabilistic methods in group theory (20P05)

Review text

A permutation \(\sigma\) : \(i\mapsto a_ i\), \(0\leq i<n\) is called a TDP permutation if \(i-a_ i\not\equiv j-a_ j mod n\) for \(i\neq j\). It is easy to see that there exists a TDP permutation iff n is odd. \textit{C. Tompkins} [Proc. Symp. Appl. Math. 6, 195-211 (1956; Zbl 0071.122)] listed the number of TDP permutations for \(n\leq 11.\) In the paper under review the author gives a combinatorial method for finding all TDP permutations for \(n\leq 15\), and discusses a group- theoretic method for generating TDP permutations. For \(n>15\), the number of TDP permutations is estimated by applying probability methods.

Recommendations

• scientific article; zbMATH DE number 4204349
• ON THE NUMBER OFA-PERMUTATIONS
• Generating Permutations with k-Differences
• scientific article; zbMATH DE number 3941545
• scientific article; zbMATH DE number 5704239

Cited in

(1)

• On t-homogeneous permutation sets

This page was built for publication: On TDP permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822609)