Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quasi-solvable lattice models for $\mathrm{Sp}_{2n}$ and $\mathrm{SO}_{2n+1}$ Demazure atoms and characters

Published 22 Jan 2021 in math.CO, math.QA, and math.RT | (2101.08907v2)

Abstract: We construct colored lattice models whose partition functions represent symplectic and odd orthogonal Demazure characters and atoms. We show that our lattice models are not solvable, but we are able to show the existence of sufficiently many solutions of the Yang--Baxter equation that allows us to compute functional equations for the corresponding partition functions. From these functional equations, we determine that the partition function of our models are the Demazure atoms and characters for the symplectic and odd orthogonal Lie groups. We coin our lattice models as quasi-solvable. We use the natural bijection of admissible states in our models with Proctor patterns to give a right key algorithm for reverse King tableaux and Sundaram tableaux.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.