English
Related papers

Related papers: Lattice Points in the Newton Polytopes of Key Poly…

200 papers

We study lattice point visibility along polynomial lines of sight and prove the Visibility Density Conjecture of Chaubey and Pandey for a large class of polynomials.

Number Theory · Mathematics 2026-04-29 Abraham Lobsenz , Tristan Phillips

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

Combinatorics · Mathematics 2018-08-14 Lin Jiu , Diane Yahui Shi

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Number Theory · Mathematics 2018-06-05 Bence Borda

We show that the number of lattice points in the boundary of a positive integer dilate of a Delzant integral polytope is a polynomial in the dilation parameter, analogous to the Ehrhart polynomial giving the number of lattice points in a…

Combinatorics · Mathematics 2026-01-21 Jonathan Weitsman

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Combinatorics · Mathematics 2017-10-17 Laura Escobar , Alexander Yong

In this paper we prove a generalization of famous Larchr's theorem concerning good lattice points.

Number Theory · Mathematics 2012-03-15 Dmitry Ushanov

For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…

Metric Geometry · Mathematics 2012-04-30 Martin Henk , Eva Linke

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…

Dynamical Systems · Mathematics 2018-05-16 Magnus Aspenberg , Pascale Roesch

Some occurrences of $n$ can be replaced by $n-1$ in a special case of the Shapley-Folkman lemma.

Combinatorics · Mathematics 2020-12-14 David Handelman

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…

Combinatorics · Mathematics 2010-02-14 Christian Haase , Benjamin Nill , Sam Payne

The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…

Number Theory · Mathematics 2026-01-26 Chahat Ahuja

We give a new demonstration of Loewner's characterization of polynomials, solving in the positive a conjecture proposed by Laird and McCann in 1984.

Classical Analysis and ODEs · Mathematics 2016-05-04 J. M. Almira

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…

Combinatorics · Mathematics 2009-01-13 Jaron Treutlein

We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…

Algebraic Geometry · Mathematics 2019-02-12 Colin Tan , Wing-Keung To

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

Combinatorics · Mathematics 2016-04-05 Amanda Cameron , Alex Fink

Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…

Complex Variables · Mathematics 2015-03-17 Dmitry Khavinson , Rajesh Pereira , Mihai Putinar , Edward B. Saff , Serguei Shimorin

We study the relation between the lattice points of a stacky polytope and a prequantisation of the stack associated to the stacky polytope. We introduce a prequantisation of a Deligne--Mumford stack and discuss the uniqueness and the…

Algebraic Topology · Mathematics 2014-08-29 Hironori Sakai

Schubitopes were introduced by Monical, Tokcan and Yong as a specific family of generalized permutohedra. It was proven by Fink, M\'esz\'aros and St.$\,$Dizier that Schubitopes are the Newton polytopes of the dual characters of flagged Weyl…

Combinatorics · Mathematics 2020-08-14 Neil J. Y. Fan , Peter L. Guo

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

Combinatorics · Mathematics 2024-05-08 Khanh Nguyen Duc , Nguyen Thi Ngoc Giao , Dang Tuan Hiep , Do Le Hai Thuy
‹ Prev 1 2 3 10 Next ›