Two injective proofs of a conjecture of Simion
Miklós Bóna, Bruce E. Sagan
Abstract
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.