相关论文: Boundary $h^\ast$-polynomials of rational polytope…

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

Building from the work of von Bell et al.~(2022), we study the Ehrhart theory of order polytopes arising from a special class of distributive lattices, known as generalized snake posets. We present arithmetic properties satisfied by the…

We give a sufficient and necessary condition for an analytic function $f(z)$ on the unit ball $\BB$ in $\CC^n$ with Hadamard gaps, that is, for $f(z)=\sum_{k=1}^\infty P_{n_k}(z)$ where $P_{n_k}(z)$ is a homogeneous polynomial of degree…

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

Let $\J$ and $\K$ be convex sets in $\R^{n}$ whose affine spans intersect at a single rational point in $\J \cap \K$, and let $\J \oplus \K = \conv(\J \cup \K)$. We give formulas for the generating function {equation*} \sigma_{\cone(\J…

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…

The characterization of lattice polytopes based upon information about their Ehrhart $h^*$-polynomials is a difficult open problem. In this paper, we finish the classification of lattice polytopes whose $h^*$-polynomials satisfy two…

For a lattice polytope P, define A_P(t) as the sum of the solid angles of all the integer points in the dilate tP. Ehrhart and Macdonald proved that A_P(t) is a polynomial in the positive integer variable t. We study the numerator…

Let $X$ be an affine or a projective variety defined over a number field $K$ and $\varphi:{\bf C}\to X({\bf C})$ be a holomorphic map with Zariski dense image. We estimate the number of rational points of height bounded by $H$ in the image…

To any poset or quasi-poset is attached a lattice polytope, whose Ehrhart polynomial we study from a Hopf-algebraic point of view. We use for this two interacting bialgebras on quasi-posets. The Ehrhart polynomial defines a Hopf algebra…

We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…

Let $p$ be a prime number. Every two-variable polynomial $f(x_1, x_2)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of surfaces whose Galois group is isomorphic to $\mathbb Z_p$. Our goal of this paper is…

Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…

A set $\mathcal{S}$ of points in $\mathbb{R}^n$ is called a rationally parameterisable hypersurface if $\mathcal{S}=\{\boldsymbol{\sigma}(\mathbf{t}): \mathbf{t} \in D\}$, where $\boldsymbol{\sigma}: \mathbb{R}^{n-1} \rightarrow…

We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…

Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…

We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…