vix.ing · top · new · best · stats · spec

Computing with rational symmetric functions and applications to invariant theory and PI-algebras

2012/01/21 by Francesca Benanti, Benanti, Francesca, Silvia Boumova +7
Mathematics · #05A15 #05E05 #05E10 #13A50 #15A72 #16R10 #16R30 #20G05 #Advanced Combinatorial Mathematics #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Rings and Algebras (math.RA)

paper · pdf · doi:10.48550/arxiv.1201.4448

openalex publication_date 2012/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form (1 - monomial). We use a classical combinatorial method of Elliott of 1903 further developed in the Partition Analysis of MacMahon in 1916 to compute the generating function of the multiplicities (i.e., the coefficients) of the Schur functions in the expression of f. It is a rational function with denominator of a similar form as f. We apply the method to several problems on symmetric algebras, as well as problems in classical invariant theory, algebras with polynomial identities, and noncommutative invariant theory.

Citations

Related