Identities in character tables ofSn

DOI10.1080/10236198.2015.1081386zbMATH Open1339.05012arXiv1507.03499OpenAlexW1917666966MaRDI QIDQ2804536FDOQ2804536

Amitai Regev, Doron Zeilberger, Alon Regev

Publication date: 29 April 2016

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Abstract: In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising relationships by looking closely." The aim of this note is to indicate that a similar statement seems to hold for the character tables of the symmetric groups $S_n$. Just as important, it is a case-study in using a computer algebra system to prove deep identities, way beyond the ability of mere humans. This article is accomanied by a Maple pacgage, Sn, and ample output, avaialble from the webpage http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/sn.html .

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

Recommendations

• The linear algebra of the Pascal matrix
• Power Sum Identities for Arbitrary Symmetric Arrays
• Revisiting the Pascal matrix
• scientific article; zbMATH DE number 2141096
• Symmetric Pascal matrices modulo \(p\)
• Proof Without Words: Partial Column Sums in Pascal's Triangle
• Sums of powers of consecutive integers and Pascal's triangle
• scientific article; zbMATH DE number 6145207
• Proof without words: alternating row sums in Pascal's triangle
• Proof without words: alternating row sums in Pascal's triangle

zbMATH Keywords

partitionsYoung tableauRobinson-Schensted correspondencehook lengthcharacters of \(S_n\)

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• Symmetric functions and P-recursiveness
• A holonomic systems approach to special functions identities
• Asymptotic values for degrees associated with strips of Young diagrams
• A bijection proving orthogonality of the characters of \(S_ n\)
• On the Representations of the Symmetric Group
• Conjectures on the enumeration of tableaux of bounded height

Cited In (3)

• Title not available (Why is that?)
• Generating functions for irreducible characters of \(S_n\) indexed with multiple hooks.
• Coincidences between characters to hook partitions and 2-part partitions on families arising from 2-regular classes

Uses Software

• Maple
• OEIS
• MultiZeilberger
• Sn

This page was built for publication: Identities in character tables ofS_n

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