Journal ArticleOPEN ACCESS

A simple proof of a conjecture of Simion

Journal of Combinatorial Theory. Series A (2002) 100(2) 399-402
DOI: 10.1006/jcta.2002.3300
5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2002 Elsevier Science (USA).

Author supplied keywords

Cite

CITATION STYLE

APA

Wang, Y. (2002). A simple proof of a conjecture of Simion. Journal of Combinatorial Theory. Series A, 100(2), 399–402. https://doi.org/10.1006/jcta.2002.3300

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free