Improving bounds on packing densities of 4-point permutations
We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342. We also provide rigorous upper bounds for the packing densities of 1324, 1342, and 2413. All our bounds are within $10^{-4}$...
Main Authors: | Jakub Sliacan, Walter Stromquist |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2018-02-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3286/pdf |
Similar Items
-
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
by: Josefran de Oliveira Bastos, et al.
Published: (2016-06-01) -
Consecutive patterns in restricted permutations and involutions
by: M. Barnabei, et al.
Published: (2019-06-01) -
A code for square permutations and convex permutominoes
by: Enrica Duchi
Published: (2019-12-01) -
Problems in extremal and probabilistic combinatorics: cubes, squares and permutations
by: Johnston, T
Published: (2021) -
Enumeration of Permutation Classes and Weighted Labelled Independent Sets
by: Christian Bean, et al.
Published: (2021-03-01)