arXiv:0809.1604 Abstract | arXiv Analytics

arXiv:0809.1604 [math.CO]Abstract References Reviews Resources

A Simple Proof of a Conjecture of Simion

Published 2008-09-09Version 1

Simion 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.

Comments: 4 pages

Journal: J. Combin. Theory Ser. A 100 (2002), 399--402

Categories: math.CO

Subjects: 05A17

Keywords: simple proof, log concave, stronger result, lattice paths, ferrers diagram

Tags: journal article

Related articles: Most relevant | Search more

arXiv:2211.08933 [math.CO] (Published 2022-11-16)

Partitions with constrained ranks and lattice paths

Sylvie Corteel, Sergi Elizalde, Carla Savage

arXiv:math/0411427 [math.CO] (Published 2004-11-19)

Lattices of lattice paths