On t-homogeneous permutation sets
From MaRDI portal
Let \(S_ n\) be the symmetric group on \(X=\{1,...,n\}\). A subset Z of \(S_ n\) is t-transitive if the following condition holds: for any two t- subsets x,y in X, there exists some z in Z that moves x to y, and the number of such elements in Z is a constant that is independent of the choice of x and y. We prove that a t-homogeneous subset in \(S_ n\) is also (t-1)-homogeneous for 2\(\leq t\leq (n/2)\).
Recommendations
- Some t-homogeneous sets of permutations
- On TDP permutations
- Monotypical uniformly homogeneous sets of permutations
- The classification of homogeneous finite-dimensional permutation structures
- Homogeneous permutations
- Torsion-free relatively homogeneous permutation groups
- Near-homogeneous tournaments and permutation groups
- A recursive construction of t-wise uniform permutations
- A note on \(t\)-complementing permutations for graphs
Cites work
Cited in
(8)- On some sharply t-transitive sets
- Monotypical uniformly homogeneous sets of permutations
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS
- Sharply \((n-2)\)-transitive sets of permutations
- ORBIT-HOMOGENEITY IN PERMUTATION GROUPS
- Large totally symmetric sets
- Characters of finite quasigroups. VI: Critical examples and doubletons
This page was built for publication: On t-homogeneous permutation sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798757)