Related papers: Counting Lattice Points by means of the Residue Th…
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…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…
This paper concerns the lattice counting problem for the mapping class group of a surface $S$ acting on Teichm\"uller space with the Teichm\"uller metric. In that problem the goal is to count the number of mapping classes that send a given…
We solve Talagrand's entropy problem: the L_2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley's theorem on classes of {0,1}-valued functions, for which the…
We consider triangular holes on the hexagonal lattice and we study their interaction when the rest of the lattice is covered by dimers. More precisely, we analyze the joint correlation of these triangular holes in a ``sea'' of dimers. We…
The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…
For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…
One considers weighted sums over points of lattice polytopes, where the weight of a point v is the monomial q^f(v) for some linear form f. One proposes a q-analogue of the classical theory of Ehrhart series and Ehrhart polynomials,…
De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matroid polytope can be computed in polynomial time when the number of elements varies. A key to proving this is the fact that the number of simplicial…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
The problem of counting the different ways of folding the planar triangular lattice is shown to be equivalent to that of counting the possible 3-colorings of its bonds, a dual version of the 3-coloring problem of the hexagonal lattice…
The theory of elliptic pairs, as investigated in a paper by Castravet, Laface, Tevelev, and Ugaglia, provides useful conditions to determine polyhedrality of the pseudo-effective cone, which give rise to interesting arithmetic questions…
We present an unexpected application of tropical convexity to the determination of invariants for linear systems of differential equations. We show that the classical G\'erard-Levelt lattice saturation procedure can be geometrically…
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
We consider a saddle point formulation for a sixth order partial differential equation and its finite element approximation, for two sets of boundary conditions. We follow the Ciarlet-Raviart formulation for the biharmonic problem to…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
Plethysm coefficients $\mathsf{a}_{\mu[\nu]}^\lambda$ are the structure coefficients of the plethysm of Schur functions $s_\mu[s_\nu] = \sum_{\lambda} \mathsf{a}_{\mu[\nu]}^\lambda s_\lambda$. We study a bivariate generating function of…
A limiting property of the nearest-neighbor recurrence coefficients for multiple orthogonal polynomials from a Nevai class is investigated. Namely, assuming that the nearest-neighbor coefficients have a limit along rays of the lattice, we…
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…