A Simple Proof of a Conjecture of Simion

Simple item page
dc.creatorWang, Yi
dc.date2008-09-09
dc.date.accessioned2026-07-07T10:01:46Z
dc.date.available2026-07-07T10:01:46Z
dc.descriptionSimion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we present a simple proof of Hildebrand's result.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0809.1604
dc.identifierhttp://arxiv.org/abs/0809.1604
dc.identifierJ. Combin. Theory Ser. A 100 (2002), 399--402
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168741
dc.subjectCombinatorics
dc.subject05A17
dc.titleA Simple Proof of a Conjecture of Simion
dc.typetext

Files

Collections

arXiv