Related papers: Is there a smooth lattice polytope which does not …
In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…
If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…
We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…
A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…
The aim of this article is to study (additively) indecomposable algebraic integers $\mathcal O_K$ of biquadratic number fields $K$ and universal totally positive quadratic forms with coefficients in $\mathcal O_K$. There are given…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of…
We propose a definition of a Poincar\'e algebra for a two dimensional space--time with one discretized dimension. This algebra has the structure of a Hopf algebra. We use the link between Onsager's uniformization of the Ising model and the…
We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…
We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…
We introduce a so-called `coprimeness-preserving non-integrable' extension (another terminology is `quasi-integrable' extension) to the two-dimensional Toda lattice equation. We believe that this equation is the first example of such…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
We prove the existence of two-dimensional good lattice points in thick multiplicative subgroups modulo $p$.
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…
Given lattice polytopes $P_1, \ldots, P_k$ contained in a $k$-dimensional subspace $U \subseteq \mathbb{R}^d$ and a $d$-dimensional lattice polytope $Q \subset \mathbb{R}^d$, we compute the Hodge vector of the Cayley polytope $P_1 * \cdots…
We associate to a finite digraph $D$ a lattice polytope $P_D$ whose vertices are the rows of the Laplacian matrix of $D$. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem,…
We consider quantum field theory in de Sitter space, focusing on the cases of scalars, spin 1/2 fields, and symmetric and anti-symmetric tensor fields of arbitrary spin. The free field equations in global coordinates can be reduced to a one…
We introduce a criterion that a given bihamiltonian structure allows a local coordinate system where both brackets have constant coefficients. This criterion is applied to the bihamiltonian open Toda lattice in a generic point, which is…
This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…