Related papers: Projecting lattice polytopes according to the Mini…

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

The phenomenon of periodicity, discovered by Benson and Goodearl, is linked to the behavior of the objects of cocycles in acyclic complexes. It is known that any flat $\mathsf{Proj}$-periodic module is projective, any fp-injective…

The goal of this paper is to explicitly describe a minimal binomial generating set of a class of lattice ideals, namely the ideal of certain Veronese $3$-fold projections. More precisely, for any integer $d\ge 4$ and any $d$-th root $e$ of…

We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…

We are interested in the zero locus of a Chapoton's $F$-triangle as a polynomial in two real variables $x$ and $y$. An expectation is that (1) the $F$-triangle of rank $l$ as a polynomial in $x$ for each fixed $y\in[0,1]$, has exactly $l$…

Let $\Gamma$ be a group which is virtually free of rank at least 2 and let $\mathcal{F}_{td}(\Gamma)$ be the family of totally disconnected, locally compact groups containing $\Gamma$ as a co-compact lattice. We prove that the values of the…

We prove that if $E$ is a planar self-similar set with similarity dimension $d$ whose defining maps generate a dense set of rotations, then the $d$-dimensional Hausdorff measure of the orthogonal projection of $E$ onto any line is zero. We…

It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…

The amoeba of a Laurent polynomial $f \in \C[z_1^{\pm 1},\ldots,z_n^{\pm 1}]$ is the image of its zero set $\mathcal{V}(f)$ under the log-absolute-value map. Understanding the space of amoebas (i.e., the decomposition of the space of all…

We present the extension of Rosenfeld's fundamental measure theory to lattice models by constructing a density functional for d-dimensional mixtures of parallel hard hypercubes on a simple hypercubic lattice. The one-dimensional case is…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

We prove that any finite union $P$ of interior-disjoint polytopes in ${\mathbb R}^d$ has the Pompeiu property, a result first proved by Williams [Wil76]. This means that if a continuous function $f$ on $R^d$ integrates to 0 on any congruent…

Let A be a symmetric monoidal closed exact category. This category is a natural framework to define the notions of purity and flatness. We show that an object F in A is flat if and only if any conflation ending in F is pure. Furthermore, we…

A central question in optimization is to maximize (or minimize) a linear function over a given polytope P. To solve such a problem in practice one needs a concise description of the polytope P. In this paper we are interested in…

Let $M_d$ be the moduli space of one-dimensional complex polynomial dynamical systems. The escape rates of the critical points determine a critical heights map $G: M_d \to \mathbb{R}^{d-1}$. For generic values of $G$, each connected…

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

In this paper, we focus on two classes of D-invariant polynomial subspaces. The first is a classical type, while the second is a new class. With matrix computation, we prove that every ideal projector with each D-invariant subspace…

There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…

Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong…