Related papers: Is there a smooth lattice polytope which does not …
We develop algebro-geometrical approach for the open Toda lattice. For a finite Jacobi matrix we introduce a singular reducible Riemann surface and associated Baker-Akhiezer functions. We provide new explicit solution of inverse spectral…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
We associate to lattice points a_0,a_1,...,a_N in Z^n an A-hypergeometric series \Phi(\lambda) with integer coefficients. If a_0 is the unique interior lattice point of the convex hull of a_1,...,a_N, then for every prime p\neq 2 the ratio…
In this paper we show that a lattice balanced polygon of odd area cannot be cut into an odd number of triangles of equal areas. First result of this type was obtained by Paul Monsky in 1970. He proved that a square cannot be cut into an odd…
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 give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
In this paper, we explain a simple and uniform construction of a smooth integral model associated to a quadratic, (anti)-hermitian, and (anti)-quaternionic hermitian lattice defined over an arbitrary local field. As one major application,…
We construct a distributive algebraic lattice D that is not isomorphic to the congruence lattice of any lattice. This solves a long-standing open problem, traditionally attributed to R. P. Dilworth, from the forties. The lattice D has…
In this paper we describe each coefficient of the Siegel series associated to a quadratic $\mathfrak{o}$-lattice $L$ in terms of lattice counting problems, where $\mathfrak{o}$ is the ring of integers of a non-Archimedean local field of…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
In a locally finite tiling of n-dim Euclidean space by convex polytopes, each point of the space is either a vertex of at least two tiles, or no vertex at all.
A $d$-dimensional closed convex set $K$ in $\mathbb{R}^d$ is said to be lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^d$. We consider the following two families of lattice-free polytopes: the family $\mathcal{L}^d$ of…
Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…
Recent studies have claimed that the strong $CP$ problem does not occur in QCD, proposing a new order of limits in volume and topological sectors when studying observables on the lattice. We study the effect of the topological term on a…
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"…
It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or…
In \cite{rigidity}, Luo introduced a $\psi_{\lambda}$ edge invariant which turns out to be a coordinate of the Teichm\"uller space of a surface with boundary. And he proved that for $\lambda \geq 0$, the image of the Teichm\"uller space…