Bessenrodt-Stanley polynomials and the octahedron recurrence

zbMath1323.05014arXiv1406.1098MaRDI QIDQ888593

Philippe Di Francesco

Publication date: 2 November 2015

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

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

zbMATH Keywords

partitionsnetworksLaurent propertydimers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Signed and weighted graphs (05C22)

Related Items (3)

Solutions to the T-systems with principal coefficients ⋮ Complexity of tropical Schur polynomials ⋮ Smith normal form in combinatorics

Cites Work

• \(T\)-systems, networks and dimers
• Perfect matchings and the octahedron recurrence
• The solution of the A\(_{r}\) T-system for arbitrary boundary
• \(Q\)-systems as cluster algebras. II: Cartan matrix of finite type and the polynomial property
• Binomial determinants, paths, and hook length formulae
• Local statistics for random domino tilings of the Aztec diamond
• T-systems with boundaries from network solutions
• Smith normal form of a multivariate matrix associated with partitions
• A periodicity theorem for the octahedron recurrence
• FUNCTIONAL RELATIONS IN SOLVABLE LATTICE MODELS I: FUNCTIONAL RELATIONS AND REPRESENTATION THEORY
• Cluster algebras I: Foundations
• T-systems andY-systems in integrable systems
• Arctic curves of the octahedron equation
• A class of convolution codes
• On the Vector Representations of Induced Matroids

This page was built for publication: Bessenrodt-Stanley polynomials and the octahedron recurrence