Enumerative combinatorics on determinants and signed bigrassmannian polynomials

MaRDI QIDQ5173630zbMATH OpenFDO

Authors Masato Kobayashi

Publication date 16 February 2015

Full work available at URL https://arxiv.org/abs/1902.06234

zbMATH Keywords

bigrassmannian permutationsBruhat orderpermutation statisticsRobbins-Rumsey determinantsymmetric groupstournamentsVandermonde determinants

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Matrices, determinants in number theory (11C20) Determinants, permanents, traces, other special matrix functions (15A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: As an application of linear algebra for enumerative combinatorics, we introduce two new ideas, signed bigrassmannian polynomials and bigrassmannian determinant. First, a signed bigrassmannian polynomial is a variant of the statistic given by the number of bigrassmannian permutations below a permutation in Bruhat order as Reading suggested (2002) and afterward the author developed (2011). Second, bigrassmannian determinant is a $q$-analog of the determinant with respect to our statistic. It plays a key role for a determinantal expression of those polynomials. We further show that bigrassmannian determinant satisfies weighted condensation as a generalization of Dodgson, Jacobi-Desnanot and Robbins-Rumsey (1986).

Recommendations

• Signed excedance enumeration via determinants
• The generalized determinant and its application to the enumeration of permutations
• Product evaluations of Lefschetz determinants for Grassmannians and of determinants of multinomial coefficients
• Determinantal formulas with major indices
• Publication:4206870

This page was built for publication: Enumerative combinatorics on determinants and signed bigrassmannian polynomials

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