7 citations · 11 across the 4 of their papers we have counts for
5 papers
Solving the n-color ice model
Patrick Addona, Ethan Bockenhauer, Ben Brubaker +14
Given an arbitrary choice of two sets of nonzero Boltzmann weights for -color lattice models, we provide explicit algebraic conditions on these Boltzmann weights which guarantee…
Lattice Models, Hamiltonian Operators, and Symmetric Functions
Andrew Hardt
We give general conditions for the existence of a Hamiltonian operator whose discrete time evolution matches the partition function of certain solvable lattice models. In particula…
Frozen Pipes: Lattice Models for Grothendieck Polynomials
Ben Brubaker, Claire Frechette, Andrew Hardt +2
We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions -- biaxial double -Grothendieck polynomials -- which specialize at …
Characters of Renner Monoids and Their Hecke Algebras
Andy Hardt, Jared Marx-Kuo, Vaughan McDonald +2
This paper gives a general algorithm for computing the character table of any Renner monoid Hecke algebra, by adapting and generalizing techniques of Solomon used to study the rook…
Combinatorial species and graph enumeration
Andy Hardt, Pete McNeely, Tung Phan +1
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which pr…