中文
相关论文

相关论文: Ehrhart quasi-polynomials of rational polytopes by…

200 篇论文

Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…

组合数学 · 数学 2026-02-04 Tyrrell B. McAllister , Hélène O. Rochais

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

组合数学 · 数学 2011-09-28 Sheng Chen , Nan Li , Steven V Sam

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

组合数学 · 数学 2020-02-11 Tyrrell B. McAllister

The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…

组合数学 · 数学 2023-08-29 Matthias Beck , Sophia Elia , Sophie Rehberg

A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a…

组合数学 · 数学 2010-05-04 Steven V Sam , Kevin M. Woods

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

组合数学 · 数学 2007-05-23 Matthias Beck

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

组合数学 · 数学 2011-03-04 Eva Linke

Given a rational polytope $P \subset \mathbb R^d$, the numerical function counting lattice points in the integral dilations of $P$ is known to become a quasi-polynomial, called the Ehrhart quasi-polynomial $\mathrm{ehr}_P$ of $P$. In this…

组合数学 · 数学 2024-11-01 Akihiro Higashitani , Satoshi Murai , Masahiko Yoshinaga

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

组合数学 · 数学 2023-08-31 Christopher de Vries , Masahiko Yoshinaga

In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…

组合数学 · 数学 2007-05-23 Matthias Beck

The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…

组合数学 · 数学 2024-09-24 Matthias Beck , Benjamin Braun , Andrés R. Vindas-Meléndez

When extending the Ehrhart lattice point enumerator $L_P(t)$ to allow real dilation parameters $t$, we lose the invariance under integer translations that exists when $t$ is restricted to be an integer. This paper studies this phenomenon;…

组合数学 · 数学 2017-12-07 Tiago Royer

In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of \emph{non}-integral convex polygons. Define a \emph{pseudo-integral…

组合数学 · 数学 2009-06-04 Tyrrell B. McAllister

The Ehrhart function $L_P(t)$ of a polytope $P$ is usually defined only for integer dilation arguments $t$. By allowing arbitrary real numbers as arguments we may also detect integer points entering (or leaving) the polytope in fractional…

组合数学 · 数学 2017-12-13 Tiago Royer

We study the Ehrhart theory of quadratic irrational polytopes that undergo vector dilations. That is, for a given polytope with vertices in $\mathbb{Q}(\sqrt{D})$, and a different dilation factor for each facet, we show that the leading…

数论 · 数学 2018-10-03 Yashaswika Gaur , Tian An Wong

We give novel and explicit formulas for the Ehrhart quasi-polynomials of rational simple polytopes, in terms of Barnes polynomials and discrete moments of half-open parallelepipeds. These formulas also hold for all positive dilations of a…

组合数学 · 数学 2026-02-02 Sinai Robins

Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if…

组合数学 · 数学 2018-09-05 Fu Liu

We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection,…

组合数学 · 数学 2012-12-27 Steven V Sam

Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…

组合数学 · 数学 2014-12-05 Alan Stapledon

The Ehrhart quasi-polynomial of a rational polytope $P$ is a fundamental invariant counting lattice points in integer dilates of $P$. The quasi-period of this quasi-polynomial divides the denominator of $P$ but is not always equal to it:…

组合数学 · 数学 2018-10-31 Alexander M. Kasprzyk , Ben Wormleighton
‹ 上一页 1 2 3 10 下一页 ›