Related papers: Realization spaces of 4-polytopes are universal
Let $X$ be a simply connected space with finite-dimensional rational homotopy groups. Let $p_\infty \colon UE \to \mathrm{Baut}_1(X)$ be the universal fibration of simply connected spaces with fibre $X$. We give a DG Lie model for the…
We consider the class of multiple Fourier series associated with functions in the Dirichlet space of the polydisc. We prove that every such series is summable with respect to unrestricted rectangular partial sums, everywhere except for a…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
It is shown uniquely that quantized spaces are realised on four-dimensional compact manifolds. In the case of O(1,5) quantized space this are four independent parameters of O(5) unit vector; in the case of O(2,4) these are parameters of one…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
The level of a module over a differential graded algebra measures the number of steps required to build the module in an appropriate triangulated category. Based on this notion, we introduce a new homotopy invariant of spaces over a fixed…
We study properties of the realizations of groups as the combinatorial automorphism group of a convex polytope. We show that for any non-abelian group $G$ with a central involution there is a centrally symmetric polytope with $G$ as its…
The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…
In 1940s Steenrod asked if every homology class $z\in H_n(X,\mathbb{Z})$ of every topological space $X$ can be realised by an image of the fundamental class of an oriented closed smooth manifold. Thom found a non-realisable 7-dimensional…
A $P$-space is a topological space whose every $G_{\delta}$-set is open. In this article, basic properties of $P$-spaces are investigated in the absence of the Axiom of Choice. New weaker forms of the Axiom of Choice, all relevant to…
The reflexive dimension refldim(P) of a lattice polytope P is the minimal d so that P is the face of some d-dimensional reflexive polytope. We show that refldim(P) is finite for every P, and give bounds for refldim(kP) in terms of…
This article concerns a question asked by M. V. Nori on homotopy of sections of Projective modules defined on the polynomial algebra over a smooth affine domain $R$. While this question has an affirmative answer, it is known that the…
In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only.…
The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…
We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…
We study realization spaces of matroids over hyperfields (in the sense of Baker and Bowler). More precisely, given a matroid M and a hyperfield H we determine the space of all H-matroids over M. This can be seen as the matroid stratum of…
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…