Related papers: Un invariant remarquable des polytopes simples

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Let $\mathcal{P} \subset \mathbb{R}^N$ be an integral convex polytope of dimension $d$ and write $k \mathcal{P}$, where $k = 1, 2, \ldots$, for dilations of $\mathcal{P}$. We say that $\mathcal{P}$ possesses the integer decomposition…

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

In this paper, we study some properties of associated sequences of special polynomials. From the properties of associated sequences of polynomials, we derive some interesting identities of special polynomials.

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

We discuss some seemingly unrelated observations on integers, whose close or farther away neighbors show a complex of combinatorial, ordering, arithmetical or probabilistic properties, emphasizing puzzlement in more common expectations.

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

We give in this note a weighted version of Brianchon-Gram's decomposition for a simple polytope. This weighted version is a direct consequence of the ordinary Brianchon-Gram formula.

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

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

We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.

Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of…

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

This paper introduces the notion of an unravelled abstract regular polytope, and proves that $\SL_3(q) \rtimes <t>$, where $t$ is the transpose inverse automorphism of $\SL_3(q)$, possesses such polytopes for various congruences of $q$. A…

Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…

We interpret the coefficients of the cyclotomic polynomial in terms of simplicial homology.