Related papers: Finite Polytopes have Finite Regular Covers

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

We prove that any nilpotent regular covering over a compact K\"ahler surface is holomorphically convex if it does not have two ends. Furthermore, we show that the Malcev covering of any compact K\"ahler manifold has at most one end.

We prove that every connected locally finite regular graph has a double cover which is isomorphic to a Schreier graph.

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…

For each $n\geq 3$ we give examples of infinitesimally rigid projective manifolds of general type of dimension $n$ with non-contractible universal cover. We provide examples with projective and examples with non-projective universal cover.

We prove that, for fixed n there exist only finitely many embeddings of Q-factorial toric varieties X into P^n that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d…

This is the less official, English version of the proof of the fact that every closed atoroidal 3-manifold carries finitely many isotopy classes of tight contact structures.

The $\pi_2$-diffeomorphism finiteness result (\cite{FR1,2}, \cite{PT}) asserts that the diffeomorphic types of compact $n$-manifolds $M$ with vanishing first and second homotopy groups can be bounded above in terms of $n$, and upper bounds…

In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs…

We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

We show that on any translation surface, if a regular point is contained in a simple closed geodesic, then it is contained in infinitely many simple closed geodesics, whose directions are dense in the unit circle. Moreover, the set of…

Let $\Sigma_{g,n}$ be the orientable genus $g$ surface with $n$ punctures, where $2-2g-n<0$. Let $$\rho: \pi_1(\Sigma_{g,n})\to GL_m(\mathbb{C})$$ be a representation. Suppose that for each finite covering map $f: \Sigma_{g', n'}\to…

In this paper we consider completed coverings that are branched coverings in the sense of Fox. For completed coverings between PL manifolds we give a characterization of the existence of a monodromy representation and the existence of a…

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

We prove that any finitely generated one ended group has linear end depth. Moreover, we give alternative proofs to theorems relating the growth of a finitely generated group to the number of its ends.

We propose a new contact relation between polytopes. Intuitively, we say that two polytopes are in strong contact if a small enough object can pass from one of them to the other while remaining in their union. In the first half of the paper…

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

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…