2002/09/20 by Miklós Bóna, Bóna, Miklós, Bruce E. Sagan +1
Engineering · Mathematics · #05A20 (Primary) 05A17 #05E99 (Secondary) #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications #graph theory and CDMA systems #math.CO #msc:05A17 #msc:05A20 #msc:05E99
paper · pdf · doi:10.48550/arxiv.math/0209276
6 pages, 3 figures, Latex, see related papers at http://www.math.msu.edu/~sagan
arxiv created 2002/09/20 · openalex publication_date 2002/09/20 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Simion conjectured the unimodality of a sequence counting lattice paths in a grid with a Ferrers diagram removed from the northwest corner. Recently, Hildebrand and then Wang proved the stronger result that this sequence is actually log concave. Both proofs were mainly algebraic in nature. We give two combinatorial proofs of this theorem.