Related papers: Reconstructing a non-simple polytope from its grap…

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…

It is a celebrated result of Mather that the group of $C^k$--diffeomorphisms of an $n$--manifold is simple, provided that a mild isotopy condition is satisfied, with the possible exception of $k=n+1$. The purpose of this article is mostly…

Cyclic polytopes are characterized as simplicial polytopes satisfying Gale's evenness condition (a combinatorial condition on facets relative to a fixed ordering of the vertices). Periodically-cyclic polytopes are polytopes for which…

The moduli space of regular stable maps with values in a complex manifold admits naturally the structure of a complex orbifold. Our proof uses the methods of differential geometry rather than algebraic geometry. It is based on Hardy…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests…

We prove that a polynomial map is invertible if and only if some associated differential ring homomorphism is bijective. To this end, we use a theorem of Crespo and Hajto linking the invertibility of polynomial maps with Picard-Vessiot…

A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). Characterizing…

Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…

We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…

We connect the homotopy type of simplicial moduli spaces of algebraic structures to the cohomology of their deformation complexes. Then we prove that under several assumptions, mapping spaces of algebras over a monad in an appropriate…

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in…

A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). An interesting open…

Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…

We investigate the manifold $\cal{M}$ of (real) quadratic forms in n > 1 variables having a multiple eigenvalue. In addition to known facts, we prove that 1) $\cal{M}$ is irreducible, 2) in the case of n = 3, scalar matrices and only them…

Let $M$ be a $2$-space form. Let $P$ be a convex polygon in $M$. For these polygons, we define (and justify) a curvature $\kappa_i$ at each vertex $A_i$ of the polygon and and prove the following Blaschke's type theorem: If $P$ is a convex…

In 1968, Gallai conjectured that the edges of any connected graph with $n$ vertices can be partitioned into $\lceil \frac{n}{2} \rceil$ paths. We show that this conjecture is true for every planar graph. More precisely, we show that every…

This paper continues investigation of the class of flag simple polytopes called 2-truncated cubes. It is an extended version of the short note Volodin (2012). A 2-truncated cube is a polytope obtained from a cube by sequence of truncations…

We compute the canonical form of the cosmological polytope for any graph in terms of the dual of the shifted cosmological polytope in two different ways. On the way, we provide an explicit coordinate description of the dual of the…

There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…