A simple proof of a conjecture of Simion

DOI10.1006/JCTA.2002.3300zbMATH Open1013.05011arXiv0809.1604OpenAlexW1964891367WikidataQ123000834 ScholiaQ123000834MaRDI QIDQ1865404FDOQ1865404

Authors: Yi Wang 

Publication date: 26 March 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0809.1604

Recommendations

• Two injective proofs of a conjecture of Simion.
• Compositions inside a rectangle and unimodality
• Proof of a conjecture of Stanley-Zanello
• Log concavity of a sequence in a conjecture of Simion
• Log-concavity and Simion's conjecture

zbMATH Keywords

partitionslattice pathsFerrers diagramlog concavity

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Unimodal, log-concave and Pólya frequency sequences in combinatorics
• Title not available (Why is that?)
• Unimodality and the reflection principle
• Combinatorial statistics on non-crossing partitions
• Log concavity of a sequence in a conjecture of Simion

Cited In (5)

• Log-concavity and Simion's conjecture
• Two injective proofs of a conjecture of Simion.
• A unified approach to polynomial sequences with only real zeros
• On the log-convexity of combinatorial sequences
• The proof of a conjecture of Simion for certain partitions

This page was built for publication: A simple proof of a conjecture of Simion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865404)