Enumeration on row-increasing tableaux of shape \(2 \times n\) (Q1733931)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration on row-increasing tableaux of shape 2 n |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration on row-increasing tableaux of shape \(2 \times n\) |
scientific article |
Statements
Enumeration on row-increasing tableaux of shape \(2 \times n\) (English)
0 references
22 March 2019
0 references
Summary: Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape \(2\times n\), and obtained a polynomial on the major index of these tableaux, which is a \(q\)-analogue of refined small Schröder numbers. We define row-increasing tableaux and study the major index and amajor index of row-increasing tableaux of shape \(2 \times n\). The resulting polynomials are both \(q\)-analogues of refined large Schröder numbers. For both results we give bijective proofs.
0 references
0 references
0.8585448861122131
0 references
0.8421439528465271
0 references
0.8374252915382385
0 references
0.826447606086731
0 references
0.8046238422393799
0 references