Related papers: Smooth Combinatorial Cubes are IDP

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…

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…

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 propose and develop a new method to classify orbits of the spin group ${\rm Spin}(2d)$ in the space of its semi-spinors. The idea is to consider spinors as being built as a linear combination of their pure constituents, imposing the…

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

We present an algorithm that produces the classification list of smooth Fano d-polytopes for any given d. The input of the algorithm is a single number, namely the positive integer d. The algorithm has been used to classify smooth Fano…

This paper is about integral zonotopes. It is proven that large zonotopes in a convex cone have a limit shape, meaning that, after suitable scaling, the overwhelming majority of the zonotopes are very close to a fixed convex set. Several…

For each $d\geq 0$, we prove decoupling inequalities in $\mathbb R^3$ for the graphs of all bivariate polynomials of degree at most $d$ with bounded coefficients, with the decoupling constant depending uniformly in $d$ but not the…

The main purpose of this paper is to popularize Danzer's power complex construction and establish some new results about covering maps between two power complexes. Power complexes are cube-like combinatorial structures that share many…

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…

Kalai proved that the simplicial polytopes with g_2=0 are the stacked polytopes. We characterize the g_2=1 case. Specifically, we prove that every simplicial d-polytope (d>=4) which is prime and with g_2=1 is combinatorially equivalent…

Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…

An infinitely smooth convex body in $\mathbb R^n$ is called polynomially integrable of degree $N$ if its parallel section functions are polynomials of degree $N$. We prove that the only smooth convex bodies with this property in odd…

We obtain a series of lower bounds for the product set of combinatorial cubes, as well as some non--trivial upper estimates for the multiplicative energy of such sets.

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

We construct an explicit example of a smooth isotopy $\{\xi_t\}_{t \in [0,1]}$ of volume- and orientation-preserving diffeomorphisms on $[0,1]^n$ ($n \geq 3$) that has infinite total kinetic energy. This isotopy has no self-cancellation and…

Let $G$ be a graph of order $n$. The path decomposition of $G$ is a set of disjoint paths, say $\mathcal{P}$, which cover all vertices of $G$. If all paths are induced paths in $G$, then we say $\mathcal{P}$ is an induced path decomposition…

For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over an algebraically closed field of characteristic zero, we give a combinatorial proof of the smoothness of the corresponding catalecticant…

In this paper we present the notion of smooth CW complexes given by attaching cubes on the category of diffeological spaces, and we study their smooth homotopy structures related to the homotopy extension property.