2004/05/26 by Martin Hildebrand, Hildebrand, Martin, Bruce E. Sagan +3
Computer Science · Mathematics · #05A20 (Primary) #05E99 (Secondary) #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Limits and Structures in Graph Theory #O5D99 #math.CO #msc:05A20 #msc:05E99 #msc:O5D99
paper · pdf · doi:10.48550/arxiv.math/0405512
20 pages, 1 figure, Latex, to be published in Advances in Applied Math., see related papers at http://www.math.msu.edu/~sagan
arxiv created 2004/05/26 · openalex publication_date 2004/05/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We bound several quantities related to the packing density of the patterns 1(L+1)L...2. These bounds sharpen results of Bóna, Sagan, and Vatter and give a new proof of the packing density of these patterns, originally computed by Stromquist in the case L=2 and by Price for larger L. We end with comments and conjectures.