User Tools

Site Tools


Martin Hildebrand (Albany)

The Proof of a Combinatorial Conjecture of Simion

Abstract for the Combinatorics and Number Theory Seminar 2001 April 10

Simion presented a conjecture involving the number of paths in a rectangular grid with the Ferrers diagram of a partition of an integer removed. The conjecture, as interpreted by Sagan, predicts the unimodality of a sequence of such numbers where the sum of the length and width of the rectangular grid is constant and the partition is fixed. In an article in Discrete Mathematics, I proved the conjecture in certain cases including where the partition is self-conjugate; subsequently, I proved the conjecture in general and also showed that the sequence is log concave. In this talk, I will discuss the proof of this conjecture and some relatively elementary techniques used in the proof.

seminars/comb/abstract.200104hil.txt · Last modified: 2020/01/29 14:03 (external edit)