Universal divided difference operators and solvable lattice models

Loading...
Thumbnail Image

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Published Date

Publisher

Abstract

We construct a new class of solvable lattice models whose partition functions are given by the largest family of type A polynomial divided difference operators that satisfy the braid relations. These multi-parameter operators were introduced by A. N. Kirillov and are vast generalizations of the classical divided difference operators. As a consequence, our lattice model gives a uniform method of computing various functions that arise in Schubert calculus and representation theory, including Schubert polynomials, key polynomials, and many of their generalizations. Along the way we resolve several of Kirillov's conjectures. In particular, our lattice model gives a proof of Kirillov's conjecture that the Hecke--Grothendieck polynomials have non-negative coefficients. We also search for an algebraic interpretation of our construction and identify two degenerations of the parameters for which our lattice model arises from the R-matrices of the standard representations of the quantum groups Uq(sl(1|n)) and Uq(sl(n|1)).

Keywords

Description

University of Minnesota Ph.D. dissertation. 2025. Major: Mathematics. Advisor: Benjamin Brubaker. 1 computer file (PDF); iii, 63 pages.

Related to

Replaces

License

Collections

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Dasher, Alexis. (2025). Universal divided difference operators and solvable lattice models. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/276747.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.