The proof of a conjecture of Simion for certain partitions (Q1586762): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123331771, #quickstatements; #temporary_batch_1703703486941 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:08, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The proof of a conjecture of Simion for certain partitions |
scientific article |
Statements
The proof of a conjecture of Simion for certain partitions (English)
0 references
11 December 2002
0 references
A partition of an integer \(N\) is a non-increasing sequence \(\lambda=\{\lambda_1,\lambda_2,\dots ,\lambda_m\},\) with \(\lambda_1\leq n, \sum_{i=1}^{m}\lambda_i=N\), and let \(\{\lambda'\}\) be its conjugate, i.e. \(\lambda'_i=|\{j:\lambda_j\geq i\}|\), with \(\lambda_1\leq m.\) Consider the \(m\times n\) grid with the Ferrers diagram of partition \(\lambda\) removed. Furthermore denote by \(N(m,n,\lambda)\) the number of paths in the \(m\times n\) grid such that the path starts at \((0,0)\) (at the left-lower corner) and ends at \((n,m)\) (at the right-upper corner) and at each step it goes one unit up (\(+(0,1)\)) or one unit right (\(+(1,0)\)) but not inside the removed \(\lambda\). A sequence \(\{a_1,a_2,\dots, a_n\}\) is said to be unimodal if, for some \(k\), \(a_1\leq \dots \leq a_k\) and \(a_{k+1}\leq \dots\leq a_n\). The author proves a conjecture of Simion in the case when \(\lambda\) is self-conjugate. It reads: if \(\lambda\) is self-conjugate and \(t\) is a non-negative integer then the sequence \(N(\lambda'_1,\lambda_1+t,\lambda),N(\lambda'_1+1,\lambda_1+t-1,\lambda),\dots, N(\lambda'_1+t,\lambda_1,\lambda)\) is unimodal.
0 references
partitions
0 references
lattice paths
0 references
unimodality
0 references