Related papers: Un invariant remarquable des polytopes simples
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We characterize all the strongly monotypic polytopes. Hadwiger's conjecture for this class of polytopes is deduced from the characterization.
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
We prove that any simple polytope (and some non-simple polytopes) in $\mathbb R^3$ admits an inscribed regular octahedron.
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…
We introduce three simple polynomial maps with integer coefficients that have interesting dynamical properties modulo primes.
Inscribability of polytopes is a classic subject but also a lively research area nowadays. We illustrate this with a selection of well-known results and recent developments on six particular topics related to inscribable polytopes. Along…
Given any finite graph, we offer a simple realization of the graph-associahedron polytope using integer coordinates.
A classification of SL$(n)$ invariant valuations on the space of convex polytopes in $R^n$ without any continuity assumptions is established. A corresponding result is obtained on the space of convex polytopes in $R^n$ that contain the…
All simple translation-invariant valuations on polytopes are classified. As a direct consequence the well-known conditions for translative-equidecomposability are recovered. Furthermore, a simplified proof of the classification of…
We generalize the Rubik's cube, together with its group of configurations, to any abstract regular polytope. After discussing general aspects, we study the Rubik's simplex of arbitrary dimension and provide a complete description of the…
We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.
This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…
A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…
We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.
For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the…
We associate to every central simple algebra with involution of orthogonal type in characteristic two a totally singular quadratic form which reflects certain anisotropy properties of the involution. It is shown that this quadratic form can…