Related papers: Lattice point enumeration of polytopes associated …
We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…
The lattice definition of the two-dimensional topological quantum field theory [Fukuma, {\em et al}, Commun.~Math.~Phys.\ {\bf 161}, 157 (1994)] is generalized to arbitrary (not necessarily orientable) compact surfaces. It is shown that…
We present counterexamples to the lore that symmetries that cannot be gauged or made on-site are necessarily anomalous. Specifically, we construct unitary, internal symmetries of two-dimensional lattice models that cannot be consistently…
Motivated by a recent paper of Fock and Rosly \cite{FoRo} we describe a mathematically precise quantization of the Hamiltonian Chern-Simons theory. We introduce the Chern-Simons theory on the lattice which is expected to reproduce the…
A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…
Zeckendorf's Theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. We consider higher-dimensional lattice analogues, where a legal decomposition of a number $n$ is a collection of…
We extend the asymptotic formula for counting integral matrices with a given irreducible characteristic polynomial by Eskin, Mozes and Shah in 1996 to the case of counting elements in a maximal order of certain central simple algebra with a…
The Dowling lattice $Q_n(\mathfrak{G})$, $\mathfrak{G}$ a finite group, generalizes the geometric lattice generated by all vectors, over a field, with at most two nonzero components. Abstractly, it is a fundamental object in the…
Given integers $a_1, a_2, ..., a_n$, with $a_1 + a_2 + ... + a_n \geq 1$, a symmetrically constrained composition $\lambda_1 + lambda_2 + ... + lambda_n = M$ of $M$ into $n$ nonnegative parts is one that satisfies each of the the $n!$…
In his seminal 1951 paper "Extreme forms" Coxeter \cite{cox51} observed that for $n \ge 9$ one can add vectors to the perfect lattice $\sfA_9$ so that the resulting perfect lattice, called $\sfA_9^2$ by Coxeter, has exactly the same set of…
The lattice polynomials $L_{i,j}(x)$ are introduced by Hough and Shapiro as a weighted count of certain lattice paths from the origin to the point $(i,j)$. In particular, $L_{2n, n}(x)$ reduces to the generating function of the numbers…
We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and "local contributions" of the links of its…
We calculate both connected and disconnected contribution to the $\pi$-$N$ $\sigma$-term in quenched lattice QCD with Wilson quark action on a $12^3\times 20$ lattice at $\beta=5.7$. The latter is evaluated with the aid of the variant wall…
We develop novel techniques using abstract operator theory to obtain asymptotic formulae for lattice counting problems on infinite-volume hyperbolic manifolds, with error terms which are uniform as the lattice moves through "congruence"…
We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.
Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…
We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…
One of the primary methods of studying the topology of configurations of points in a graph and configurations of disks in a planar region has been to examine discrete combinatorial models arising from the underlying spaces. Despite the…
We study the Ehrhart theory of quadratic irrational polytopes that undergo vector dilations. That is, for a given polytope with vertices in $\mathbb{Q}(\sqrt{D})$, and a different dilation factor for each facet, we show that the leading…