English
Related papers

Related papers: Lattice polytopes from Schur and symmetric Grothen…

200 papers

We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…

Combinatorics · Mathematics 2025-01-09 Su Ji Hong , George D. Nasr

Given a family of lattice polytopes, a common endeavor in Ehrhart theory is the classification of those polytopes in the family that are Gorenstein, or more generally level. In this article, we consider these questions for…

Combinatorics · Mathematics 2020-08-19 Florian Kohl , McCabe Olsen

In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…

Combinatorics · Mathematics 2016-01-20 Sandra Di Rocco , Christian Haase , Benjamin Nill , Andreas Paffenholz

Let $X$ be the family of hypersurfaces in the odd-dimensional torus ${\mathbb T}^{2n+1}$ defined by a Laurent polynomial $f$ with fixed exponents and variable coefficients. We show that if $n\Delta$, the dilation of the Newton polytope…

Algebraic Geometry · Mathematics 2018-06-28 Alan Adolphson , Steven Sperber

We study the integer decomposition property of lattice polytopes associated with the $n$-dimensional smooth complete fans with at most $n+3$ rays. Using the classification of smooth complete fans by Kleinschmidt and Batyrev and a reduction…

Combinatorics · Mathematics 2024-10-01 Sharon Robins

First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…

Combinatorics · Mathematics 2011-11-07 Eugen J. Ionascu

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…

Combinatorics · Mathematics 2020-06-26 Max Hlavacek , Liam Solus

For each integer partition $\mathbf{q}$ with $d$ parts, we denote by $\Delta_{(1,\mathbf{q})}$ the lattice simplex obtained as the convex hull in $\mathbb{R}^d$ of the standard basis vectors along with the vector $-\mathbf{q}$. For…

Combinatorics · Mathematics 2020-10-27 Benjamin Braun , Derek Hanely

We study rational generating functions of sequences $\{a_n\}_{n\geq 0}$ that agree with a polynomial and investigate symmetric decompositions of the numerator polynomial for subsequences $\{a_{rn}\}_{n\geq 0}$. We prove that if the…

Combinatorics · Mathematics 2021-01-29 Katharina Jochemko

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

Combinatorics · Mathematics 2013-09-23 Victor Batyrev , Johannes Hofscheier

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

Combinatorics · Mathematics 2007-05-23 M. Beck , J. A. De Loera , M. Develin , J. Pfeifle , R. P. Stanley

In this paper, we give a formula for the number of lattice points in the dilations of Schubert matroid polytopes. As applications, we obtain the Ehrhart polynomials of uniform and minimal matroids as special cases, and give a recursive…

Combinatorics · Mathematics 2022-12-07 Neil J. Y. Fan , Yao Li

We study higher-dimensional analogs of the Dedekind-Carlitz polynomials c(u,v;a,b) := sum_{k=1..b-1} u^[ka/b] v^(k-1), where u and v are indeterminates and a and b are positive integers. Carlitz proved that these polynomials satisfy the…

Number Theory · Mathematics 2008-12-20 Matthias Beck , Christian Haase , Asia R. Matthews

We show that the support of the Grothendieck polynomial $\mathfrak G_w$ of any fireworks permutation is as large as possible: a monomial appears in $\mathfrak G_w$ if and only if it divides $\mathbf x^{\mathrm{wt}(\overline{D(w)})}$ and is…

Combinatorics · Mathematics 2025-08-14 Jack Chen-An Chou , Linus Setiabrata

If $P$ is a lattice polytope (i.e., $P$ is the convex hull of finitely many integer points in $\mathbb{R}^d$) of dimension $d$, Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|nP \cap \mathbb{Z}^d|$ is a…

Combinatorics · Mathematics 2024-09-24 Esme Bajo , Matthias Beck

Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…

Combinatorics · Mathematics 2017-11-30 Benjamin Braun

For a skew shape $\lambda/\mu$, we define the hybrid Grothendieck polynomial $${G}_{\lambda/\mu}(\textbf{x};\textbf{t};\textbf{w}) =\sum_{T\in \mathrm{SVRPP}(\lambda/\mu)} \textbf{x}^{\mathrm{ircont}(T)}\textbf{t}^{\mathrm{ceq}…

Combinatorics · Mathematics 2025-05-27 Peter L. Guo , Mingyang Kang , Jiaji Liu

The symmetric Grothendieck polynomials representing Schubert classes in the $K$-theory of Grassmannians are generating functions for semistandard set-valued tableaux. We construct a type $A_n$ crystal structure on these tableaux. This…

Combinatorics · Mathematics 2021-09-14 Cara Monical , Oliver Pechenik , Travis Scrimshaw

Let P be a lattice polytope in R^n, and let P \cap Z^n = {v_1,...,v_N}. If the N + \binom N2 points 2v_1,...,2v_N; v_1+v_2,...v_{N-1}+v_N are distinct, we say that P is a "distinct pair-sum" or "dps" polytope. We show that, if P is a dsp…

Combinatorics · Mathematics 2007-05-23 M. D. Choi , T. Y. Lam , Bruce Reznick

Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…

Classical Analysis and ODEs · Mathematics 2019-01-14 Daniel Duviol Tcheutia