Chess tableaux

Authors Henrik Eriksson, Kenneth C. Fan, Timothy Y. Chow

Publication date 31 October 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125212, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i2a3.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Baxter permutations Charney-Davis statistics helpstalemate nonconsecutive tableaux standard Young tableaux

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10)

Review text

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.

Recommendations

Cited in

(5)

This page was built for publication: Chess tableaux

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