The computer-aided discovery of a theorem about Young tableaux

DOI10.1006/JSCO.1995.1074MaRDI QIDQ1918489zbMATH OpenOpenAlexFDO

Authors Herbert S. Wilf

Publication date 4 November 1996

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1006/jsco.1995.1074

zbMATH Keywords

computer algebraYoung tableaux

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Ascending subsequences of permutations and the shapes of tableaux
• Finding the permutations corresponding to a given Young tableau
• Permutations, matrices, and generalized Young tableaux
• Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux
• Young tableaux and longest monotone subsequences: An inequality and a conjecture

Cited in

(4)

• Some combinatorial results first found using computer algebra
• Eliminating human insight: An algorithmic proof of Stembridge's TSPP theorem
• Experimenting with standard Young tableaux
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors

This page was built for publication: The computer-aided discovery of a theorem about Young tableaux

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