Arnold’s Piecewise Linear Filtrations, Analogues of Stanley–Reisner Rings and Simplicial Newton Polyhedra

In 1974, the author proved that the codimension of the ideal (g1, g2, . . . , gd) generated in the group algebra K[Zd] over a field K of characteristic 0 by generic Laurent polynomials having the same Newton polytope Γ is equal to d!×Volume(Γ). Assuming that Newtons polytope is simplicial and super-convenient (that is, containing some neighborhood of the origin), the author strengthens the 1974 result by explicitly specifying the set Bsh of monomials of cardinality d! × Volume(Γ), whose equivalence classes form a basis of the quotient algebra K[Z]/(g1, g2, . . . , gd). The set Bsh is constructed inductively from any shelling sh of the polytope Γ. Using the Bsh structure, we prove that the associated graded K -algebra grΓ(K[Zd]) constructed from the Arnold–Newton filtration of K -algebra K[Zd] has the Cohen–Macaulay property. This proof is a generalization of B. Kind and P. Kleinschmitt’s 1979 proof that Stanley–Reisner rings of simplicial complexes admitting shelling are Cohen–Macaulay. Finally, we prove that for generic Laurent polynomials ( f1, f2, . . . , fd) with the same Newton polytope Γ, the set Bsh defines a monomial basis of the quotient algebra K[Z]/(g1, g2, . . . , gd).


Prehistory
Using the Newton polytope Γ of the Taylor series of an analytic function, V.I. Arnold constructed in 1974 a filtration in the ring of germs of analytic functions [1]. He called this filtration piecewise linear filtration. Today, this filtration and similar filtrations in Kalgebras of polynomials, Laurent polynomials and formal series over the field K are called Newton filtrations. The study of the associated graded rings constructed by the Newton-Arnold filtration in the rings of polynomials and formal series was performed by the author in [2][3][4]. The central result of the study was the establishment of the Cohen-Macaulay property of these rings. This property was proved by homological methods, using a nontrivial result obtained by M. Hochster in 1972 that semigroup K-algebras of conic semigroups in Z d possess the Cohen-Macaulay property [5]. My proof of the Cohen-Macaulay property of the associated graded ring was rather general and complex. In this proof, the associated graded ring arising from the Newton filtration was considered as a result of gluing some graded rings according to the combinatorial scheme determined by the polyhedral complex of faces of the Newton polytope. Similar schemes for proving the Cohen-Macaulay property of complex rings by reduction to simpler rings are discussed in M. Hochster's article [6]. The simpler rings in my proof were semigroup rings of conical semigroups in Z d . Their Cohen-Macaulayness is a non-trivial fact, proved by M. Hochster in 1972. Furthermore, the Cohen-Macaulayness of the result of gluing such rings according to the combinatorial scheme defined by a polyhedral complex is proved in my article under the assumption that the polyhedral complex has the homology of a sphere or a disk and does not use the fact that the complex can be realized as the boundary of a convex polytope.
Today, I am aware that my 1975 proof applies to simplicial triangulations of homological spheres and allows us to prove the Cohen-Macaulay property of Stanley-Reisner rings of such simplicial triangulations. Another justification for the usefulness of my proof is that it allows us to re-prove the result of M. Hochster on the Cohen-Macaulay property of semigroup rings of conic semigroups. A sketch of the proof of M. Hochster's theorem by constructing Newton polytopes for elements of semigroup rings of conic semigroups is given in Section 5.12 in [4] and retold in [7].

Fulfilling the Wishes of V.I. Arnold Dated 1975
My proof of the Cohen-Macaulay property of the associated graded rings was far from the issues that were addressed in V. Arnold's seminar at Moscow State University in the 1970s. V. Arnold considered this proof to be complicated and, in contrast to the consequences I derived from it, not intuitively clear.
In terms of intuitively clear results, highly appreciated by V.I. Arnold, there were explicit formulas expressing in terms of the volumes of Newton polytopes a number of topological characteristics of generic polynomials and germs of analytic functions: the multiplicity of a singular point of an analytic function, the Euler characteristic of a level surface of a polynomial, and the number of solutions of a polynomial system of d equations with d unknowns in the case when all equations have the same Newton polytope. The simplest and most famous of these results is an explicit formula for the number of solutions of a generic polynomial system of equations with a given Newton polytope. By the well-known theorem of commutative algebra, in the case when the field K is algebraically closed, this number of solutions, taking into account the multiplicities, is equal to the codimension of the ideal generated in the K-algebra of Laurent polynomials K[Z d ] by equations of the system g 1 = g 2 = . . . = g d = 0. For generic polynomials, this codimension is finite and equal to the number of elements of the monomial basis of the quotient algebra K[Z d ]/(g 1 , g 2 , . . . , g d ). (Here and below, a monomial basis of a quotient algebra is known as the set of monomials of the original algebra whose equivalence classes generate a quotient algebra over K.) Important information about an ideal of finite codimension is provided not only by the number of elements of the monomial basis of the quotient algebra, but also by the arrangement of the elements of this basis with respect to the Newton polytope. The examples of calculating monomial bases for the simplest nontrivial Newton polytopes, given in the work [8], inspired the author to continue, almost half a century later, research dated 1974, for one important special case. It turned out that the monomial basis for generic simplicial Newton polytopes can be specified explicitly. This fact allows to prove the Cohen-Macaulay property of A(Γ) by constructive manipulations with monomials in the spirit of V. Arnold's "crossword solution" technique, Example 9.6 in [1], and in the spirit of the reasoning of the article by B. Kind and P. Kleinschmitt in 1979 on the Cohen-Macaulay property of Stanley-Reisner rings of simplicial complexes admitting shelling [9]. The results of the last article are retold in R. Stanley's online publications [10].
Having explicitly indicated the basis of the quotient algebra of Laurent polynomials in d variables modulo the ideal generated by d generic polynomials with a given Newton polytope, I, with many years' delay, succeed in fulfilling V. Arnold's wish to improve the clarity of the algebraic proof of the theorem on the number of solutions of a system of generic polynomial equations with a given Newton polytope.
At the same time, I was able to improve the formulation of the theorem by constructing, for the super-convenient Newton polytope Γ and its shelling sh, the so-called Shelling Extension Γ sh of the Newton polytope Γ, see Section 2.5 below. The Shelling Extension is non-closed and, generally speaking, a non-convex polytope. The semi-open polytope Γ sh is composed of disjoint semi-open parallelepipeds. The volume of each of these parallelepipeds is equal to the number of integral points it contains. Therefore, the cardinality of the set B sh ∈ Γ sh is equal to the volume of Γ sh , which in turn is equal to d! × Volume(Γ).
The elements of the set B sh , in the general case, define a monomial basis of the quotient algebra K[Z d ]/(g 1 , g 2 , . . . , g d ). The closure of a Shelling Extension does not depend on the choice of a shelling, and is a polytope homeomorphic to a disk, generally speaking, nonconvex, the boundary of which is composed of flat (d − 1)-dimensional parallelepipeds.
The volume of this particular polytope Γ sh is equal to the number of solutions of a generic polynomial system of equations with a given Newton polytope.

Associated Graded Rings of Newton Filtered Rings and Stanley-Reisner Face Rings
Working on this paper, I managed to find the idea of the manipulations necessary for proving the Cohen-Macaulay property of associated graded rings in the theory of simplicial complexes. If the polytope Γ is simplicial, then the associated graded ring A(Γ) constructed from the Newton-Arnold filtration defined by the super-convenient polytope Γ in the space of Laurent polynomials in several variables over the field K can be considered as an analogue of the so-called face ring of the simplicial complex of the boundary of the polytope Γ. Face rings were introduced in 1974 by R. Stanley and G. Reisner [11] to study the combinatorial properties of simplicial complexes. For the complex of faces of the super-convenient (having the origin of coordinates by an interior point) simplicial Newton polytope Γ, the Stanley-Reisner ring can be identified with the subring in the associated graded ring A(Γ) generated by the monomials corresponding to the vertices of Γ. In the simplest cases, the Stanley-Reisner subring can coincide with the entire ring A(Γ). Just as Stanley-Reisner rings are related to f-polynomials and h-polynomials of simplicial complexes, rings of the form A(Γ) are related to the Ehrhart polynomial of convex integral polyhedra, but we will not touch on this issue. I managed to spy on monomial manipulations useful for working with associated graded rings in the 1979 paper by B. Kind and P. Kleinschmitt on the Cohen-Macaulay property of Stanley-Reisner rings of shellable simplicial complexes [9]. The reasoning of B. Kind and P. Kleinschmitt about simplicial complexes admitting shelling can be applied to associated graded rings defined by simplicial Newton polytopes, since H. Bruggesser and P. Mani proved in 1971 that the complex of faces of any convex polytope admits shelling [12]. The results of this original work have been re-exposed in many publications, for example, in [13]. The definition of the shelling of a simplicial convex polytope will be given below in Section 2.1. Monomial bases similar to that constructed in this article, with minor changes in construction and proof, can be constructed for conventional polynomials and formal series. Furthermore, in this case, an explicit indication of the basis is more informative, since the origin in K d is fixed by the very proposition of the problem. The author plans to publish these generalizations in the near future.

Approximation of a Non-Simplicial Newton Polytope by a Simplicial One
An arbitrary convex polytope with integer vertices in the space R d can be approximated by simplicial polytopes with rational vertices. This fact allows us to reduce the question about the number of solutions of a system of equations with an non-simpicial Newton polytope to the question about the number of solutions to a system of equations with a simplicial Newton polytope and thus apply the results of this article to obtain another proof of the formula for the number of solutions of a polynomial system of equations with a given arbitrary (not only simplicial) Newton polytope.
The author plans to include a rigorous justification of this reasoning in a publication devoted to polynomials and formal series with Newtonian simplicial polytopes.

Explicit Construction of a Monomial Basis for Factor Algebra of Laurent Polynomials Modulo Ideal Generated by Generic Polynomials with the Same Non-Simplicial Newton Polytope
The shelling-dependent basis construction can be generalized to the super-convenient Newton polytope Γ, which is not simplicial. This is possible because the boundary of an arbitrary convex polytope can be split into simplices so that the resulting simplicial complex admits shelling sh. Repeating the constructions of this article, starting with a fixed shelling of the simplicial subdivision Γ, we obtain an semi-open polytope Γ sh , whose integer points define some set of monomials B of cardinality d! × Volume(Γ). There are reasons to believe that for generic polynomials this set of monomials will be a basis for the quotient algebra K[Z d ]/(g 1 , g 2 , . . . , g d ). In the simplest examples, this hypothesis could be verified using computer algebra systems.
The author does not plan to tackle this problem on his own or together with his students and staff in the near future.

Development of a Module for Computer Algebra Systems that Generates the Basis Built in This Article, Having Received as Input a Simplicial Super-Convenient Polytope and Its Shelling
The author does not plan to tackle this problem on his own or together with his students and staff in the near future.

Preparation of Student Workshops on Acquaintance with Computer Systems of Convex Geometry and Commutative Algebra Based on the Material of This Article
Checking the main result of this article in two-dimensional and three-dimensional cases, in view of the clarity of the geometric and algebraic objects appearing in the main theorem, can form the basis of a student workshop on acquaintance with modern computer systems of convex geometry and commutative algebra. The author plans to start developing similar workshops in the 2022-2023 academic year .
1.4.6. An Interesting Unsolved Problem of Explicitly Constructing a Monomial Basis for the Jacobian Ideal of a Formal Series in d Variables with a Given Simplicial Newton Polytope In this section, I adhere to the notation of paper [4] and denote the Newton polytope of the formal series g in d variables by Γ − (g). For the Laurent polynomial g with Newton polytope Γ, the Jacobian ideal J generated by ordinary partial derivatives coincides with the ideal J tor generated by tweaked partial derivatives which we will call "toric" derivatives. Therefore, for a generic Laurent polynomial, the codimensions of these two ideals coincide and are equal to d! × Volume(Γ(g)). The monomial bases of the corresponding rings also coincide. For a tuple of formal series or polynomial g in d variables, the Jacobian ideal is obviously different from the ideal generated by the toric derivatives. Moreover, for a tuple of convenient (in the sense of [4]) formal series g, the toric derivatives have the same Newton polytope Γ − (g) as the original series g, and therefore, for generic tuple of series g the codimension of the ideal J tor (g) is given by a formula similar in structure to the formula for the codimension of the Jacobi ideal of the Laurent polynomial codim K (J log (g)) = d! × Volume(Γ − (g)) Moreover, the codimension of conventional Jacobian ideal J(g) for generic tuple of series g is given by some more complicated formula, the so-called formula for the Newton number ν(Γ − ). This formula includes both the volume V d of the polytope Γ − itself, and an alternating sum of the volumes of intersections of this polytope with all possible coordinate subspaces of the same dimension Arnold was worried about some complexity and unintuitiveness of this formula and he proposed a problem that would stimulate the study of the internal structure of this formula. Namely, V. Arnold proposed to prove by purely combinatorial reasoning the nondecreasity of Newtons number under the extension of a polytope by combinatorial reasoning. In the published list of problems by V. Arnold [14], this problem dates back to 1982 and is formulated as follows: Consider a Newton polytope ∆ ∈ R n and the number where V is the volume under ∆, V i is the volume under ∆ on the hyperplane x i = 0, V ij is the volume under ∆ on the hyperplane x i = x j = 0, and so on. Then, µ(∆) grows (non strictly monotonically) as ∆ grows (whenever ∆ remains coconvex and integer). There is no elementary proof even for n = 2. Particular solutions to this Arnold problem for three variables were found in [15]. In 2020, Moscow student F. Selyanin announced a solution to V. Arnold's problem in arbitrary dimension [16]. The solution is based on the representation of Newtons number as a sum of positive terms. Since the Newton number is equal to the number of elements of the monomial basis of the factor algebra of the Laurent polynomial algebra modulo Jacobian ideal of the generic Laurent polynomial, the idea arises to construct this monomial basis explicitly and to prove the monotonicity of the Newton number under the extension of the polytope, checking that the sets of basis monomials themselves grow monotonically, and not just the cardinalities of these sets. With this approach, the representation of the cardinality of a set in the form of a sum of positive terms, proposed by F. Selyanin, may hypothetically turn out to be a consequence of some reasonable partition of the set of monomials of the basis into disjoint subsets. Therefore, it is possible that constructions from the cited work of F. Selyanin could help in guessing the structure of the monomial basis. According to F. Selyanin's private communication, the published announcement [16] contains inaccuracies and F. Selyanin plans to prepare a corrected proof in the near future.

Definitions and Notations That Do Not Use Newtons Polytope Shelling
All objects, designations, definitions and conventions introduced in this and the following sections marked with • will remain in effect until the end of the article and will not be redefined: • d ≥ 2-the dimension of the Newton polytope and the ambient vector space; • K-field of characteristic 0; • In this article, only rings endowed with the structure of a K-algebras will be considered, so we will consider the terms K-algebra, algebra, ring as synonyms; • R d -the vector space over R of d-tuples of the form (y 1 , y 2 , . . . , y d ), equipped with coordinate-wise operations of addition and multiplication by a real number, equipped with the usual topology. We fix coordinates y 1 , y 2 , . . . , y d on this space and call them y-coordinates. It will be convenient for us, depending on the context, to call the elements of the vector space R d points or vectors. We will call a point p ∈ R d integer if all of its y-coordinates are integers; • Volume-nonnegative volume (measure) in R d , normalized by the condition: volume of a unit cube in y-coordinates is equal to 1; • Let X and Y be two sets in R d . We call the set defined by the formula the Minkowski sum of sets X and Y, The Minkowski sum of a finite number of sets is defined in a similar way.
If Y is a one-point set {y} consisting of one element y, then, to simplify the notation, we will write instead of X ⊕ {y} just X ⊕ y; • We will consider various subsemigroups of the group Z d , both with a neutral element and without it. An example of a subsemigroup without a neutral element is the set of d-tuples of integers in which the first r > 0 components are positive and the rest are non-negative; We say that a point p + g ∈ Cone(∆) is a shift of a point p ∈ Cone(∆) by an element g ∈ V(∆). Obviously, for g 1 = g 2 the shifts of any point p ∈ Cone(∆) by g 1 and g 2 do not coincide. The orbit of a point p ∈ Cone(∆) under the action of the vertex semigroup V(∆) is the set of all shifts of this point: g∈V (p + r). The complete semigroup A(∆) is invariant under shifts by elements of the vertex semigroup, i.e., the orbit of any point p ∈ A(∆) under the action of the vertex semigroup lies in A(∆); • The number of points in a finite set X will be denoted by #X.

K-Algebra of Laurent Polynomials
We call the monomial in formal variables x 1 , x 2 , . . . , x d an expression of the form where n ∈ Z d . We will say that x n corresponds to a point n ∈ Z d . The exponent of the monomial x n = x n 1 1 x n 2 2 . . . x n d d is the row vector (n 1 , n 2 , . . . , n d ) ∈ Z d . We will denote this vector by Log(x n ). Obviously, the monomial m = x n satisfies the identity m = x Log(m) . A monomial with zero exponent will be called unit monomial. A non-null Laurent polynomial is a formal finite linear combination of monomials with non-null coefficients from the field K. The null Laurent polynomial is an empty linear combination of monomials and we denote this polynomial by the same symbol as the zero element of the field K. Each Laurent polynomial defines a function on the group Z d with values in K, which takes a nonzero value on a finite set of points. The multiplication of Laurent polynomials corresponds to the convolution of the corresponding functions on the group Z d . Thus, Laurent polynomials with coefficients in the field K can be considered as a group K-algebra K[Z d ] of finite functions on the group Z d . In addition to the group Z d , we will consider different subsemigroups in Z d . If the semigroup P ⊂ Z d contains the point 0, then this point is a neutral element in the semigroup P and the polynomial 1 × x 0 is a neutral element of the multiplication operation in the semigroup algebra K[P]. If the subsemigroup P ⊂ Z d does not contain the point 0, that is, it does not have a neutral element, then the multiplication operation in the K-algebra K[P] will not have a neutral element. The terms monomial and exponent will also be applied to semigroup K-algebras of the form K[P], where P ⊂ Z d .
The support of a non-zero Laurent polynomial is the set of exponents of its monomials. When the Laurent polynomial is given as a linear combination of some set of monomials, the support will be a subset of monomials included in such a sum with a nonzero coefficient: The support of the null element of the Laurent polynomial ring is undefined.

Algorithm for Constructing a Monomial Basis of the Factor Algebra
For simplicity, in this article, we restrict ourselves to constructing a basis for such integer simplicial polytopes that contain some neighborhood of the origin (we call such polytopes super-convenient). The set of monomials of a basis is constructed as a union of disjoint groups of monomials, each of which corresponds to one facet of a polytope. We construct not one single basis, but a whole family of bases, each of which is constructed from the so-called shelling of a convex polytope Γ. The shelling of a simplicial polytope Γ is the ordering of facets of the polytope satisfying some conditions. These conditions imply, in particular, a topological property of sequence (1) namely, for i ∈ [1, N − 1] the union of the first i facets of the shelling is homeomorphic to the disc.

Shelling Extension Γ sh of Super-Convenient Newton Polytope Γ
For each facet ∆ ∈ ∂Γ of the super-convenient Newton polytope Γ let us construct d segments connecting the origin with the vertices of the facet and drop one of the two endpoints from each segment. Taking the Minkowski sum of the resulting d half-intervals, we obtain a set of points that is a half-open parallelepiped in the sense of the definition (5) of the Section 2.4 below.
For each facet, such a parallelepiped can be constructed in 2 d ways. We would like to choose one of these ways for each face so that the constructed N half-open parallelepipeds would not intersect pairwise. The existence of shelling sh of any convex polytope, proved in 1971 by Bruggerser and Mani [13], allows us to prove that such a choice of parallelepipeds can indeed be made and, moreover, in many ways using the shellings of the polytope Γ. For any shelling sh of a super-convinient simplicial polytope Γ, the semi-open parallelepipeds of facets can be inductively chosen so that they do not intersect, and their union, which we denote by Γ sh , covered the interior of Γ. The polytope Γ sh is not closed and, as a rule, is not convex. The volume of the constructed non-closed d-dimensional polytope Γ sh is obviously equal to the volume of the Newton polytope Γ multiplied by d!. We will prove below that the number of integer points in any integer half-open parallelepiped is equal to its volume (this result is known, see, for example, [17]). Hence, the number of integer points in Γ sh is equal to its volume, so Now, we can state the main result of this paper. Main result. Fix a super-convenient simplicial Newton polytope Γ and a shelling sh of this polytope. Then, for the generic Laurent polynomials g 1 , g 2 , . . . , g d whose supports belong to the set Γ, as a monomial basis of the quotient algebra K[Z d ]/(g 1 , g 2 , . . . , g d ) we can take the set B sh of all monomials whose exponents belong to the union of all semi-open parallelepipeds that make up Γ sh .
Thus, we obtain a new formulation and a new proof of Kushnirenko's theorem on the number of solutions of an generic unmixed system of Laurent polynomials with the simplicial Newtons polytope.
Note that there is quite a lot of arbitrariness in our construction of the basis. First, the basis depends on the choice of shelling, and a convex polytope has many shellings. Secondly, when all generators of the ideal (g 1 , g 2 , . . . , g d ) are multiplied by a monomial, the ideal does not change, but the polytope Γ is shifted in R d by an integer vector. Therefore, any integer point inside the polytope can be chosen as the origin of coordinates, after which our constructions will give a different Newton filtration and a different basis at the output, since our construction "selects" monomials into the basis, minimizing their Newtonian degrees, which depend on the choice of the origin.
However, the second ambiguity disappears when passing from Laurent polynomials to ordinary polynomials or germs of complex analytic functions or formal power series.

Definition of a Shelling
The paper [12] published in 1971 defines the shelling of a convex polytope and proves that shelling exists for any convex polytope. Shelling is a linear ordering of all the facets of a polytope that satisfies certain conditions. Any polytope has many shellings. It is known, in particular, that the initial and final facets of shelling can be chosen arbitrarily. We need the definition of shelling only for convex simplicial polyhedra.
Definition 1. The shelling of a simplicial polytope Γ is an ordering (numbering) of all facets ∆ 1 , ∆ 2 , . . . , ∆ N of Γ that satisfies the following condition: For any i ≥ 2 the intersection of facet ∆ i with the union of facets ∆ 1 ∪ ∆ 2 , . . . ∪ ∆ i−1 is the union of some nonzero number r of subfacets of codimension one of facet ∆ i .
Until the end of this article, we fix a convex simplicial super-convenient d-dimensional Newton polytope Γ and fix its shelling sh: Below, ∆ 1 , ∆ 2 , . . . , ∆ N will always denote the elements of this fixed shelling. We will call ∆ 1 the initial facet of the shelling, and the remaining facets will be called the typical facets of the shelling.
In this article, we re-prove one known combinatorial result (Section 3.5, the Dehn-Sommerville property of the Poincaré series constructed from Newton's grading). To prove it, we need a) the "reversibility" of any shelling of a convex simplicial polytope, and b) the proposition about the "complementarity" of intersections of any facet of a Newton polytope with the preceding facets of the direct and inverted shellings.
be a shelling of convex simlicial polytope Γ and be the inverted ordering. Then, sh is also a shelling of Γ.
The proof of this proposition can be found in Lemma 8.10 in [18]. Let us call shellings sh and sh mutually inverse. Proposition 2. Let (4) and (5) be two mutually inverse shellings. Then, for 1 < i < N, each codimension one face δ ⊂ ∆ i belongs to exactly one of the intersections ∆ i ∩ (∆ 1 ∪ ∆ 2 , . . . , ∪∆ i−1 ) (6) or Proof. For i ∈ [2, N − 1], the set of facets of Γ other than ∆ i is split into two non-empty sequences: -Elements of sh preceding the ∆ i facet: -Elements of sh preceding the ∆ i facet: Each face of dimension d − 2 of any convex d-dimensional polytope belongs to exactly two facets of this polytope. Therefore, any (d − 2)-dimensional face δ ⊂ ∆ i ⊂ ∂Γ belongs to the boundary of exactly one facet of the polytope other than ∆ i . This second facet is a member of sequence (8) or a member of sequence (9). In the first case, the face δ belongs to the intersection (6), in the second case, the face δ belongs to the intersection (7).

Shelling Defines a Covering and Partitioning of the Boundary of a Convex Simplicial Polytope
The shelling construction of a simplicial polytope actually refers not to the polytope itself, but to the structure of the simplicial complex on its boundary, which arises from the simplicial triangulation of the boundary of the polytope. As a subset of the topological vector space R d , the boundary ∂Γ of the polytope Γ is covered by closed convex facets: Any shelling sh defines an ascending sequence of closed sets obtained by the union of the initial piece of the sequence sh: ∅ = S 0 ⊂ S 1 ⊂ S 2 ⊂ . . . ⊂ S N = ∂Γ; every subset except the last is homeomorphic to a (d − 1)-disk and the latter is homeomorphic to a (d − 1)-dimensional sphere. This sequence is built in the following way: Closed triangulated sets S 1 , S 2 , . . . , S N will be called subcomplexes. For i = 1, 2, . . . , N the set S i \S i−1 is called sh-facet and is denotes by ∆ sh i . The set ∆ sh 1 is called the initial sh-facet. This sh-facet coinsides to the facet ∆ 1 and is a closed subset of R d . The remaining sh-facets, i.e., ∆ sh i for i ≥ 2, will be called regular. A regular sh-facet ∆ sh i is a proper subset of facet ∆ i and, according to the definition of shelling, is obtained by removing from facet ∆ i a non-zero number r of codimension one faces. Any of the regular sh-facets ∆ sh i is not closed in R d and is the difference of two closed sets. Namely, any regular sh-facet is the difference between a convex d − 1-dimensional set ∆ i and some non-empty closed (d − 2)-dimensional set lying on the relative boundary of ∆ i . It is easy to see, and we will check it below, that any sh-facet is convex. It follows from the definition that sh-facets are pairwise disjoint and that the sets ∆ sh 1 , ∆ sh 2 , . . . , ∆ sh i form a partition of S i . Therefore, for i ≥ 2, the subcomplex S i is the disjoint union of the subcomplex S i−1 and sh-facet ∆ sh i .
The right-hand sides of the Formula (12) give the partitions of the S 1 , S 2 , . . . , S N into sh-facets. In particular, the boundary of the polytope is split into sh-facets: The boundary of any convex polytope Γ is homeomorphic to a (d − 1)-dimensional sphere. It is easy to deduce from the definition of the shelling of a simplicial polytope that for any i < N the subcomplex S i = (∆ sh 1 ∪ ∆ sh 2 ∪ . . . ∪ ∆ sh i ) is polyhedral hypersurface homeomorphic to a closed d − 1-dimensional disk (see [12]). . We verify below that this module is both finitely generated and freely generated.

Covers and
In view of the superconvenience of the polytope Γ, the commutative groups R d and Z d can be covered by semigroups with a neutral element Now, using the properties of shelling (3), we construct partitions of the commutative groups R d and Z d into subsemigroups. In each partition, one semigroup will have a neutral element, and the rest will be semigroups without a neutral element. Let us define Csh 1 = Cone(∆ 1 ) and Ash 1 = A(∆ 1 ). For i > 1, define the subset Csh i ⊂ Cone(∆ i ) and the subset Ash i ⊂ A(∆ i ) by the equalities The sets Csh 1 and Ash 1 are obviously semigroups with the respect to the addition operation with a neutral element 0 ∈ Z d ⊂ R d . For i > 1, neither the set Csh i , nor the set Ash i contains the origin. Below, we check that sets Csh 2 , Csh 3 , . . . , Csh n and Ash 2 , Ash 3 , . . . , Ash n are semigroups without a neutral element. This implies that for i > 1, the semigroup algebra K[Ash i ] is defined. The multiplicative operation in this algebra has no neutral element. It is easy to see that for i ∈ [1, N], a ∈ Ash i , and g ∈ V(∆ i ), the sum a + g belongs to Ash i , so the semigroup algebra K[Ash i ] is a module over the algebra K[V(∆ i )]. We will check below that this module is both finitely generated and freely generated. For i ∈ [1, N], the sets Csh i will be called sh-cones and the sets Ash i will be called sh-semigroups. From the definitions (16) and (17), we obtain the following: Proposition 3. R d admits a partition into sh-cones and Z d admits a partition into sh-semigroups: Obviously, for any i ∈ [1, N], the set Ash i is nothing but a subset of integer points of the set Csh i :

Semi-Open Parallelepipeds and Sets of Their Integer Points as Fundamental Domains for Action of Vertex Semigroups on sh-Cones and sh-Semigroups
Two coordinate systems on a cone Cone(∆). Characterization of the semigroups A(∆) and V (∆). On the whole space R d , there is a global coordinate system y 1 , . . . , y d . We call these coordinates y-coordinates. Recall that in the Section 1.5, for each facet ∆, we introduced an additional coordinate system in R d to work with objects belonging to the cone Cone(∆). We called these additional coordinates c-coordinates. ∆ is the set of points for which the sum of all c-coordinates is equal to 1 and all c-coordinates are non-negative; -A cone with vertex at the origin and base equal to facet ∆ is the set of points whose sum of all c-coordinates is less than or equal to 1 and all c-coordinates are non-negative; -For any vertex v of the facet ∆, one of the c-coordinates is 1, and the other c-coordinates are 0.
The evidence is clear.

Definition 2.
A face of the cone Cone(∆) is a subset of the cone on which a fixed set of r ccoordinates vanishes. A face is called proper if 1 ≤ r.
In the Section 6, we need the following obvious proposition.

Proposition 5.
Let F be some proper face of the cone Cone(∆) and a, b be two points of the cone. If a + b ∈ F, then a ∈ F and b ∈ F.
Proof. Without loss of generality, we can assume that the face F is given by equating to zero the first r ≥ 1 c-coordinates Since each of these coordinates c i is linear and takes non-negative values on the cone Since the polytope Γ is assumed to be integer, the y-coordinates of any of its vertices, and, in particular, of any vertex of the facet ∆, are integers. That is why: - The full semigroup A(∆) is nothing else than the set of points of the cone Cone(∆) with integer y-coordinates; - The vertex semigroup V(∆) is nothing else than the set of points of the cone Cone(∆) with non-negative integer c-coordinates. Since the generators of vertex semigroups V(∆) have integer y-coordinates, all elements of the vertex semigroup have integer y-coordinates, that is, V(∆) ⊆ A(∆).

Definition 3.
We say that a subsemigroup V(∆) of the semigroup Cone(∆) acts on a set X ⊆ Cone(∆) if for any point x ∈ X and any element g ∈ V(∆), the sum x + g belongs to X. The sum x + g, where x ∈ Cone(∆) and g ∈ V(∆), is called a shift of point x by vector g. Suppose X 0 ⊆ Cone(∆) and {g} is a one-point set composed of g ∈ V(∆). The Minkovsky sum X 0 ⊕ {g} is called the shift of set X 0 by vector g. Suppose the semigroup V(∆) acts on some set X ⊆ Cone(∆).
The set X 0 ⊆ X is called a fundamental domain for this action if any element x ∈ X is uniquely represented as a shift of some point x 0 ∈ X 0 by some element g 0 ∈ V(∆). In other words, if the shifts of the set X 0 by all possible elements of V(∆) form a partition of the set X: Suppose p ∈ Cone(∆). The set g∈V (p + g) is called the orbit of point p under the action of semigroup V(∆). The orbit of the point p ∈ Cone(∆) can be written using the Minkowski sum as {p} ⊕ V(∆).
Remark 1. This definition will be applied below in two situations. First, this definition will apply to d-dimensional set X = Cone(∆ 1 ) and to 0-dimensional set A(∆ 1 ). Secondly, this definition will apply to the set Csh i and its subset Ash i for i > 1. Note that in all situations under consideration, the shifts of any point p ∈ Cone(∆) by different vectors g 1 , g 2 ∈ V(∆) do not coincide, therefore, for any point p ∈ Cone(∆)), the mapping V(∆) → Cone(∆) given by the formula g → (p + g) is an injection.
Below, we will need two standard functions R → Z to round a real number x: 2.4.1. Fundamental Domains for Actions of the Vertex Semigroup on the Sets Cone(∆ 1 ) and A(∆ 1 ) Let ∆ be some facet of the polytope Γ, for example, the initial facet ∆ 1 of the shelling sh. Obviously, the semigroup V(∆) acts on the set Cone(∆) and also acts on A(∆). In other words, adding a vector with non-negative c-coordinates does not lead outside the cone Cone(∆) or outside the semigroup A(∆) consisting of points of the cone Cone(∆) with integer y-coordinates.
Consider an arbitrary point p ∈ Cone(∆). Denote by C(p) the vector of c-coordinates of this point. Denote by f loor(p) the vector with the following c-coordinates All coordinates of the vector f loor(p) are non-negative integers. Let us expand the vector C(p) into the sum of two terms: The second term of this sum belongs to the semigroup V(∆), and each c-coordinate of the first term belongs to the interval [0, 1). This means that any point p ∈ Cone(∆) can be represented as the sum of a point with zero integer parts of c-coordinates and a point with non-negative integer c-coordinates. It is quite obvious that such a representation is unique. Thus, we have proven the following assertion.
Proposition 6. The fundamental domain for the action of the vertex semigroup V(∆) on the cone Cone(∆) is the bounded subset of the cone Cone(∆) defined by the double inequalities: Geometrically, the Proposition 6 means that the entire cone Cone(∆) is "tiled" by non-intersecting shifts of the integer semi-open parallelepiped Π(∆) by the vectors of the vertex semigroup V(∆): The above assertion and its proof are well known, see, for example, [17]. The set Π(∆) is called fundamental half-open parallelepiped.
Below, a formally more general definition of integer half-open parallelepiped will be given. The closure of the fundamental semi-open parallelepiped of facet ∆ is called the facet parallelepiped and is denoted by Π(∆).
A proposition similar to the Proposition 6 is true for the B(∆). From the Formula (23), it follows that the set B(∆) is given by the double inequalities: Proof. Let p be an arbitrary point in A(∆). According to the Formula (22), the point p is the sum of two terms, the first of which belongs to B(∆), the second has integer c-coordinates, that is, it belongs to V(∆). It is easy to see that this representation is unique.
The fact that the set B(∆) is a fundamental domain can be reformulated as follows.

Proposition 8. The shifts of the set V(∆) by elements of the set B(∆) are pairwise disjoint and their union gives A(∆):
The Proposition 8 can be reformulated in terms of finitely generated modules.
Recall that we denote the number of points in a finite set B by #B.

Proposition 10. The number of integer points in the fundamental semi-open parallelepiped Π(∆)
is equal to its volume, i.e., Equality (28) is well known, see for example [17]. However, for completeness, we present an outline of the geometrical proof.
Outline of the proof. By kΠ(∆), denote a semi-open parallelepiped Π(∆) dilated in a natural number k times with respect to the origin. This dilated semi-open parallelepiped kΠ(∆) is given by the double inequalities kΠ(∆) can be obtained by the union of disjoint shifts of the original semi-open parallelepiped by elements of the set X, consisting of k d integer vectors, each c-coordinate of which is a non-negative integer less than k. Similarly, the set of integer points in kΠ(∆) can be obtained as the union of disjoint shifts of the basis B(∆) by the same set X of integer vectors, therefore, For k → ∞, the number of integer points in a dilated half-open parallelepiped will be equal to its volume, up to some correction term. This correction term has an order of growth From (30) and (31), we obtain Letting k tend to infinity, we obtain the equality (28).
The fundamental integer semi-open parallelepiped Π(∆) is a special case of an arbitrary integer semi-open parallelepiped, which we will now define using Minkowski sums.
Definition 5. Let a and b be two distinct points with integer coordinates in R d . The set of points in R d of the form a + (b − a)t, where t runs over the half-interval [0, 1) on the real line is called an integer half-interval and is denoted by [a, b) or, equivalently, by (b, a]. We also denote by The Minkowski sum of d integer half-intervals of the form where the vectors v 1 , v 2 , . . . , v d are linearly independent is called the integer semi-open parallelepiped. The Minkowski sum of d integer half-intervals of the form in which the vectors v 1 , v 2 , . . . , v d are linearly independent is called a fundamental integer semiopen parallelepiped. It is easy to check that the Formulas (33) and (23) define the same set. Below, we verify that any integer semi-open parallelepiped can be obtained from the fundamental parallelepiped by parallel translation to some vector with integer coordinates. Therefore, it is easy to deduce a more general proposition from the Proposition 10.
Proposition 11. The cardinality of the set of integer points of any integer semi-open parallelepiped is equal to its volume.
Proof. Let us check that any integer semi-open parallelepiped can be obtained from the fundamental parallelepiped by parallel transfer to some vector with integer coordinates.
Parallel transfer of an integer semi-open parallelepiped Π by an integer vector does not change the volume Π and the number of integer points in it, and as a result of the transfer, we obtain a fundamental semi-parallelepiped whose volume is equal to the number of integer points according to the Proposition 10. We will give two proofs of this assertion-a coordinate proof and a proof in terms of Minkowski sums.

Fundamental Domains for Actions of the Vertex Semigroup of Any
Coordinate proof. Let ∆ i be a facet of Γ. By the definition of shelling, sh-facet ∆ sh i is obtained from facet ∆ i by removing r subfacets of codimension one. On each subfacet of codimension 1, one of the c-coordinates on the cone Cone(∆ i ) is equal to zero, and the complement to such a subfacet is given by the condition that this c-coordinate is positive. Therefore, the complement to all r subfacets to be removed is given by the condition that r of such c-coordinates are simultaneously positive. The boundary case r = d is not excluded. Without loss of generality, we may assume that the first r c-coordinates are positive on sh-facet ∆ sh i . Hence, the cone Csh i is defined in the closed cone Cone(∆ i ) by the inequalities 0 < c 1 (p), 0 < c 2 (p), . . . , 0 < c r (p), and the sh-cone Csh i is given by a system of r > 0 strict and (d − r) ≥ 0 non-strict inequalities From this description, it follows that: - The set of points of the sh-cone Csh i is closed with respect to the addition operation, which means that its subset Ash i of points with integer y-coordinates is also closed with respect to addition; -Adding any vector with non-negative c-coordinates to a point satisfying the inequalities (35) does not violate these inequalities, so the semigroup V(∆ i ) acts on the sh-cone Csh i . Finally, shifting an integer point in Csh i by a vector with non-negative integer y-coordinates from the set V(∆ i ) gives a point Csh i with integer coordinates, so V(∆ i ) acts on Ash i .
The Proposition 12 can now be detailed as follows.
Proposition 13. (a) A subset of the cone Cone(∆ i ) defined by double inequalities: is a fundamental domain for the action of the semigroup V(∆ i ) on the sh-cone Csh i ; (b) The set Π i is an integral semi-open parallelepiped.
Proof. Let us prove (a). Let p ∈ Csh i , i.e., p satisfies the inequalities (35). We use the functions defined by the Formula (21) and denote by ceil_ f loor(p) the point with the following c-coordinates Let us expand the vector of c-coordinates of the point p into the sum of two terms: Let us prove that the second term of this sum is the vector of c-coordinates of some element of the vertex semigroup V(∆ i ). To do this, it suffices to check the non-negativity of all components of this vector, taking into account that p ∈ Csh i . The non-negativity of the last d − r components follows from the definition of the function f loor. The non-negativity of the first r components follows from the fact that (a) for the point p ∈ Csh i the coordinates c 1 (p), . . . , c r (p) are positive; (b) the value of the ceil function in the Formula (21) for any positive argument is not less than 1 and remains non-negative after subtracting one. It is also easy to see that the first term of the Formula (37) satisfies the inequalities (36), that is, it is a vector of c-coordinates of some point Π i . Thus, we have proven that any point p ∈ C i is obtained by shifting some point b ∈ Π i by an element g of the vertex semigroup V(∆ i ). Let us not be too lazy to check that the representation From the Formula (36) it follows that the difference of any two points in Π i has c-coordinates, by absolute value less than 1. Therefore, being an integer vector, this difference must be equal to zero. In other words, shifts of the set Π i by all possible elements of the vertex semigroup V(∆ i ) form a partition of the sh-cone Csh i . Proposition (b) follows from the fact that the set given by double inequalities (36) can be represented as the Minkowski sum of integer half-intervals where the vectors −v 1 , . . . , −v r , v r+1 , . . . , v d are linearly independent. The coordinate proof of the Proposition 12 is complete.
Outline of an alternative proof of the Proposition 13. For each vertex v of the superconvenient polytope Γ, consider a closed ray emanating from the origin and passing through v and an open ray obtained by removing the origin from the closed ray. It is easy to see that each closed cone Cone(∆ i ) can be described as the Minkowski sum of d closed rays emanating from the origin and passing through the vertices of facet ∆ i . Similarly, each sh-cone Csh i obtained by removing r faces from the cone Cone(∆ i ) can be described as the Minkowski sum of r open rays and d − r closed rays. As above, the boundary cases r = d and r = 0 are not excluded either. The terms of these Minkowski sums are referred to as the boundary rays of cone Csh i . Divide each boundary ray of the cone Csh i into a countable number of non-intersecting and sequentially adjoining integer half-intervals (in the sense of Definition 5), enumerate these intervals from zero to infinity, and represent Csh i as the Minkowski sum of d terms, each of which is the union of a countable number of non-intersecting integer half-intervals: After expanding the brackets, we obtain the union of a countable number of elementary Minkowski sums, each of which is the sum of d integer half-intervals. The first elementary sum is obtained from the first column of the Formula (38) and looks as follows: The remaining elementary Minkowski sums, obtained by expanding brackets in the Formula (38), are obtained from the first sum (39) by shifts by the sum of vectors of vertices of facet ∆ i with non-negative coefficients that are not equal to zero at the same time. In other words, each remaining sum is obtained by shifting the first sum by nonzero elements of the vertex semigroup V(∆ i ).

Proposition 14.
(i) Finite subset Bsh i of set Ash i defined by double inequalities: is the fundamental domain for of the action of the vertex semigroup V(∆ i ) on the sh-semigroup Ash i ; iii) The number of integer points in a semi-open parallelepiped Π i is equal to its volume: Proof. (i) It follows from Proposition 12 that an arbitrary point p ∈ Ash i is uniquely represented as a sum p = b + g, where b ∈ Csh i and g ∈ V(∆ i ). Both the point p and the second summand have integer y-coordinates. This means that the first term b of this sum also has integer y-coordinates, that is, it belongs to Ash i and satisfies the inequalities (40). This means that we have uniquely represented an arbitrary point p as a shift of the point b ∈ Bsh i by the vector g ∈ V(∆ i ). Thus, we have proven that (ii) follows from the Formulas (35) and (40); (iii) follows from the Proposition 11. Definition 6. The set Bsh i given by the double inequalities (40) is called the basis of the shsemigroup Ash i . Basis Bsh 1 is the same as basis B(∆ 1 ) previously defined by Formula (25).
The fact that the set Bsh i is the fundamental domain for the action of the semigroup V(∆ i ) on the set Ash i can obviously be reformulated as follows.
We now reformulate the Proposition 15 in algebraic terms, considering the K-algebra K[Ash i ] as a module over the algebra K[V(∆ i )]. Note that for i > 1, the subsemigroup Ash i does not have a neutral element, and therefore, the multiplicative operation in the K-algebra K[Ash i ] will not have a neutral element. However, in this article, we need to multiply elements of the K-algebra K[Ash i ] only by elements of the K-algebra K[V(∆ i )], so we will consider K[Ash i ] as a module over K[V(∆ i )]. Proposition 16. As a module over the algebra K[V(∆ i )], the algebra K[Ash i ] is freely generated by the monomials corresponding to the points of the finite set Bsh i .
The proof can be performed in the same way as the proof of the Proposition 9 assertion with reference to the Proposition 14 assertion instead of the Proposition 8 assertion. (d) follows from (a)-(c) and the fact that the Newtonian degree of any vertex of Γ is equal to M. Indeed, the Newtonian degree of any point p of a closed cone of any facet, is expressed in terms of the c-coordinates of a point on this cone by the formula

Shelling Extensions of the Super-Convenient Newton Polytope
Let ∆ be a facet with vertices v 1 , v 2 , . . . , v d . By Pyramid(∆), denote the union of all closed segments starting at the origin and ending at some point of facet ∆. It is obvious that Since for any i Volume(Π i \ Π i ) = 0 the right-hand side of identity (44) can be replaced by the volume of the disjoint union of semi-open parallelepipeds, This disjoint union is constructed from a super-convenient Newton simplicial polytope and any of its shellings. This object deserves separate consideration.

Definition 7.
Let sh be a shelling of a convex super-convenient simplicial Newton polytope Γ.
The disjunct union N i=1 Π(∆ sh i ) is called shelling extension of Γ and is denoted by Γ sh : The union of bases of all sh-semigroups N i=1 Bsh i is called the basis of shelling extension Γ sh and is denoted by B sh : Definition 8. Let P ∈ R d a convex polytope. By µ(P), denote the product d! × Volume(P).

Proposition 18.
The shelling extension Γ sh of the super-convenient simplicial integral Newton polytope Γ has the following properties The number of integer points in any shelling extension of the polytope Γ does not depend on the shelling sh and is equal to µ(Γ), i.e., Proof. (i) follows from (18) g 1 , g 2 , . . . , g d ) This section informally presents a new approach to solving the combinatorial problem of counting the number of integer points on the boundary of a super-convenient integer polytope Γ and any rational dilations of this boundary with respect to the origin. This problem is close to the problems of studying Erhart's polynomials and h-vectors of simplicial complexes. A similar problem was studied in the work of the author [4] and in the works [19][20][21].

Newtonian Degree
Let us fix a super-convenient convex integer polytope Γ ∈ R d , not necessarily simplicial. Following V.I. Arnold, we define the so-called Newtonian ("piecewise linear") degree of any point in R d [1]. This "degree" is a real-valued function ϕ : R d → R with the following properties (i) ϕ takes non-negative values; (ii) ϕ is a linearly homogeneous function on Cone(∆) for any facet ∆ of Γ; (iii) ϕ takes a non-negative integer value at any point in Z d ; (iv) ϕ takes some positive integer value M on the boundary of Γ.
The existence of such a function can be proved using the well-known properties of convex polyhedra.
The number ϕ(n), where n = (n 1 , n 2 , . . . , n d ) ∈ Z d , is called the Newtonian degree of the monomial x n = x n 1 1 x n 2 2 . . . x n d d .

Defining a Convex Super-Convenient Polytope by a Non-Negative Piecewise Linear Function
Let Γ ⊂ R d be a compact convex d-dimensional polytope with N facets. It is known, see for example Theorem 1.1 in [18], that Γ can be defined as the intersection of N halfspaces, the boundary of each of which intersects with the polytope in one of the facets ∆ i . If the polytope Γ is known to be superconvenient, then each of these half-spaces can be defined on R d by the inequality ϕ i (x) ≤ 1, where ϕ i is a linear function, such that Define a piecewise linear function ϕ : R d → R by the formula It is obvious that Neither the simpliciality, nor the integrality of the polytope was used in the definition of this function ϕ. Recall that we denote by Cone(∆) the union of all closed rays starting from the origin and passing through some point of facet ∆ ⊂ Γ.

Proposition 19.
The function ϕ has the following properties: (c) For any s ≥ 2 and any x 1 , x 2 , . . . , (d) (c) becomes an equality if and only if there exists a facet ∆ i such that any of points x 1 , x 2 , . . . , x s belongs to Cone(∆ i ); (e) For any i ∈ [1, N], any s ≥ 2, and any x 1 , x 2 , . . . , x s ∈ Cone(∆ i ) The proof is left to the reader. Since the polytope Γ is integral, it follows that the coefficients of all linear functions ϕ 1 , ϕ 2 , . . . , ϕ N are rational numbers. Therefore, there exists a natural number M such that, after multiplying the function ϕ by M, we obtain a new function, which we denote by the same letter ϕ, which takes at integer points R d only integer values, and on the boundary of the polytope Γ takes the value M. This function is called Newtonian degree associated with a super-convinient polytope Γ .

Newtonian Generating Functions of Various Subsets of Z d
The Newtonian degree associated with the super-convenient polytope Γ defines a mapping of the countable set Z d into the set of non-negative integers N. The inverse image of each point under this mapping is finite. Therefore, for any subset Y ⊂ Z d , the following formal sum is well defined: This sum is called Newtonian generating function of the set Y associated with the superconvenient polytope Γ.
Proposition 20. (a) If the set Y ⊂ Z d is finite, then its Newtonian generating function is a polynomial and the cardinality of Y is equal to the value of this polynomial at point 1: The proofs are evident. Below, we will consider the Newtonian generating functions of various subsets of Z d introduced in Sections 2.3 and 2.4.

Definition 9.
For i ∈ [1, N], denote by q i (t) the Newtonian generating function of the finite set Bsh i defined by the Formula (40). Denote by Q(t) the Newtonian generating function of a finite set Obviously, the polynomial Q(t) = q 1 (t) + q 2 (t) + . . . + q N (t) and the polynomials q i (t) for i ∈ [1, N] have non-negative integers coefficients. It follows from the definition of the generating function of a finite set that #Bsh i = q i (1) and #B sh = Q(1). From the Formulas (41) and (49), it follows that The Proposition 17 implies that the polynomial Q(t) has the form Q(t) = 1 + . . . + t dM , in particular, deg(Q) = dM.

Proposition 21.
Let sh be a shelling of a super-convenient simplicial polytope Γ, ∆ i be an element of sh. Then, Proof of assertion (a) will be given below in Section 3.3. Proofs of assertions (b)-(c) will be given below in Section 3.4. Proof of assertion (d) follows from the Formulas (41) and (49) and the Proposition 17.
The series H Γ (Z d , t) provides combinatorial information about the location of the polytope Γ with respect to the set Z d ⊂ R d . For example, the coefficient of t M in the series H Γ (Z d , t) is equal to the number of integer points on the boundary of Γ, and the coefficient of t kM is equal to the number integer points on the boundary of the polytope Γ, dilated k times with respect to origin. In my works [2,4] dating back to 1974-1975, I combinatorially proved a fairly simple fact that the series H Γ (Z d , t) has the form Q(t) (1−t M ) d , where Q(t) is a polynomial whose sum of coefficients is equal to µ(Γ) = d! × Volume(Γ). A more complicated fact of the non-negativity of the coefficients of this polynomial was not stated in [4], although it can be deduced from the algebraic reasoning given in this article. It turns out that for a super-convinient simplicial Newton polytope Γ, the nonnegativity and integrality of the coefficients of the numerator Q(t) of the Newtonian generating function can be proved combinatorially using the shelling of Γ. In the process of solving the problem of explicitly describing the Newtonian generating function H Γ (Z d , t) using shelling, we explicitly construct the set of integer points B sh ⊂ Z d . Later, we will prove that the set of monomials {x n : n ∈ B sh } forms a monomial basis of the quotient algebra K[Z d ]/(g 1 , g 2 , . . . , g d ) for generic Laurent polynomials having the same Newton polytope Γ.
Using shelling, we also prove the following refinement of Proposition 21.
(1−t M ) d be the Newtonian generating function of simplicial super-convinient polytope Γ. Then, the numerator Q(t) is a palindromic polynomial of degree dM, i.e., Q(t) = t dM Q(1/t) The proof will be given below in Section 3.5. This proposition can be considered as an analogue of the Dehn-Sommerville property of the h-vector of a simplicial convex polytope [22].
The Proposition 22 is not new, for example, it is stated in Proposition 2.6 in [21]. However, the published proofs available to the author, see, for example, [19], are based on other approaches and differ from the author's proof based on the existence and invertibility of shellings of convex simplicial polyhedra.
The requirement that the polytope be simplicial in Proposition 22 can be removed, since the boundary of any convex polytope Γ can always be cut up into simplices, that is, ∂Γ can be subdivided into a simplicial complex. Moreover, the subdivision can be chosen so that the resulting simplicial complex admits shelling.

Graded Vector Spaces and Their Poincaré Series
We will use the Newtonian generating functions defined by (51) for various subsets of Z d in the study of graded K-algebras associated with these subsets. These combinatorially defined generating functions turn out to be the Poincaré series of various graded algebraic objects.
The standard Definitions 10 and 11 are borrowed from Wikipedia. For brevity, we use the term Poincaré series instead of Hilbert-Poincaré series. Definition 10. Let N be the set of non-negative integers. An N-graded vector space is a vector space X over a fild K together with a decomposition into a direct sum of the form X = n∈N X n where each X n is a vector space over K. For a given n the elements of X n are then called homogeneous elements of degree n.
According to the definition of a direct sum, any element of the space X is the sum of a finite number of homogeneous elements. In what follows, we will consider only N-gradings. Therefore, we will use the term graded without explicitly specifying N. Definition 11. Given a N -graded vector space that is finite-dimensional for every n ∈ N, its Poincaré series is the formal power series Often, this series can be folded into a rational function of t. Assume that a homogeneous basis is given in the space X. We say that each element of this basis of degree i, contributes term 1 · t i to the Poincaré series H(X, t). Then, the sum of the contributions of all elements of the basis will give the Poincaré series of the vector space X. Assume that a homogeneous basis is represented as a disjoint union of several sets. Then, we can count the contributions to the Poincaré series of each of these sets, and the sum of these contributions gives the Poincaré series of X. Note. A particular case of this proposition is the additivity property expressed by the Formula (53).

Example 1.
Denote by X the algebra K[x, x −1 ]. Let us introduce a gradation on X by setting X 0 = K and X i = linear span of two vectors x i and x −i for i > 0. Then, the contribution to the Poincaré series from monomials of non-negative degree will be equal to 1 + t + t 2 + t 3 + . . . = 1 1−t and the contribution from monomials of negative degree will be equal to t + t 2 + t 3 + . . . = t 1−t . These two sets of basis monomials are a partition of the set of basis vectors and the Poincaré series of the entire algebra can be represented as the sum of two rational functions The degree of such a monomial is n 1 + n 2 . Let us expand brackets in a formal product: Each monomial in x 1 , x 2 appears in the resulting expression exactly once. To count the number of monomials of degree d, replace in the product x 1 and x 2 by t, then expand brackets and reduce the similar terms. The coefficient at t d in the expanded product will be equal to the number of monomials in X of power d. That is why, In the general case of polynomial algebras in d variables, where deg(x n ) = n 1 + n 2 + . . . + n d we obtain In the case when deg(x n ) = Mn 1 + Mn 2 + . . . + Mn d , the Poincaré series becomes

Proof of the Proposition 21 (a).
A graded semigroup K-algebra K[V(∆)] of any facet ∆ is freely generated by d monomials x v 1 , x v 2 , . . . , x v N , where v 1 , v 2 , . . . , v d are facet vertices. Since the Newtonian degree of each vertex of the polytope is M, the Formula (63) applies.

Example 3.
Let Γ ⊂ R d be a super-convenient simplicial integer polytope, X be the vector space K[Z d ]. Section 3.1 shows that Γ determines the Newtonian degree ϕ(n) for any monomial x n ∈ X. Denote by X i the span of all monomials of Newtonian degree i. Thus, a N-grading is constructed in the vector space of Laurent polynomials. The Poincaré series of this graded vector space, calculated by the general definition (61), is identical to the Newtonian generating function of the set Z d , defined by the Formula (51).
It will be shown below that the constructed Newtonian grading of the vector space of Laurent polynomials defines an exhaustive increasing filtration in the ring (K-algebra) of Laurent polynomials and a grading in the associated graded ring constructed for this filtration. This step, carried out in Section 2.3, allows us to reduce the problem of calculating the Newtonian generating function of the entire set Z d to the problem of calculating the generating functions of sh-semigroups. The solution of the problem of calculating the Newtonian generating functions of sh-semigroups is facilitated by the fact that on the closed cone of any facet, the Newtonian degree is additive.
According to Proposition 3 of Section 2.3, the group Z d splits into sh-semigroups. For the convenience of the reader, we reproduce the Formula (19) of this partition: From this formula, according to Proposition 20 (b), we obtain In the second stage, to find the summands H Γ (Ash i , t) of this sum (64), we must subdivide each countable set Ash i of integer points of the sh-cone Csh i into a finite number non-intersecting orbits starting at points of the finite set Bsh i ⊂ Ash i .

Proof of Proposition 21 (b).
To calculate the Newtonian generating function H Γ (Ash i , t) of the set of integer points Ash i ⊂ Csh i , note that, according to the Proposition 21 (a), the Newtonian generating function of the semigroup of facet ∆ i vertices is equal to In Proposition 14, the following fact it proven. There exists a a finite set of integer points Bsh i ⊂ Ash i such that the set Ash i of integer points of the sh-cone Csh i is tiled by the orbits of the points of this finite set under action of semigroup V(∆ i ). We denoted by q i (t) the Newtonian generating function of this set and proved that q(1) = Volume(Π). Note that both the vertex semigroup V(∆ i ) and the set Ash i belong to the closed cone Cone(∆ i ), and the Newtonian degree on this cone is additive, so for any b ∈ Ash i and any g ∈ V(∆ i ) Therefore, the contribution to the Poincaré series of the orbit of any integer point b ∈ Bsh i under the action of the vertex semigroup V(∆ i ) is equal to Since the orbits of all points of the finite set Bsh i form a partition of the shsemigroup Ash i , we obtain

The Dehn-Sommerville Property of the Newtonian Generating Function
Draft proof of the Proposition 22. Let Γ be a simplicial super-convinient polytope Γ, sh be a shelling of Γ and sh be the reverse shelling defined by the Proposition 1. In Section 2.3, using the shelling sh , we inductively constructed the following objects To prove the identity (60), we compare the sets Π i and Π i . From the definition of shelling and the Proposition 2 of Section 2, it is easy to deduce that the integer semi-open parallelepipeds Π i and Π i are in some sense complementary. Namely, if The closures of the semi-open parallelepipeds Π i and Π i coincide with Π i . Denote by v the sum of vertices of facet ∆ i . Thus, It is easy to see that the closed parallelepiped Π i is centrally symmetric with respect to the point v/2. The central symmetry σ : Π i → Π i can be given by σ(b) = v − b. This symmetry is the inversion of the set Π i , which maps the set Z d ∩ Π i into itself. This inversion defines a bijective correspondence between the semi-open parallelepipeds Π i and Π i , as well as between the sets of their integer points Bsh i and Bsh i .
In view of the additivity of the Newtonian degree on the cone Cone(∆ i ), the equality ϕ(σ(b)) = dM − ϕ(b) holds for any point b ∈ Π i . Let us check that Indeed, The Newtonian generating function H Γ (Z d , t) defined by the Formula (66) does not depend on the choice of shelling. The numerator of the Newtonian generating function H Γ (Z d , t) can be calculated by the formula and also does not depend on shelling. We calculate this numerator in two ways.

Standard Information about Filtered and Graded Objects and Their Poincaré Series
In this section, we recall well-known definitions and propositions related to filtered and graded objects and finitely generated graded algebras. In our paper, we consider only finitely generated K-algebras over a field K of characteristic 0, graded by non-negative integers.
Definition 12. Let X be a finitely generated graded K-algebra and H(X, t) be its Poincaré series. The multiplicity of the pole t = 1 of the Poincaré series H(X, t) is called the dimension of X.
Comment. It follows from Formula (62) that the dimension of the K-algebra of polynomials in d variables, graded to be formula deg(x n ) = n 1 + n 2 + . . . + n d , is equal to d.
In the book [23] one can find proofs of the following two theorems Theorem 1. Let X be a finitely generated graded K-algebra. Then, H(X, t) is either a rational function with a single pole at the point t = 1 or a polynomial.

Proposition 23.
The dimension of a finitely generated graded K-algebra introduced in the Definition 12 coincides with the dimension of Krull.

Elementwise Comparison of Poincaré Series of Graded Algebras
We reproduce the reasoning from online publication by R. Stanley, 2017 [10]. Let A(t) = a 0 + a 1 t + a 2 t 2 + a 3 t 3 + . . . and B(t) = b 0 + b 1 t + b 2 t 2 + b 3 t 3 + . . . be two formal series with real coefficients. We say that A(t) ≤ B(t) if a 0 ≤ b 0 and a 1 ≤ b 1 and a 2 ≤ b 2 and a 3 ≤ b 3 , etc. If the series C(t) has non-negative coefficients and c 0 = 0, then

t)C(t), and A(t)C(t) = B(t)C(t) if and only if A(t) = B(t). If A(t) and B(t) simultaneously satisfy the inequalities A(t) ≤ B(t) and B(t) ≤ A(t), then A(t) = B(t).
If R is a graded algebra and g ∈ R is a homogeneous element of degree M that is not a zero divisor, then For an arbitrary homogeneous element g ∈ R of positive degree M, we have the relation where equality is attained if and only if g is not a zero divisor in R. Let g 1 , g 2 , . . . , g r be a sequence of elements of a graded K-algebra R of positive degrees M 1 , M 2 , . . . , M r . Iterating the inequality (68), we get where equality is achieved if and only if the element g 1 is not a zero divisor in R, the element g 2 is not a zero divisor in R/(g 1 ), the element g 3 is not a zero divisor in R/(g 1 , g 2 ), . . . , the element g r is not a zero divisor in R/(g 1 , g 2 , . . . , g r−1 ).

Graded Cohen-Macaulay Rings
In this section, we list a number of known facts. To describe the conditions on the sequence of ring elements under which the inequality (69) becomes an equality, the following definition introduces a special term. Definition 13. A sequence of elements g 1 , g 2 , . . . g r of a commutative ring R is called regular if (i) the ideal generated by all elements of the sequence does not coincide with R; (ii) the element g 1 is not a zero divisor in R, the element g 2 is not a zero divisor in the quotient algebra R/(g 1 )R, the element g 3 is not a zero divisor in the quotient algebra R/(g 1 , g 2 )R ,. . . , and, finally, the element g r is not a zero divisor in the quotient algebra R/(g 1 , g 2 , . . . , g r−1 )R.

Definition 14.
A finitely generated graded ring R (a K-algebra) of dimension d is called a Cohen-Macaulay ring if there exists a regular sequence consisting of d homogeneous elements R of positive degree.
The next two theorems describe the properties of graded Cohen-Macaulay rings. Proofs can be found in [24]. Theorem 2. If a sequence g 1 , g 2 , . . . , g d of homogeneous elements of positive powers of a ddimensional graded Cohen-Macaulay ring R generates an ideal of finite codimension, then this sequence is regular.
The regularity of a sequence in graded Cohen-Macaulay rings can be checked in several ways. Theorem 3. Let R be a finitely generated graded Cohen-Macaulay K-algebra of dimension d; g 1 , g 2 , . . . , g d be a sequence of homogeneous elements R of positive powers M 1 , M 2 , . . . , M d ; I be an ideal in R generated by elements of this sequence; K[g 1 , g 2 , . . . , g d ] be a subgebra in R generated by the elements of the sequence.
(a) The following conditions are equivalent: (i) codim K (I) is finite; (ii) Sequence g 1 , g 2 , . . . , g d is regular; (iii) The K-algebra R is a free module with a finite number of homogeneous generators over its subalgebra K[g 1 , g 2 , . . . , g d ]; (iv) The Poincaré series of the K-algebra R/I, is given by the formula The formal series H(R/I,t) is actually a polynomial with non-negative coefficients; - The sum of the coefficients of this polynomial is equal to the codimension of the ideal I, and is also equal to the number of generators of the free module defined in (iii); -Any homogeneous basis of the quotient algebra R/I can be taken as the set of generators of the free module from (iii); - The cosets of any minimal set of generators from (iii) form a basis of the vector space R/I.

Newton's Filtration on K[Z d ]
Filtrations constructed from the Newton polytope of the germ of an analytic function were introduced by V.I. Arnold at work [1] and were extensively used in [2,4].

Newtoninian Degrees of Monomials
In Section 3.1, we defined the Newtonian degree ϕ(n) of any point n ∈ Z d with respect to the super-convenient integer polytope Γ. For x n ∈ K[Z d ], the integer ϕ(n) is called Newtonian degree of the monomial x n . Since the polytope Γ is assumed to be superconvenient, i.e., the origin is an interior point of Γ, for any monomial x n its Newtonian degree is non-negative and equals zero if and only if the monomial is equal to x 0 . V. Arnold in [1] used the term piecewise linear degree. We now define the Newtonian degree ϕ for any nonzero elements of the K-algebra K[Z d ]. For a linear combination of monomials with nonzero coefficients S = ∑ i λ i m i , we set ϕ(S) = max i ϕ(Log(m i )). We set the Newtonian degree of the zero element of the K-algebra equal to −∞.

Definition of Newton's Filtration
For brevity, denote by A the K-algebra of Laurent polynomials K[Z d ]. Denote by "·" the operation of multiplication in A.
The vector spaces A i are finite-dimensional and grow with the growth of i: K = A 0 ⊂ A 1 ⊂ A 2 ⊂ . . . and their union is equal to the algebra A. The Proposition 19 of the Section 3.1 implies that the Newtonian degree is subadditive. Therefore, the vector spaces in the algebra A defined above with respect to the operation of multiplication "·" satisfy the condition Thus, in the terminology of the book [25], these vector spaces define in the K-algebra of Laurent polynomials A an integer increasing exhaustive filtration, which V. Arnold in his 1974 paper [1] called the Newton's filtration. This filtered ring should be denoted by A(Γ), but for brevity, we will simply denote it by A.

Associated Graded Ring A(Γ) of the Arnold-Newton Filtered Ring A(Γ) of Laurent Polynomials
Denote by A(Γ), for brevity simply by A, the associated graded ring of the Newtonfiltered ring A. Recall that we use the terms K-algebra, algebra, and ring as synonyms. First, we introduce into A the structure of a vector space over K. In accordance with the definition of an associated graded ring [25], we set A 0 = A 0 = K; for a natural number i, we define the vector space A i as the quotient space A i /A i−1 and finally put A = i≥0 A i . Associating with each monomial x n of Newtonian degree ϕ(n) its equivalence class x n + A ϕ(n)−1 , we obtain a set that is a basis of the vector space A. The elements of this basis will also be called monomials, i.e., by abuse of notations, we will not distinguish between monomials in A and their equivalence classes in A, that is, we will denote monomials in the filtered and graded algebras in the same way.
Denote by "·" the multiplication operation in the filtered algebra A and denote by "•" the multiplication operation in the associated graded algebra A. We describe clearly the operation of multiplication "•" in the associated graded ring A, showing how the product of the equivalence classes of two or more monomials is calculated.

Monomials Multiplication Rule in the Associated Graded Ring A
Let x n 1 and x n 2 be two monomials in the filtered algebra A of Newtonian degrees d 1 = ϕ(n 1 ) and d 2 = ϕ(n 2 ), respectively. Their equivalence classes in A d 1 /A d 1 −1 and A d 1 /A d 1 −1 are x n 1 + A d 1 −1 and x n 2 + A d 2 −1 respectively. According to the standard definition of an associated graded ring, we obtain The Formula (70) is generalized to the case of the product of several monomials Definition 15. (i) Let n 1 and n 2 be two integer points of the set Z d ⊂ R d . Let us call them homoconical if there exists at least one facet ∆ ⊂ ∂Γ such that n 1 ∈ Cone(∆) and n 2 ∈ Cone(∆). According to Proposition 19 in Section 3.1, two points n 1 and n 2 are homoconical if and only if ϕ(n 1 + n 2 ) = ϕ(n 1 ) + ϕ(n 2 ) Two points n 1 and n 2 are called heteroconical if there is no facet ∆ such that n 1 ∈ Cone(∆) and n 2 ∈ Cone(∆). According to Proposition 19, two points n 1 and n 2 are heteroconical if and only if ϕ(n 1 + n 2 ) < ϕ(n 1 ) + ϕ(n 2 ) (ii) The homoconicality/heteroconicality of several, say s > 2, integer points of the set Z d is defined similarly.
The above constructions of the Newton filtration and the graded ring repeated the arguments of [4] and did not use the simplicial property of the polytope Γ. Below, we start using this simpliciality.

The Subring of Vertices of the Graded Ring A(Γ) of the Super-Convenient Convex
Integer Simplicial Polytope Γ Consider in the algebra A the vector space generated by the monomial x 0 and the monomials corresponding to the vertices of the polytope Γ. An element of this vector space is a finite linear combination of monomials in A corresponding to points of the following set in Z d : The elements of the set V(Γ), generally speaking, do not form a semigroup; when adding points from different cones, we can go beyond the limits of the set V(Γ). However, the monomials corresponding to any two points of the set V(Γ) can be multiplied inside A without leaving the set V(Γ) ∪ 0. Indeed, if the points are homoconical, the product is a nonzero monomial in K[V(Γ)]; if the points are heteroconical, the product will be zero. The resulting ring is called the subring of vertices of the super-convenient simplicial polytope Γ.

Remark 2.
In contrast to the structure of the ring A(Γ), the structure of the vertex subring is determined only by the combinatorial structure of the complex of faces of the simplicial polytope Γ and, generally speaking, does not depend on the embedding of the vertices of the polytope in the set Z d . In this paper, however, we are interested in the vertex ring not in itself, but as a subring of the ring A(Γ), which defines a module structure over K[V(Γ)] on it. The structure of this module depends not only on the combinatorial structure of the polytope Γ, but also on how the vertices of this integral convex polytope are embedded in the set Z d ⊂ R d . Proof. First, check that I ⊆ ker(π). Let P be a generator of the ideal I, that is, some non-simplicial product of independent variables V 1 V 2 . . . V s . The element π(P) of the ring K[V(Γ)] is a product of monomials

The Vertex Ring Is
Since the product P is non-simplicial, the vertices v 1 , v 2 , . . . , v s do not belong to any one face of the polytope Γ, and by the Formula (73), the product vanishes. Let us now prove the inclusion ker(π) ⊆ I. First, we prove that any monomial p ∈ ker(π) belongs to the ideal I. Let p be an arbitrary monomial. Let us write out the product of all variables that are included in the monomial p to a positive power. Two cases are possible.
If a nonsimplicial product is obtained, then the monomial p turns out to be a multiple of this nonsimplicial product of independent variables, that is, p ∈ I.
If a simplicial product is obtained, then the monomial p includes only independent variables corresponding to the vertices of some face ∆ i of the polytope Γ, and the image of p turns out to be a monomial in K[V(∆ i )], which, according to the definition of K[V(Γ)], uniquely determines some basis vector of the vector space K[V(Γ)] and, therefore, π(p) = 0.
Finally, let the sum of different monomials with nonzero coefficients f = λ 1 p 1 + λ 2 p 2 + . . . + λ s p s belong to the kernel π. Such a sum cannot contain any monomial p i for which π(p i ) = 0 since the images of such monomials in K[V(Γ)] are linearly independent and any linear combination with nonzero coefficients images of such monomials is not equal to zero. Thus, from π( f ) = 0, it follows that each monomial p i contained in f also belongs to ker(π), hence, by what was proved earlier, it belongs to I, and hence, the linear combination f of such monomials belongs to I.

Remark 3.
Let us assume for a moment that we decide to perform calculations in the ring A using some kind of computer system. Description of the ring A in the classical form, in the form of free generators and relations, would require the introduction of a large number of variables, which grows with the number of vertices Γ. Our description of the additive structure of the ring A requires the introduction of only d variables. One has to pay for this by increasing the complexity of the monomial multiplication algorithm, the execution of which now requires not only the addition of vectors of exponents of monomials, but also the calculation of the homoconicality predicate on the set of pairs of monomials.

"Shelling" of the Set Z d and "Shelling" of the Rings A(Γ)
Given the shelling of the polytope Γ, that is, the sequence facets that satisfies certain conditions, we constructed two other sequences of objects in Section 2.3: -A sequence of subsemigroups Ash 1 , Ash 2 , . . . , Ash N of the group Z d belonging to the cones Cone(∆ 1 ), Cone(∆ 2 ), . . . , Cone(∆ N ); -A sequence of finite sets Bsh 1 , Bsh 2 , . . . , Bsh N of the group Z d belonging to the semigroups Ash 1 , Ash 2 , . . . , Ash N .
These sequences were constructed in such a way that for any i ∈ [1, N] the following conditions are satisfied: The subsemigroup Ash i is invariant under the action of the vertex semigroup V(∆ i ) on the semigroup Γ; -For any i, Bsh i ⊂ Ash i and for i > 1, Bsh i ∩ (Bsh 1 ∪ Bsh 2 , ∪ . . . , ∪Bsh i−1 ) = ∅ ; - The set Bsh i is the fundamental domain for action of the vertex semigroup V(∆ i ) on the subsemigroup Ash i , that is, shifts of the finite set Bsh i by all possible elements of the vertex semigroup V(∆ i ) form a partition of the set Ash i ; - The cardinality of Bsh i is equal to the volume of the parallelepiped Π i defined in the Section 2.4.2.

"Shelling" of the Ring A(Γ)
Let us now construct an analogue of the "shelling" for the ring A(Γ): an increasing sequence of graded K-algebras R 1 , R 2 , . . . , R N , ending with the K-algebra A(Γ). This construction is similar to the construction of the article [9], re-stated in the online publication by R. Stanley [10].
While the objects Ash i and Bsh i are located inside the cone of one facet ∆ i , i.e., "associated" with one facet, the K-algebra R i will be "associated" with the union of facets ∆ 1 ∪ ∆ 2 ∪ . . . ∪ ∆ i . First, we define R 1 , R 2 , . . . , R N as vector spaces over the field K.

Definition 17.
For each i ∈ [1, N], construct the vector space R i over K, taking as a basis the monomials whose exponents belong to the union of the semigroups then for 1 ≤ j < i the basis of each vector space R j is contained in the basis of the next vector space R j+1 and, therefore, it can be considered that The vector space R N = A(Γ) has the structure of a K-algebra. We introduce the structure of a K-algebra on vector spaces R i for 1 ≤ i < N. Using the analogue of the Definition 15 and the analogue of the rule (70) for multiplying monomials in A(Γ), we define the rule for multiplying basis vectors in R j , that is, the rule for multiplying monomials of the form x n , where the exponent n = Log(x n ) belongs to the union of the sets E i = Ash 1 ∪ Ash 2 ∪ . . . ∪ Ash i . The unit monomial x 0 , which has a zero exponent, also belongs to such monomials. The operation of multiplying monomials with exponents from the set E i is denoted by "• i ". The result of this operation will be a monomial (basis vector) in R i or 0 ∈ R i . Further, we extend this operation to the entire vector space R i . As a first step, we extend the operation "• i " allowing us to use as its arguments not only monomials, but also 0 of the vector space R i (different from the unit monomial x 0 ∈ E i ). Namely, for any monomial x n , we put Definition 18. (i) Let n 1 and n 2 be two integer points in E i = Ash 1 ∪ Ash 2 ∪ . . . ∪ Ash i . Let us call them i−homoconical if there is at least one number j ∈ [1, i] such that n 1 ∈ Cone(∆ j ) and n 2 ∈ Cone(∆ j ). Points n 1 and n 2 will be called i−heteroconical if they are not i−homoconical; (ii) Similarly, we define i−homoconicality and i−heteroconicality for several points in E i = Ash 1 ∪ Ash 2 ∪ . . . ∪ Ash i : integer points n 1 , n 2 , . . . , n s in E i = Ash 1 ∪ Ash 2 ∪ . . . ∪ Ash i will be called i−homoconical if there is at least one number j ∈ [1, i] such that n 1 ∈ Cone(∆ j ), n 2 ∈ Cone(∆ j ), . . . n s ∈ Cone(∆ j ). Points n 1 , n 2 , . . . , n s will be called i−heteroconical if they are not i−homoconical; (iii) Define the operation "• i " with a rule similar to the rule (72): x n 1 • i x n 2 = x (n 1 +n 2 ) : if points n 1 , n 2 are i−homoconical 0 : otherwise (75) (iv) Let us extend the operation "• i " , allowing us to use as its arguments not only monomials of the form x n , where n ∈ E i , but also 0 ∈ R i and assuming in this case, the result of the operation is equal to 0 ∈ R i .

Example 4.
Let Γ be Newton polygon having vertices v 1 = (1, 0), v 2 = (−1, −1), v 3 = (0, 1). Then, the facets of Γ are segments . Set for Γ the shelling sh = (∆ 1 , ∆ 2 , ∆ 3 ). Then, the cone Cone(∆ 1 ) contains the points v 1 and v 2 the cone Cone(∆ 2 ) contains the points v 2 and v 3 the cone Cone(∆ 3 ) contains the points v 1 and v 3 Both vector spaces R 2 and R 3 are three-dimensional and contain basis vectors v 1 , v 2 , v 3 . In this way, the monomials x v 1 and x v 3 belong to both R 2 and R 3 , but the products of these monomials in R 2 and R 3 differ: Let us prove the associativity of the operation "• i " on the discrete set of basis vectors of the vector space R i extended by the point 0 and continue this operation to the entire vector space R i . Proposition 26. (i) The operation "• i " is an associative operation on a discrete set consisting of 0 and the basis vectors of the vector space R i ; (ii) Extension by linearity of this operation on the entire vector space R i defines K-algebra structure on R i ; (iii) The product of an arbitrary number of monomials in the K-algebra R i is calculated according to the rule Proof. (i) Let x a , x b and x c be three monomials in R i . We must prove that If at least one monomial is x 0 = 1, then the equality (77) is obvious. Therefore, we can assume that the points a, b and c are non-zero. It suffices to prove that the three points a, b and c are homoconical. Indeed, in this case, the equality (77) follows from the associativity of the addition operation in R d Let us prove that the points a, b and c are homoconical . The first factor in the product (78) is non-zero, because the product is non-zero. Thus, from definition "• i " we can conclude that (x a • i x b ) = x a+b which means x (a+b) • i x c = 0 Therefore, two points (a + b) and c are i−homoconical, i.e., among the cones there is a cone Cone such that (a + b) ∈ Cone and c ∈ Cone. Since (x a • i x b ) = 0, the points a and b are homoconical, that is, there exists a cone Cone j , where 1 ≤ j ≤ i such that a ∈ Cone j , b ∈ Cone j and (a + b) ∈ Cone j . Thus, (a + b) ∈ Cone ∩ Cone j . If Cone j coincides with Cone, then all three points belong to Cone and homoconicality is proved. However, if Cone j = Cone, then the point (a + b) belongs to the intersection of the cones F = Cone j ∩ Cone. This intersection F is a proper face of the cone Cone according to the properties of the faces of the convex superconvenient simplicial polytope Γ. According to Proposition 5 in Section 2.4, (a + b) ∈ F implies that a ∈ F ⊂ Cone and b ∈ F ⊂ Cone. Therefore, all three exponents a, b, c belong to the same cone Cone. Thus, for case 1, Formula (77) is proved.
Repeating the arguments of case 1, we find that the three exponents a, b, c belong to the same cone Cone, and hence, which contradicts the original assumption (79). The proofs of (ii) and (iii) are left to the reader.

Ring's A "Shelling" Properties
For i ∈ [1, N] denote by I i the vector subspace of R i spanned by monomials x n , where n ∈ Ash i Then the bases in the three vector spaces R i , R i−1 and I i will be formed by monomials corresponding to the points of the three sets , and Ash i respectively. For 1 < i ≤ N, the basis of the vector space R i−1 is a subset of the basis of the space R i , therefore, the coordinate-wise embedding h i : R i−1 → R i and the coordinate-wise projection π i : R i → R i−1 vector spaces. It is obvious that R i is a direct sum of h i (R i−1 ) ⊕ I i and, as a vector space, R i−1 is isomorphic to the factor space R i /I i .
The Newtonian degree assigns a gradation to R i . By specifying in the Definition 18 the multiplication of the elements of R i , we have introduced the structure of a graded K-algebra on R i . The graded algebra R i for i = N coincides with the associated graded ring A(Γ).
In the proposition and proof of the following assertion, the number i > 1 will be fixed and, to simplify the formulas, h i , π i will be denoted as h and π, respectively. Proposition 27. (a) The K-algebra R i is finitely generated by the monomials corresponding to the vertices of the faces ∆ 1 , ∆ 2 , . . . , ∆ i and by the monomials corresponding to the elements of the sets Bsh 1 , Bsh 2 , . . . , Bsh i ; (b) The vector space I i is a subalgebra of R i ; (c) The subalgebra I i is an ideal in R i ; (d) For i > 1, for any monomials x p and x q from R i−1 , the following identity holds: (e) The quotient algebra R i /I i is isomorphic to R i−1 .
Proof. (a) follows from the Proposition 14; (b),(c) obviously follow from Proposition 26, which defines the operation of multiplication in R i . Prove (d). Let p, q be two points in (Ash 1 ∪ Ash 2 ∪ . . . ∪ Ash i−1 ). Consider monomials x p and x q in R i−1 . We must find correcting term r ∈ I i that ensures that the identity (80) holds. The points p, q satisfy one of three mutually exclusive conditions.
(1) Points p, q simultaneously belong to one of the cones Cone(∆ 1 ), Cone(∆ 2 ), . . . , Cone(∆ i−1 ). In this case, according to the Definition 18, h(x p • i−1 x q ) = h(x p ) • i h(x q ) and equality (80) holds for r = 0. (2) The points p, q do not simultaneously lie in any of the cones Cone(∆ 1 ), Cone(∆ 2 ), . . . , Cone(∆ i ). In this case, according to Definition 18, x p • i−1 x q = 0 and h(x p ) • i h(x q ) = 0 and again equality (80) holds for r = 0. It remains to analyze the last case. (3) The points p, q do not simultaneously lie in any of the cones Cone(∆ 1 ), Cone(∆ 2 ), . . . , Cone(∆ i−1 ), i.e., x p • i−1 x q = 0, but both lie in the cone Cone(∆ i ), that is, h(x p ) • i h(x q ) = 0. Let us prove that in this case (p + q) ∈ Ash i , and hence h(x p ) • i h(x q ) = x (p+q) ∈ I i and the equality (80) holds for r = x (p+q) . Indeed, let δ ∈ ∆ i be one of the subfacets of codimension 1 of facet ∆ i such that δ ⊂ (∆ 1 ∪ ∆ 2 ∪ . . . ∪ ∆ i−1 ). Let c be a local coordinate function on the cone Cone(∆ i ) that vanishes on the face δ. The points p and q cannot simultaneously lie in the cone of δ, since in this case, they would simultaneously lie in one of the cones Cone(∆ 1 ), Cone(∆ 2 ), . . . , Cone(∆ i−1 ), which would contradict the original assumption of case 3). This means that one of the numbers c(p) and c(q) is positive, and hence, the number c(p + q) = c(p) + c(q) is also positive. This reasoning is applicable to any subfacet of dimension one of facets ∆ i that can be represented as intersection of facet ∆ i with one of the faces ∆ 1 , ∆ 2 , . . . , ∆ i−1 . According to the definition of the set Ash i , this means that p + q ∈ Ash i , which completes the proof of the Equality (80).
Let us prove (e). Since ker(π) = I i , it suffices to prove that π : R i → R i−1 is a ring homomorphism. Since R i is a direct sum h(R i−1 ) ⊕ I i , any two monomials A, B in R i can be represented as A = h(a) + u, B = h(b) + v, where the monomials a, b belong to R i−1 and u, v belong to I i . That is why According to the Equality (80), We have proven that π(A • i B) = π(A) • i−1 π(B), that is, we have proven that π is a ring homomorphism.

Cohen-Macaulayness of Algebra A(Γ)
In this section, we construct a regular sequence of d homogeneous elements of the ring A(Γ), representable as linear combinations of monomials corresponding to the vertices of Γ, and present a monomial basis for the quotient algebra of the ring A(Γ) by the ideal generated by the elements of this sequence. This basis consists of equivalence classes of monomials whose exponents belong to the set B sh = Bsh 1 ∪ Bsh 2 ∪ . . . ∪ Bsh N constructed in Section 2.5. The cardinality of this monomial basis, according to 18 (ii), is equal to µ(Γ) = d! × Volume(Γ).
The coefficients of these elements form a d × L matrix C over K. Each vertex of Γ corresponds to a column of the matrix C, and each facet corresponds to d × d minor.

Definition 19.
We call a sequence f 1 , f 2 , f 3 , . . . , f d nondegenerate if all d × d minors of the matrix C corresponding to the facets of Γ are nonzero.
The existence of non-degenerate sequences can be easily deduced from the infinity of the field K. Using the assumption that the characteristic of the field K is zero, it is easy to present one non-degenerate sequence explicitly. Example of a non-degenerate sequence. Let us start with the sum of monomials of all vertices Γ f = x w 1 + x w 2 + x w 3 + . . . + x w L and take the sequence of "toric" partial derivatives f : It is easy to see that the sequence (82) is non-degenerate. Indeed, for such a sequence, the matrix C will consist of the column vectors of the coordinates of the vertices of the polytope Γ. Therefore, the minor corresponding to a facet of Γ is equal to the determinant of the d × d-matrix composed of facet's vertices. Moreover, due to the super-convenience of the Γ polytope, this determinant does not vanish for any facet of Γ.
Assertion (A) will be proved below by induction on i. This proof is the central argument of this article. It generalizes the proof given in [9] and rewritten in [10].
We will now deduce conclusions (B) and (C) of Theorem 4 from conclusion (A) of this theorem. To do this, we use the well-known method of element-by-element comparison of Poincaré series, described, for example, in [10]. We will formalize this reasoning in the form of Proposition 29. The assumption of this Proposition is the conclusion (A) of Theorem 4, and conclusions (1), (2) and (3)  Proof. Let us denote µ(Γ) by µ for brevity. The cardinality of the set B sh = (Bsh 1 ∪ Bsh 2 ∪ . . . ∪ Bsh N ) is equal to µ. Let m 1 , m 2 , . . . , m µ be the set of monomials in A(Γ) corresponding to points in the set B sh . Denote by B sh K the finite-dimensional vector space generated by these monomials, endowed with a Newtonian grading. Denote by Q(t) Poincaré series H(B sh K , t) of this graded vector space. Let us prove that the equivalence classes of monomials m 1 , m 2 , . . . , m µ generate the quotient algebra A(Γ)/I over the field K.
Since it is given that the monomials corresponding to the elements of this set generate A(Γ) as a module over the subalgebra X, an arbitrary element G ∈ A(Γ) can be represented as By s i ∈ K, denote the constant term of the polynomial S i and rewrite (83) as Since each difference S i ( f 1 , f 2 , . . . , f d ) − s i belongs to the ideal I, the second sum in (84) belongs to the ideal I. Hence, the equivalence classes of monomials m 1 , m 2 , . . . , m µ generate the quotient algebra A(Γ)/I. Therefore, the following element-by-element inequality between Poincaré series holds According to the Formula (69) of Section 4.1 , the successive factorization of A(Γ) over the elements of f 1 , f 2 , . . . , f d yields the inequality According to Formula (66) and Proposition 20, the Poincaré series of the K-algebra A(Γ) is equal to where Q(t) is the Poincaré series of the finite-dimensional vector space B sh K generated by monomials whose exponents belong to the set B sh = (Bsh 1 cupBsh 2 . . . ∪ Bsh N ). Substituting (87) into LHS of (86), we obtain Multiplying the element-wise inequality (85) by a series with non-negative coefficients 1 (1−t M ) d and a positive constant term, we obtain From (88) and (89), it follows that hence hence, the set of monomials of the form . . , f d ), which proves 29 (1). By Theorem 3 Proposition 29 (1) implies 29 (2) and 29 (3).

Proof of Theorem 4 (A)
Definition 20. A monomial m ∈ R i is called representable in R i if m belongs to an X i -submodule generated in R i by monomials with exponents running through B sh = (Bsh 1 ∪ Bsh 2 ∪ . . . ∪ Bsh i ).
To prove the assertion (A) of Theorem 4, it suffices to establish that any monomial in R i is representable. We start by proving two auxiliary assertions.

Proposition 30.
Let v be a vertex of some of facets ∆ 1 , ∆ 2 , . . . , ∆ i . Then, for any b ∈ Bsh i , the product x v • i x b is representable in R i .
Proof of Proposition 30 in the case when v ∈ ∆ i . For i > 1, the points of the set Bsh i by construction do not belong to Therefore, if the vertex v does not belong to the face ∆ i , then the points v and b cannot be homoconical and, by the definition of the operation of multiplication in R i , the product Multiply the equality (92) in R i by x b , where bis ∈ Bsh i . According to the previous case, for each w ∈ ∆ i , the product f w (x w • i x b ) is equal to 0 and we obtain θ Proposition 31. Let v 1 , v 2 , . . . , v l be a sequence (possibly with repetitions) of vertices of facet ∆ i and b ∈ Bsh i . Then, for l ≥ 1, the product is representable in R i .
Proof. According to Proposition 28(i) for each vertex v ∈ ∆ i there exist a linear combination Let us construct such a representation for each vertex of the product (93) Let us prove by induction a somewhat more precise assertion Base case in the proof of the Formula (95). The case l = 1, that is, the representability of the product x v 1 x b as a product θx b , is analyzed in the proof of the Statement 30. Induction step (l − 1) → l in the proof of the Formula (95). By the inductive hypothesis, Hence, Proposition 32. Any element x a , where a ∈ Ash i is representable.
Proof. According to Proposition 16, the element x a can be represented as x a = x v x b , where v ∈ V(∆ i ) and b ∈ Bsh i . It remains to apply Proposition 31.

Proof of Theorem 4(A).
Induction on i Base case. For i = 1, R 1 = A(∆ 1 ), Bsh 1 = B(∆ 1 ), X 1 = V(∆ 1 ) and the monomials of B(∆ 1 ) generate A(∆ 1 ) as a V(∆ 1 )-module according to 9. Induction step (i − 1) → i when the set of vertices does not increase. Let us use the notation of Section 6.1. In this notation, the representation as a linear combination of monomials for the functions f ). Let us represent R i as h i (R i−1 ) ⊕ I i . We must show that each element of R i is representable. The basic elements of I i are of the form x a , where ais ∈ Ash i . Such elements are representable according to Statement 32. Find a representation for any element h i (e) ∈ h i (R i−1 ). By the induction hypothesis, any element of e ∈ R i−1 can be represented as a sum of products of the form From the equality (80) and the fact that I i is an ideal, it follows that for any elements p and q of R i−1 , the following equality holds From this, it is easily deduced that for any polynomial P in several variables and any elements a 1 , a 2 , . . . , a j of the ring R i−1 the relation h i (P(a 1 , a 2 , . . . , a j ) = P(h i (a 1 ), h i (a 2 ), . . . , h i (a j )) + r, where r ∈ I i holds. Applying this relation to each product f b x b , we obtain that the element h(e) belongs to I i and, therefore, is representable according to the Statement 32. Induction step (i − 1) → i in the case when the set of vertices increases by one. In this case, the new facet ∆ i contains d − 1 old vertex and one new vertex, say w. Monomials in R i can be divided into old monomials belonging to h i (R i−1 ) and new monomials corresponding to Ash i points. The new monomials are representable according to the Statement 31. For old monomials, the result of multiplication in R i coincides with multiplication in R i−1 , more precisely, in contrast to the previous case, the embedding of K-vector spaces h i : R i−1 → R i is a ring homomorphism. The only thing left to prove is the fact that the old monomials representable in R i−1 remain representable in R i despite the change in functions. Each new function f d is obtained from the corresponding old function by adding the monomial w with some coefficient. Let us label the old and new functions as θ 1 , θ 2 , . . . , θ d and θ 1 , θ 2 , . . . , θ d , respectively. Then, for some constants λ 1 , λ 2 , . . . , λ d By the induction hypothesis, each monomial m ∈ R i−1 can be represented as It suffices to prove the representability of each term of the sum (97). We choose one term of the sum, make the substitution (96), and expand the result of the substitution in powers of x w : The member with S 0 is representable by definition. To prove the representability of the remaining terms, it suffices to prove the representability of the products Note that the new vertex w does not belong to the cones Cone(∆ 1 ), Cone(∆ 2 ), . . . Cone(∆ i−1 ). Hence, if b ∈ Cone(∆ i ), then the products x w x b , (x w ) 2 x b , . . . are equal to zero by the definition of multiplication in R i . If b ∈ Cone(∆ i ), then these products belong to the new cone Cone(∆ i ), but do not belong to the intersection of this cone with the old cones Cone(∆ 1 ), Cone(∆ 2 ), . . . Cone(∆ i−1 ). This means that these products belong to Ash i and are therefore representable according to Proposition 32. The proof of conclusion (A) of Theorem 4 is complete.

Main Theorem
The proofs in this section are of a routine nature and largely repeat the arguments both given and omitted in my 1976 paper [4], published in French. These proofs were never published in Russian or English.
The proofs below use the regularity of the sequence of elements of the algebra A given by explicit Formula (82) and the corollaries following from it by Theorem 3.
Let us formulate the main theorem without omitting details.

Verbose Formulation of the Main Theorem
Theorem 5. (Main Theorem). We fix the following objects: The number µ(Γ) = d! × Volume(Γ) defined by this polytope; • Field K of characteristic 0; • An exhaustive increasing Newton N-filtration of K-algebra K[Z d ]; this K-algebra will be denoted for brevity by A: The N-graded algebra gr(K[Z d ]) associated with the Newton filtration, denoted for brevity by A; • N-grading of the free module A d formed by tuples of d elements of the algebra A, defined by the relations Definition of the Newtonian degree of an element g ∈ A, well defined since Newtons filtering is exhaustive: for non-null element deg(g) = min{n : g ∈ A n } for element zero deg(0) = −∞ • Definition of leading_term (aka boundary_term) of a nonzero element v ∈ A of the filtered algebra, this leading_term is denoted byv, belongs to A k , where k = deg(v), and is defined by the formulav Shelling sh of polytope Γ; • Finite set constructed from the super-convenient simplicial polytope Γ and its shelling sh containing all points of Newtonian degree less M and not containing points of Newtonian degree higher than dM; • The set of monomials in the filtered algebra K[Z d ]) consisting of the elements The set of monomials in the graded algebra A, ∈ N S basic , where N S basic is defined in (main.c), it is true that the ideal (g 1 , g 2 , . . . , g d ) has the codimension equal to µ(Γ) and the equivalence classes of monomials m 1 , m 2 , . . . , m µ form a basis over K of the quotient algebra The abbreviation N S should be understood as NonSingular.
Statements (main.b) and (main.d) can be reformulated and abbreviated using the term generic. Theorem 6. Let Γ ⊂ R d be a convex super-convenient integer simplicial polytope and K be a field of characteristic 0. Then: (b') For generic Laurent polynomials g 1 , g 2 , . . . , g d whose supports belong to the polytope Γ, the codimension of the ideal (g 1 , g 2 , . . . , g d ), generated by these polynomials in the K-algebra K[Z d ] is equal to d! × Volume(Γ); (d') For each shelling of a convex, super-convenient integer simplicial polytope Γ, a set of monomials m 1 , m 2 , . . . , m µ can be explicitly constructed, where µ = d! × Volume(Γ), such that for generic Laurent polynomials g 1 , g 2 , . . . , g d whose supports belong to the polytope Γ, ideal (g 1 , g 2 , . . . , g d ) ⊂ K[Z d ] has a finite codimension equal to µ(Γ) and the equivalence classes of monomials m 1 , m 2 , . . . , m µ form a basis of the quotient algebra K[Z d ]/(g 1 , g 2 , . . . , g d ) .
In bases defined by monomials, each finite-dimensional mapping d 1,n is given by its matrix, the coefficients of which depend linearly on the coefficients of Laurent polynomials G 1 , G 2 , . . . , G d of Newtonian degree M; these coefficients form a finite-dimensional vector space, which we previously denoted by W. The homogeneous component A n of the algebra A belongs to the ideal if and only if the matrix of d 1 (n) has the maximum possible rank equal to dim K (A n ). Therefore, the homogeneous ideal (G 1 , G 2 , . . . , G d ) has finite codimension if and only if for all n ≥ M, except for a finite number, the matrix of d 1,n has the highest possible rank. Formula (82) explicitly defines a non-degenerate sequence, which is regular by the Theorem 4. According to (59) and (91), the Poincare series of the factor algebra generated by this regular sequence is a polynomial of degree dM. Thus, there is at least one point in the space W for which all subspaces A n , where n > dM lie in the ideal (G 1 , G 2 , . . . , G d ). Therefore, all corresponding matrices have the maximum rank. Let us fix a number n ∈ (dM, 2dM]. Let us denote by S n ⊂ W the set of such elements of the vector space W that A n does not belongs to the ideal (G 1 , G 2 , . . . , G d ).
Elements of the matrix of linear mapping are polynomials in the coefficients of the polynomials G 1 , G 2 , . . . , G d . According to the wellknown theorem of linear algebra, for the rank of a rectangular matrix to be nonmaximal, it is necessary and sufficient that all minors of this matrix of maximum dimension vanish. That is, it is necessary and sufficient to fulfill a finite number of algebraic conditions on the coefficients of the matrix. Applying this statement to the matrix of the mapping we obtain that S n is a Zariski closed subset of W. The complement to this subset is nonempty because it contains a point (82). Let us put The Zariski open set N S codim is non-empty because it contains the point (82). Let us now prove that any tuple of polynomials from the set N S codim generate ideals of finite codimension. To do this, it suffices to prove that if [G 1 , G 2 , . . . , G d ] ∈ N S codim , then the ideal (G 1 , G 2 , . . . , G d ) contains all Newtonian monomials greater than 2dM. To prove this, it suffices to prove that any such monomial is divisible by some monomial whose Newtonian degree lies in the range (dM, 2dM]. By definition of N S codim , any such monomial belongs to the ideal. (Conclusion.) Then, the codimension of the ideal (g 1 , g 2 , . . . , g d ) ⊂ A is finite and the equivalence classes of elements e 1 , e 2 , . . . , e µ span quotient algebra A/(g 1 , g 2 , . . . , g d ).
Proof. It suffices to prove that an arbitrary element e ∈ A can be represented as Element 0 is obviously representable. The union of zero and all nonzero elements of zero degree forms in the algebra A a one-dimensional vector space spanned by the identity monomial. The leading term of this monomial necessarily enters the monomial basis of any quotient algebra by the ideal generated by the elements of positive degrees. Therefore, we can assume that if Assumption is true, then we can choose the unit monomial as e 1 . Thus, any element of the algebra A of degree zero is representable in the required form (101). For an arbitrary element e ∈ A of a positive Newtonian degree, there exists k ≤ deg(e) such that the element e can be represented approximately, up to some correction term r k ∈ A k , in the form Indeed, there exists a trivial representation of the form (102) in which k is equal to Newtonian degree of the element e, the element e is taken as the correction term r k , and the remaining terms are chosen to be zero. Among the non-empty set of possible representations of the element e of the form (102), we choose some representation with the minimum Newtonian degree of the correction term r k . Let us prove that this minimal Newtonian degree is equal to −∞. Thus, we prove that there exists an exact representation of the monomial e of the form (101). Thus, to prove the existence of an exact representation of an element e of the form (101), it is sufficient for any representation of an element e of the form (102) with a non-zero correction term r k to construct a more accurate representation with a smaller Newtonian degree of the correction term.
Proof of the possibility of lowering the Newtonian degree of the correction term in the representation (102). Consider the term r k ∈ A k of the representation (102) and its leading_termr k ∈ A k . According to the Assumption, the elementr k , like any element of the A algebra, is represented as: For k > 0, it follows from (103) that β j e j + r k−1 , where r k−1 ∈ A k−1 , p i ∈ A k , β j ∈ K Substituting the found expression for the correction term r k into (102), we obtain a new approximate representation of the element e with a correction term r k−1 whose Newtonian degree has decreased e = ∑ 1≤i≤d h i g i + ∑ 1≤j≤µ λ j e j + ∑ 1≤i≤d p i g i + ∑ 1≤j≤µ β j e j + r k−1 = ∑ 1≤i≤d (h i + p i )g i + ∑ 1≤j≤µ (λ i + β j )e j + r k−1 , where r i ∈ A k−1 , h i + p i ∈ A, λ i + β j ∈ K For k = 0, the correction term r 0 is proportional to e 1 and changing the term λ 1 e 1 turns the approximate representation (102) into an exact representation (101). Proposition 36 is proven. This also proves Proposition 34.
To prove the assertion (main.b), it remains to prove the assertion 35. This proof is the most difficult step in the proof of the assertion (main.b). At this point, we need two tools: -A sufficient condition for the strictness of mapping filtered modules, formulated in Proposition 38 below; -A known theorem on the vanishing of the homology of dimension 1 of the Koszul complex of a regular sequence of homogeneous elements of positive degrees of a finitely generated graded algebra over a field of characteristic 0, see, for example, Theorem 06 in [26] Proof of Proposition 35. We need to prove that if some linear combination λ j e j , where λ j ∈ K (106) belongs to the ideal (g 1 , g 2 , . . . , g d ), i.e., z is represented as then this combination z is trivial, that is: Let us prove the Formula (108) by contradiction. If at least one coefficient in the linear combination (106) is nonzero, then the leading termẑ of the element z is some nontrivial linear combination of representatives of the basis vectors of the quotient algebra A/(ĝ 1 ,ĝ 2 , . . . ,ĝ µ ). Due to its nontriviality, this linear combination of basis vectors is nonzero. This means that the element z is also different from zero and therefore has a finite Newtonian degree k. We calculate the leading termẑ of the element z of the Newtonian degree k in two ways, using the representation of z by the Formula (106) or by the Formula (107). First way. From the Formula (106), it follows thatẑ is a non-trivial linear combination of those elementsê j , for which the Newtonian degree of e j equals k: Second way. Let us start with representation (107). By itself, it does not give us anything, since the multipliers h 1 , h 2 , . . . , h d of arbitrarily high Newtonian degrees can participate in it. However, we use the very fact of the existence of such a representation. Below, we prove that the existence of some representation (107) of the element z of the Newtonian degree k implies the existence of such a representation that each of the elements h 1 , h 2 , . . . , h d belongs to A k−M : Therefore, calculating the leading termẑ from the Formula (110) yieldŝ Comparing the representations (109) and (111) of the elementẑ ∈ A, we obtain that a non-trivial linear combination of representatives of the basis vectors of the quotient algebra A/(ĝ 1 ,ĝ 2 , . . . ,ĝ µ ) belongs to the ideal (ĝ 1 ,ĝ 2 , . . . ,ĝ µ ). That is, from the negation of the equality (108), we deduced the existence of a non-trivial linear relation between the basis vectors of the factor algebra. The resulting contradiction proves the equality (108).
Proof of the existence of representation (110). We will consider A d and A as filtered modules over the Newton filtered K-algebra A. The ideal (g 1 , g 2 , . . . , g d ) can be considered as the image of the mapping of filtered modules, where ∂ 1 is given by the formula ∂ 1 (h 1 , h 2 , . . . , h d ) = (h 1 g 1 + h 2 g 2 + . . . + h d g d ) The existence of a representation (110) in terms of mappings of filtered modules would follow from the relation if we could prove it. In terms of mappings of filtered modules, the fulfillment of the relation (113) is called the strictness of the mapping ∂ 1 . Therefore, to complete the proof of the existence of representation (110), it remains to prove the strictness of the mapping ∂ 1 , i.e., to prove (113). This proof uses the known sufficient condition of strictness (see Proposition 38 below). The proof of existence of representation (110) completes the proof of Proposition 35, which in turn completes the proof of the assertion (main.b).

Proof of the relation (113).
Definition 21. The mapping of N-filtered modules Proposition 37. Let Y ∂ 1 − → Z be a strict mapping of filtered modules. Then, gr(Z /∂ 1 (Y )) = gr(Z )/gr(∂ 1 )(gr(Y )) The proof follows from the definitions of associated graded objects constructed from filtered objects.

Proposition 38. Sufficient condition for strictness of mapping of filtered modules. Let
be a complex of filtered modules, i.e., each of two mappings ∂ 2 and ∂ 1 preserve the filtering and the composition of these mappings is zero. Let us denote gr(X ) = X, gr(Y ) = Y, gr(Z ) = Z, gr(∂ 2 ) = d 2 , gr(∂ 1 ) = d 1 Suppose that Y = k∈N Y k and the sequence is exact at Y. Then, the mapping ∂ 1 is a strict mapping of filtered modules.
An example of applying Proposition 38 to Koszul complexes. Let us consider A d and A as filtered modules over the Newton filtered K-algebra A. Let us consider two tuples [g 1 , g 2 , . . . , g d ] ∈ A d and [G 1 , G 2 , . . . , G d ] ∈ A d such that [G 1 , G 2 , . . . , G d ] = Leading_term([g 1 , g 2 , . . . , g d ]) The ideal (g 1 , g 2 , . . . , g d ) ⊂ A can be considered as the image of the mapping of filtered modules, where ∂ 1 is given by the formula ∂ 1 (h 1 , h 2 , . . . , h d ) = (h 1 g 1 + h 2 g 2 + . . . + h d g d ) The sequence of module mappings (116) can be extended to the right by the natural projection of the algebra onto the quotient algebra The sequence (117) can be continued to the left as a fragment of the Koszul complex of the sequence g 1 , g 2 , . . . , g d of elements of the algebra A Let us move now from filtered objects to graded objects. It is clear that the associated graded modules for the filtered modules A ( d 2 ) , A d , and A are the modules A ( d 2 ) , A d , and A. The sequence (118) of filtered objects corresponds to the sequence of graded objects that is a fragment of the Koszul complex of of the sequence G 1 , G 2 , . . . , G d of elements of the algebra A Proposition 38 will be applied to the first three members of the sequence (118), which will play the role of X , Y, and Z and to the first three members of the sequence (119), which will play the role of X, Y, and Z. A meaningful fact that allows us to apply Proposition 38 is the regularity of the sequence (G 1 , G 2 , . . . , G d ). This regularity is provided by assertion (main.a).
Proof of Proposition 38. We have to prove the relation (114). Consider a nonzero element z ∈ ∂(Y ) ∩ Z k . Since Y = k∈N Y k , there are an index l ≥ k and an element y ∈ Y l such that ∂ 1 y = z ∈ Z k . Let us put k 1 = min{n ∈ N : n ≥ k, z ∈ ∂ 1 (Y n )}.
The set described by curly brackets is non-empty because it contains the number l, so the number k 1 is well defined. Let us prove that k 1 = k. Assume that k 1 > k. This means that there exists y 1 ∈ Y k 1 such that ∂ 1 y 1 = z. Therefore, Since the sequence (115) is exact, there exists an element x ∈ X k 1 such that ∂ 2 (x + X k 1 −1 ) ⊆ y 1 + Y k 1 −1 This implies that y 1 − ∂ 2 x ∈ Y k 1 −1 and ∂ 1 (y 1 − ∂ 2 x) = ∂ 1 y 1 = z polynomials in the tuple [G 1 , G 2 , . . . , G d ] ∈ W. Any homogeneous component A n ⊂ A is spanned by basis monomials' modulo the image of d 1,n if and only if the rectangular matrix of composition n has the maximum possible rank. There is at least one tuple for which the matrices of all compositions composition n , where n ∈ [M, dM], have the highest possible rank.
According to the well-known theorem of linear algebra, for the rank of a rectangular matrix to be nonmaximal, it is necessary and sufficient that all minors of this matrix of maximum dimension vanish. That is, it is necessary and sufficient to fulfill a finite number of algebraic conditions on the coefficients of the matrix.
When proving (main.a), we have constructed in the vector space W a finite number of Zariski closed sets S j , where j ∈ (dM, 2dM]. We denote the complement to these subsets in W by N S codim . To prove assertion (main.c), we additionally define in W Zariski-closed sets S n , where n ∈ [M, dM]. Let us define each of these sets S n by the condition that the matrix of mapping composition n has nonmaximal rank. As shown above, each S n is a Zarisky closed subset of W whose complement is non-empty. Next, we set S basis = S codim ∪ ( Consider a tuple G = [G 1 , G 2 , . . . , G d ] ∈ N S basis . Let us prove that the quotient algebra A/(G 1 , G 2 , . . . , G d ) is generated by the equivalence classes of monomials belonging to the set M. The tuple F does not belong to S codim . Therefore, according to (main.a), the codimension of the ideal (F 1 , F 2 , . . . , F d ) is equal to µ(Γ) and all elements of the algebra A whose degree is greater than dM belong to the ideal. In other words, the quotient algebra A/(F 1 , F 2 , . . . , F d ) is generated by the equivalence classes of homogeneous elements of the algebra A degree n ≤ dM. Let us prove that each homogeneous element of the factor algebra of degree n ≤ dM is a linear combination of representatives of monomials of the set M. For any n < M the homogeneous component A n ⊂ A is generated by monomials from the set M. It is given that the tuple F does not belong to the set S n . Therefore, by definition of S n , any homogeneous component A n ⊂ A is spanned by basis monomials modulo the image of d 1,n . Thus, we have proved that if a tuple F belongs to the non-empty Zarisky open set N S basis it follows that any homogeneous element of the quotient algebra A/(F 1 , F 2 , . . . , F d ) of Newtonian degree n ≤ dM expands in the basis M. Now, consider homogeneous elements of degree n > dM. Since, by construction, N S basis ⊂ N S codim , it follows from (main.a) that all homogeneous elements of the factor algebra degree above dM vanish, and hence any element of the factor algebra decomposes in the equivalence classes of the monomials of the set M. Since the cardinality of this set is equal to the dimension of the quotient algebra, the equivalence classes of monomials of the set M form a basis for the quotient algebra A/(F 1 , F 2 , . . . , F d ). The proof of assertion (main.c) is complete.