Chess tableaux (Q2570992)
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: Chess tableaux |
scientific article; zbMATH DE number 2220868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chess tableaux |
scientific article; zbMATH DE number 2220868 |
Statements
Chess tableaux (English)
0 references
31 October 2005
0 references
A chess tableau is a standard Young tableaux, in which the \((i,j)\) entry is always congruent to \(i+j+1\) mod 2. Chess tableaux were introduced in two recent, independent papers. The paper enumerates \(3\times n\) chess tableaux. Their number agrees to the number of Baxter permutations of \(n-1\). This follows from a bijection between certain 3-row chess tableaux and certain 3-row Dulucq-Guibert nonconsecutive tableaux. Several open problems are included. There is an explanation how helpstalemate chess compositions motivate chess tableaux.
0 references
standard Young tableaux
0 references
Baxter permutations
0 references
nonconsecutive tableaux
0 references
Charney-Davis statistics
0 references
helpstalemate
0 references
0.7642843127250671
0 references
0.7502915263175964
0 references
0.7249758839607239
0 references
0.708880603313446
0 references
0.6947680115699768
0 references
