Bessenrodt-Stanley polynomials and the octahedron recurrence

MaRDI QIDQ888593zbMATH OpenFDO

Authors 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, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p35

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

dimersLaurent propertynetworkspartitions

Mathematics Subject Classification ID

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

Abstract: We show that a family of multivariate polynomials recently introduced by Bessenrodt and Stanley can be expressed as solution of the octahedron recurrence with suitable initial data. This leads to generalizations and explicit expressions as path or dimer partition functions.

Review text

Summary: We show that a family of multivariate polynomials recently introduced by \textit{C. Bessenrodt} and \textit{R. P. Stanley} [J. Algebr. Comb. 41, No. 1, 73--82 (2015; Zbl 1307.05009)] can be expressed as solution of the octahedron recurrence with suitable initial data. This leads to generalizations and explicit expressions as path or dimer partition functions.

Recommendations

• The octahedron recurrence and RSK-correspondence
• The octahedron recurrence and \(\mathfrak{gl}_n\) crystals
• A periodicity theorem for the octahedron recurrence
• On octonionic polynomials
• \(q\)-Bessel and polyominoes
• Perfect matchings and the octahedron recurrence
• Combinatorics of Bricard's octahedra
• The Farey octahedron graph, the Poincaré polyhedron theorem and Gaussian integer continued fractions
• A positive proof of the Littlewood-Richardson rule using the octahedron recurrence
• Construction of octonionic polynomials

Cites work

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

Cited in

(8)

• Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
• Interlacing networks: birational RSK, the octahedron recurrence, and Schur function identities
• A periodicity theorem for the octahedron recurrence
• Solutions to the T-systems with principal coefficients
• The multidimensional cube recurrence
• Bott type periodicity for the higher octonions
• Smith normal form in combinatorics
• Complexity of tropical Schur polynomials

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

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