Combinatorics of tableau inversions

Publication date 26 August 2015

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

Full work available at URL https://arxiv.org/abs/1412.6473, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p44

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

inversions of Young tableaux Young tableaux

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

Abstract: A tableau inversion is a pair of entries in row-standard tableau

T

that lie in the same column of

T

yet lack the appropriate relative ordering to make

T

column-standard. An

i

-inverted Young tableau is a row-standard tableau along with a precisely

i

inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number of

i

-inverted tableaux that standardize to a fixed standard Young tableau corresponding to a specific Betti number of the associated fiber. In this paper we approach the topic of tableau inversions from a completely combinatorial perspective. We develop formulas enumerating the number of

i

-inverted Young tableaux for a variety of tableaux shapes, not restricting ourselves to inverted tableaux that standardize a specific standard Young tableau, and construct bijections between

i

-inverted Young tableaux of a certain shape with

j

-inverted Young tableaux of different shapes. Finally, we share some the results of a computer program developed to calculate tableaux inversions.

Review text

Summary: A tableau inversion is a pair of entries in row-standard tableau \(T\) that lie in the same column of \(T\) yet lack the appropriate relative ordering to make \(T\) column-standard. An \(i\)-inverted Young tableau is a row-standard tableau along with precisely \(i\) inversion pairs. Tableau inversions were originally introduced by Fresse to calculate the Betti numbers of Springer fibers in Type A, with the number of \(i\)-inverted tableaux that standardize to a fixed standard Young tableau corresponding to a specific Betti number of the associated fiber. In this paper we approach the topic of tableau inversions from a completely combinatorial perspective. We develop formulas enumerating the number of \(i\)-inverted Young tableaux for a variety of tableaux shapes, not restricting ourselves to inverted tableau that standardize a specific standard Young tableau, and construct bijections between \(i\)-inverted Young tableaux of a certain shape with \(j\)-inverted Young tableaux of different shapes. Finally, we share some the results of a computer program developed to calculate tableaux inversions.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Combinatorics of tableau inversions

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