Density maximizers of layered permutations
From MaRDI portal
Publication:2088699
DOI10.37236/10781zbMath1498.05008arXiv2110.01723OpenAlexW4294948131MaRDI QIDQ2088699
Daniel Král', Théo Pierron, Adam Kabela, Jonathan A. Noel
Publication date: 6 October 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01723
Cites Work
- Finitely forcible graphons and permutons
- Testing permutation properties through subpermutations
- Bounding quantities related to the packing density of \(1(\ell+1)\ell\cdots 2\)
- Determining lower bounds for packing densities of non-layered patterns using weighted templates
- Packing densities of patterns
- The patterns of permutations
- The packing density of other layered permutations
- The minimum number of monotone subsequences
- Optimal packing behavior of some 2-block patterns
- Limits of permutation sequences
- Quasirandom permutations are characterized by 4-point densities
- Packing densities of more 2-block patterns
- Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
- Characterization of quasirandom permutations by a pattern sum
- Improving bounds on packing densities of 4-point permutations
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Lower bound on the size of a quasirandom forcing set of permutations
- On packing densities of permutations
This page was built for publication: Density maximizers of layered permutations
