2 citations · 3 across the 6 of their papers we have counts for
5 papers · 1 filter
A combinatorial generalization of the Boson-Fermion correspondence
Thomas Lam
We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be ex…
A note on graphs without short even cycles
Thomas Lam, Jacques Verstraete
We show that any n-vertex graph without even cycles of length at most 2k has at most 1/2(n^{1 + 1/k}) + O(n) edges, and polarity graphs of generalized polygons show that this is as…
Affine Stanley symmetric functions
Thomas Lam
We define a new family of symmetric functions which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions including symmetry, domina…
Alcoved Polytopes I
Thomas Lam, Alexander Postnikov
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes,…
Growth diagrams, Domino insertion and Sign-imbalance
Thomas Lam
We study some properties of domino insertion, focusing on aspects related to Fomin's growth diagrams. We give a self-contained proof of the semistandard domino-Schensted correspond…