Constructions and nonexistence results for suitable sets of permutations

@article{Chan2017ConstructionsAN,
  title={Constructions and nonexistence results for suitable sets of permutations},
  author={Justin H. C. Chan and Jonathan Jedwab},
  journal={J. Comb. Theory, Ser. A},
  year={2017},
  volume={148},
  pages={183-196}
}
A set of N permutations of {1, 2, . . . , v} is (N, v, t)-suitable if each symbol precedes each subset of t − 1 others in at least one permutation. The central problems are to determine the smallest N for which such a set exists for given v and t, and to determine the largest v for which such a set exists for given N and t. These extremal problems were the subject of classical studies by Dushnik in 1950 and Spencer in 1971. We give examples of suitable sets of permutations for new parameter… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Suitable permutations, binary covering arrays, and Paley matrices

  • C. J. Colbourn
  • Algebraic Design Theory and Hadamard Matrices,
  • 2015
Highly Influential
8 Excerpts

On the dimensions of ordered sets of bounded degree

  • Z. Füredi, J. Kahn
  • 1986
2 Excerpts

Minimal scrambling sets of simple orders

  • J. Spencer
  • Acta Math. Acad. Sci. Hungar.,
  • 1971
2 Excerpts

Similar Papers

Loading similar papers…