On the minimum number of completely 3-scrambling permutations
From MaRDI portal
Publication:2476274
DOI10.1016/j.disc.2007.07.069zbMath1137.05004MaRDI QIDQ2476274
Publication date: 18 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01184432/file/dmAE0168.pdf
05A05: Permutations, words, matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- Chromatic number of Hasse diagrams, eyebrows and dimension
- The order dimension of the complete graph
- Min-wise independent permutations
- On the order dimension of 1-sets versus \(k\)-sets
- Containment problems in high-dimensional spaces
- Families of \(k\)-independent sets
- On the sample size of k -restricted min-wise independent permutations and other k -wise distributions
- A note on scrambling permutations
- Minimal scrambling sets of simple orders