Equivalences of LLT polynomials via lattice paths
David Keating

TL;DR
This paper establishes a bijection between vertex model configurations for LLT polynomials with swapped boundary conditions, leading to new equivalences and linear relations among these symmetric polynomials.
Contribution
It introduces an algorithm for a bijection between vertex model configurations with swapped boundary conditions, proving when LLT polynomials are equivalent up to a factor.
Findings
Bijection between configurations with swapped boundary conditions
Conditions for weight-preserving bijections and polynomial equivalences
Systematic determination of linear relations among LLT polynomials
Abstract
The LLT polynomials are a family of symmetric polynomials indexed by a tuple of (possibly skew-)partitions . It has recently been shown that these polynomials can be seen as the partition function of a certain vertex model whose boundary conditions are determined by . In this paper we describe an algorithm which gives a bijection between the configurations of the vertex model with boundary condition and those with boundary condition . We prove a sufficient condition for when this bijection is weight-preserving up to an overall factor…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Nonlinear Waves and Solitons
