中文
相关论文

相关论文: Universal conditions on $h^*$-vectors of lattice s…

200 篇论文

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.…

组合数学 · 数学 2007-05-23 Victor Batyrev

In this paper, we show the existence of universal inequalities for the $h^*$-vector of a lattice polytope P, that is, we show that there are relations among the coefficients of the $h^*$-polynomial which are independent of both the…

组合数学 · 数学 2017-03-29 Gabriele Balletti , Akihiro Higashitani

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

组合数学 · 数学 2008-09-29 Benjamin Nill

For an $n$-dimensional lattice simplex $\Delta_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for…

组合数学 · 数学 2018-07-20 Benjamin Braun , Fu Liu

Many homogeneous polynomials that arise in the study of sums of squares and Hilbert's 17th problem come from monomial substitutions into the arithmetic-geometric inequality. In 1989, the second author gave a necessary and sufficient…

组合数学 · 数学 2019-09-25 Victoria Powers , Bruce Reznick

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…

组合数学 · 数学 2010-02-14 Christian Haase , Benjamin Nill , Sam Payne

A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…

组合数学 · 数学 2019-10-25 Johannes Hofscheier , Lukas Katthän , Benjamin Nill

The local $h^*$-polynomial of a lattice polytope is an important invariant arising in Ehrhart theory. Our focus is on lattice simplices presented in Hermite normal form with a single non-trivial row. We prove that when the off-diagonal…

Let X be a K3 surface with a polarization H of degree H^2=2rs and with a primitive Mukai vector (r,H,s). The moduli space of sheaves over X with the isotropic Mukai vector (r,H,s) is again a K3 surface Y. We prove that Y\cong X, if Picard…

代数几何 · 数学 2009-12-10 Viacheslav V. Nikulin

As is well known, h-vectors of simple (or simplicial) convex polytopes are characterized. In fact, those h-vectors must satisfy Dehn-Sommerville equations and some other inequalities. Simple convex polytopes determine Gorenstein* simplicial…

组合数学 · 数学 2007-05-23 Mikiya Masuda

We study $h$-vectors of simplicial complexes which satisfy Serre's condition ($S_r$). We say that a simplicial complex $\Delta$ satisfies Serre's condition ($S_r$) if $\tilde H_i(\lk_\Delta(F);K)=0$ for all faces $F \in \Delta$ and for all…

交换代数 · 数学 2009-12-08 Satoshi Murai , Naoki Terai

If $P$ is a lattice polytope (that is, the convex hull of a finite set of lattice points in $\mathbf{R}^n$), then every sum of $h$ lattice points in $P$ is a lattice point in the $h$-fold sumset $hP$. However, a lattice point in the…

数论 · 数学 2020-04-17 Melvyn B. Nathanson

There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…

组合数学 · 数学 2020-01-14 Liam Solus

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

组合数学 · 数学 2009-01-13 Jaron Treutlein

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…

组合数学 · 数学 2015-03-20 Akihiro Higashitani , Benjamin Nill , Akiyoshi Tsuchiya

We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even $n$ and every integer $k\geq 1$, we show that under the constraint $\sum_{i=1}^n a_i^2=1$ the global minimum of the even-degree polynomial…

概率论 · 数学 2025-12-16 Silouanos Brazitikos , Christos Pandis

An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal $h^*$-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider…

组合数学 · 数学 2014-08-28 Benjamin Braun , Robert Davis

The local $h^*$-polynomial is a natural invariant of a lattice polytope appearing in Ehrhart theory and Hodge theory. In this work, we study the question posed in [GKZ94] concerning the classification of lattice simplices with vanishing…

组合数学 · 数学 2025-12-23 Vadym Kurylenko

The family of lattice simplices in $\mathbb{R}^n$ formed by the convex hull of the standard basis vectors together with a weakly decreasing vector of negative integers include simplices that play a central role in problems in enumerative…

组合数学 · 数学 2017-10-05 Liam Solus

The cut polytope of a graph is an important object in several fields, such as functional analysis, combinatorial optimization, and probability. For example, Sturmfels and Sullivant showed that the toric ideals of cut polytopes are useful in…

组合数学 · 数学 2020-04-13 Ryuichi Sakamoto
‹ 上一页 1 2 3 10 下一页 ›