scholarly journals Proof of Chapoton's Conjecture on Newton Polygons of $q$-Ehrhart Polynomials

10.37236/7322 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Jang Soo Kim ◽  
U-Keun Song
Keyword(s):  
Newton Polygon ◽  
Rational Functions ◽  
Newton Polygons ◽  
Ehrhart Polynomial ◽  
Ehrhart Polynomials ◽  
Order Polytope

Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial of an order polytope. In this paper, we prove Chapoton's conjecture.

scholarly journals Solution of tetrahedron equation and cluster algebras

2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
P. Gavrylenko ◽  
M. Semenyakin ◽  
Y. Zenkevich
Keyword(s):  
Integrable System ◽  
Cluster Algebra ◽  
Newton Polygon ◽  
Cluster Algebras ◽  
Weyl Groups ◽  
Newton Polygons ◽  
Tetrahedron Equation ◽  
Affine Weyl Groups ◽  
New Formalism ◽  
Bruhat Cell

Abstract We notice a remarkable connection between the Bazhanov-Sergeev solution of Zamolodchikov tetrahedron equation and certain well-known cluster algebra expression. The tetrahedron transformation is then identified with a sequence of four mutations. As an application of the new formalism, we show how to construct an integrable system with the spectral curve with arbitrary symmetric Newton polygon. Finally, we embed this integrable system into the double Bruhat cell of a Poisson-Lie group, show how triangular decomposition can be used to extend our approach to the general non-symmetric Newton polygons, and prove the Lemma which classifies conjugacy classes in double affine Weyl groups of A-type by decorated Newton polygons.

scholarly journals Generalized Ehrhart polynomials

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Sheng Chen ◽  
Nan Li ◽  
Steven V Sam
Keyword(s):  
Diophantine Equations ◽  
Rational Functions ◽  
Lattice Points ◽  
Classical Theorem ◽  
Number Of Solutions ◽  
Ehrhart Polynomials ◽  
Linear Diophantine Equations ◽  
International Audience

International audience 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 be arbitrary rational functions in $n$. In this case we prove that the number of lattice points in $P(n)$ is a quasi-polynomial for $n$ sufficiently large. Our work was motivated by a conjecture of Ehrhart on the number of solutions to parametrized linear Diophantine equations whose coefficients are polynomials in $n$, and we explain how these two problems are related. Soit $P$ un polytope avec sommets rationelles. Un théorème classique des Ehrhart déclare que le nombre de points du réseau dans les dilatations $P(n) = nP$ est un quasi-polynôme en $n$. Nous généralisons ce théorème en permettant à des sommets de $P(n)$ comme arbitraire fonctions rationnelles en $n$. Dans ce cas, nous prouvons que le nombre de points du réseau en $P(n)$ est une quasi-polynôme pour $n$ assez grand. Notre travail a été motivée par une conjecture d'Ehrhart sur le nombre de solutions à linéaire paramétrée Diophantine équations dont les coefficients sont des polyômes en $n$, et nous expliquer comment ces deux problèmes sont liés.

scholarly journals Gelfand―Tsetlin Polytopes and Feigin―Fourier―Littelmann―Vinberg Polytopes as Marked Poset Polytopes

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Federico Ardila ◽  
Thomas Bliem ◽  
Dido Salazar
Keyword(s):  
Representation Theory ◽  
Lie Algebra ◽  
Lie Algebras ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Ehrhart Polynomial ◽  
International Audience ◽  
Order Polytope ◽  
Finite Partially Ordered Set ◽  
The Relationship

International audience Stanley (1986) showed how a finite partially ordered set gives rise to two polytopes, called the order polytope and chain polytope, which have the same Ehrhart polynomial despite being quite different combinatorially. We generalize his result to a wider family of polytopes constructed from a poset P with integers assigned to some of its elements. Through this construction, we explain combinatorially the relationship between the Gelfand–Tsetlin polytopes (1950) and the Feigin–Fourier–Littelmann–Vinberg polytopes (2010, 2005), which arise in the representation theory of the special linear Lie algebra. We then use the generalized Gelfand–Tsetlin polytopes of Berenstein and Zelevinsky (1989) to propose conjectural analogues of the Feigin–Fourier–Littelmann–Vinberg polytopes corresponding to the symplectic and odd orthogonal Lie algebras. Stanley (1986) a montré que chaque ensemble fini partiellement ordonné permet de définir deux polyèdres, le polyèdre de l'ordre et le polyèdre des cha\^ınes. Ces polyèdres ont le même polynôme de Ehrhart, bien qu'ils soient tout à fait distincts du point de vue combinatoire. On généralise ce résultat à une famille plus générale de polyèdres, construits à partir d'un ensemble partiellement ordonné ayant des entiers attachés à certains de ses éléments. Par cette construction, on explique en termes combinatoires la relation entre les polyèdres de Gelfand-Tsetlin (1950) et ceux de Feigin-Fourier-Littelmann-Vinberg (2010, 2005), qui apparaissent dans la théorie des représentations des algèbres de Lie linéaires spéciales. On utilise les polyèdres de Gelfand-Tsetlin généralisés par Berenstein et Zelevinsky (1989) afin d'obtenir des analogues (conjecturés) des polytopes de Feigin-Fourier-Littelmann-Vinberg pour les algèbres de Lie symplectiques et orthogonales impaires.

scholarly journals Commutative and non-commutative bialgebras of quasi-posets and applications to Ehrhart polynomials

2019 ◽  
Vol 10 (1) ◽  
pp. 27-63 ◽  
Author(s):  
Loïc Foissy
Keyword(s):  
Hopf Algebra ◽  
Point Of View ◽  
Duality Principle ◽  
Algebraic Proof ◽  
Ehrhart Polynomial ◽  
Algebraic Point ◽  
Ehrhart Polynomials ◽  
Lattice Polytope ◽  
Algebra Morphism

Abstract 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 morphism with values in \mathbb{Q}[X] . We deduce from the interacting bialgebras an algebraic proof of the duality principle, a generalization and a new proof of a result on B-series due to Whright and Zhao, using a monoid of characters on quasi-posets, and a generalization of Faulhaber’s formula. We also give non-commutative versions of these results, where polynomials are replaced by packed words. We obtain, in particular, a non-commutative duality principle.

On Newton polygons techniques and factorization of polynomials over Henselian fields

2019 ◽  
Vol 19 (10) ◽  
pp. 2050188
Author(s):  
Lhoussain El Fadil
Keyword(s):  
Newton Polygon ◽  
Monic Polynomial ◽  
Local Fields ◽  
Algebraic Number Theory ◽  
Newton Polygons ◽  
Valued Field ◽  
Rank One ◽  
Difference Polynomials ◽  
Polynomial Formula ◽  
Factorization Of Polynomials

Let [Formula: see text] be a valued field, where [Formula: see text] is a rank-one discrete valuation, with valuation ring [Formula: see text]. The goal of this paper is to investigate some basic concepts of Newton polygon techniques of a monic polynomial [Formula: see text]; namely, theorem of the product, of the polygon, and of the residual polynomial, in such way that improves that given in [D. Cohen, A. Movahhedi and A. Salinier, Factorization over local fields and the irreducibility of generalized difference polynomials, Mathematika 47 (2000) 173–196] and generalizes that given in [J. Guardia, J. Montes and E. Nart, Newton polygons of higher order in algebraic number theory, Trans. Amer. Math. Soc. 364(1) (2012) 361–416] to any rank-one valued field.

scholarly journals Newton polygons for L-functions of generalized Kloosterman sums

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Chunlin Wang ◽  
Liping Yang
Keyword(s):  
Lower Bound ◽  
Newton Polygon ◽  
Decomposition Theorem ◽  
Kloosterman Sums ◽  
Local Theory ◽  
Newton Polygons

Abstract In the present paper, we study the Newton polygons for the L-functions of n-variable generalized Kloosterman sums. Generally, the Newton polygon has a topological lower bound, called the Hodge polygon. In order to determine the Hodge polygon, we explicitly construct a basis of the top-dimensional Dwork cohomology. Using Wan’s decomposition theorem and diagonal local theory, we obtain when the Newton polygon coincides with the Hodge polygon. In particular, we concretely get the slope sequence for the L-function of F ¯ ⁢ ( λ ¯ , x ) := ∑ i = 1 n x i a i + λ ¯ ⁢ ∏ i = 1 n x i - 1 , \bar{F}(\bar{\lambda},x):=\sum_{i=1}^{n}x_{i}^{a_{i}}+\bar{\lambda}\prod_{i=1}% ^{n}x_{i}^{-1}, with a 1 , … , a n {a_{1},\ldots,a_{n}} being pairwise coprime for n ≥ 2 {n\geq 2} .

ON -DIVISIBLE GROUPS WITH SATURATED NEWTON POLYGONS

2017 ◽  
Vol 232 ◽  
pp. 96-120
Author(s):  
SHUSHI HARASHITA
Keyword(s):  
Positive Characteristic ◽  
Newton Polygon ◽  
Divisible Group ◽  
Geometric Proof ◽  
Newton Polygons ◽  
Noetherian Scheme ◽  
Weil Divisor ◽  
Divisible Groups

This paper concerns the classification of isogeny classes of$p$-divisible groups with saturated Newton polygons. Let$S$be a normal Noetherian scheme in positive characteristic$p$with a prime Weil divisor$D$. Let${\mathcal{X}}$be a$p$-divisible group over$S$whose geometric fibers over$S\setminus D$(resp. over$D$) have the same Newton polygon. Assume that the Newton polygon of${\mathcal{X}}_{D}$is saturated in that of${\mathcal{X}}_{S\setminus D}$. Our main result (Corollary 1.1) says that${\mathcal{X}}$is isogenous to a$p$-divisible group over$S$whose geometric fibers are all minimal. As an application, we give a geometric proof of the unpolarized analogue of Oort’s conjecture (Oort, J. Amer. Math. Soc.17(2) (2004), 267–296; 6.9).

scholarly journals The Newton tree: geometric interpretation and applications to the motivic zeta function and the log canonical threshold

2015 ◽  
Vol 159 (3) ◽  
pp. 481-515 ◽  
Author(s):  
PIERRETTE CASSOU-NOGUÈS ◽  
WILLEM VEYS
Keyword(s):  
Zeta Function ◽  
Newton Polygon ◽  
Geometric Interpretation ◽  
Canonical Model ◽  
Newton Polygons ◽  
Log Canonical Threshold ◽  
Newton Algorithm ◽  
Log Canonical ◽  
Motivic Zeta Function ◽  
The Ideal

AbstractLet${\mathcal I}$be an arbitrary ideal in${\mathbb C}$[[x,y]]. We use the Newton algorithm to compute by induction the motivic zeta function of the ideal, yielding only few poles, associated to the faces of the successive Newton polygons. We associate a minimal Newton tree to${\mathcal I}$, related to using good coordinates in the Newton algorithm, and show that it has a conceptual geometric interpretation in terms of the log canonical model of${\mathcal I}$. We also compute the log canonical threshold from a Newton polygon and strengthen Corti's inequalities.

scholarly journals NEWTON POLYGONS FOR CHARACTER SUMS AND POINCARÉ SERIES

2011 ◽  
Vol 07 (06) ◽  
pp. 1519-1542 ◽  
Author(s):  
RÉGIS BLACHE
Keyword(s):  
Asymptotic Behavior ◽  
Convex Polytopes ◽  
Newton Polygon ◽  
Character Sums ◽  
Laurent Polynomials ◽  
Newton Polygons ◽  
Poincare Series ◽  
First Results ◽  
Free Sum

In this paper, we precise the asymptotic behavior of Newton polygons of L-functions associated to character sums, coming from certain n variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This operation allows the determination of the limit of generic Newton polygons for the sum Δ = Δ1⊕Δ2 when we know the limit of generic Newton polygons for each factor. To our knowledge, these are the first results concerning the asymptotic behavior of Newton polygons for multivariable polynomials when the generic Newton polygon differs from the combinatorial (Hodge) polygon associated to the polyhedron.

scholarly journals Ehrhart $f^*$-Coefficients of Polytopal Complexes are Non-negative Integers

10.37236/2106 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Felix Breuer
Keyword(s):  
Complete Characterization ◽  
Lattice Points ◽  
Ehrhart Polynomial ◽  
Simplicial Cone ◽  
Ehrhart Theory ◽  
Ehrhart Polynomials ◽  
Integer Points ◽  
Polytopal Complex ◽  
Main Technical Tool

The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart $\delta$-vector), which is the vector of coefficients of $L_P$ with respect to a certain binomial basis and which coincides with the $h$-vector of a regular unimodular triangulation of $P$ (if one exists). One important result by Stanley about $h^*$-vectors of polytopes is that their entries are always non-negative. However, recent combinatorial applications of Ehrhart theory give rise to polytopal complexes with $h^*$-vectors that have negative entries.In this article we introduce the Ehrhart $f^*$-vector of polytopes or, more generally, of polytopal complexes $K$. These are again coefficient vectors of $L_K$ with respect to a certain binomial basis of the space of polynomials and they have the property that the $f^*$-vector of a unimodular simplicial complex coincides with its $f$-vector. The main result of this article is a counting interpretation for the $f^*$-coefficients which implies that $f^*$-coefficients of integral polytopal complexes are always non-negative integers. This holds even if the polytopal complex does not have a unimodular triangulation and if its $h^*$-vector does have negative entries. Our main technical tool is a new partition of the set of lattice points in a simplicial cone into discrete cones. Further results include a complete characterization of Ehrhart polynomials of integral partial polytopal complexes and a non-negativity theorem for the $f^*$-vectors of rational polytopal complexes.

Sign in / Sign up

Export Citation Format

Share Document