English
Related papers

Related papers: Finite Polytopes have Finite Regular Covers

200 papers

Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…

Combinatorics · Mathematics 2026-04-02 Isabel Hubard , Egon Schulte

We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.

Commutative Algebra · Mathematics 2016-03-29 Mircea Cimpoeas

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

Combinatorics · Mathematics 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter

We study the homeomorphism types of certain covers of (always orientable) surfaces, usually of infinite-type. We show that every surface with non-abelian fundamental group is covered by every noncompact surface, we identify the universal…

Geometric Topology · Mathematics 2025-08-05 Ian Biringer , Yassin Chandran , Tommaso Cremaschi , Jing Tao , Nicholas G. Vlamis , Mujie Wang , Brandis Whitfield

For any given finite group, Schulte and Williams (2015) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the…

Combinatorics · Mathematics 2017-09-18 Jean-Paul Doignon

In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.

Algebraic Topology · Mathematics 2010-12-09 Behrooz Mashayekhy , Hanieh Mirebrahimi

We prove that there is a one-one correspondence between sets of irreducible representations of a polyadic group and its Post's cover. Using this correspondence, we generalize some well-known properties of irreducible characters in finite…

Representation Theory · Mathematics 2010-11-04 Mohammad Shahryari

We prove that for $n>3$ each generic simple polytope in $\mathbb{R}^n$ contains a point with at least $2n+4$ emanating normals to the boundary. This result is a piecewise-linear counterpart of a long-standing problem about normals to smooth…

Metric Geometry · Mathematics 2026-01-13 Ivan Nasonov , Gaiane Panina

Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.

Algebraic Geometry · Mathematics 2007-05-23 Nguyen Quang Loc , Grzegorz Zwara

We augment the list of finite universal locally toroidal regular polytopes of type {3,3,4,3,3} due to P.McMullen and E.Schulte, adding as well as removing entries. This disproves a related long-standing conjecture. Our new universal…

Group Theory · Mathematics 2017-07-05 Dmitrii V. Pasechnik

A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…

Quantum Physics · Physics 2007-05-23 Ingemar Bengtsson , Asa Ericsson

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Michael Joswig

An integral quadratic form is called strictly $n$-regular if it primitively represents all quadratic forms in $n$ variables that are primitively represented by its genus. For any $n \geq 2$, it will be shown that there are only finitely…

Number Theory · Mathematics 2017-06-14 Wai Kiu Chan , Alicia Marino

We define the compact universal cover of a compact, metrizable connected space (i.e. a continuum) X to be the inverse limit of all continua that regularly cover X. We show that such covers do indeed form an inverse system with bonding maps…

Algebraic Topology · Mathematics 2022-09-07 Conrad Plaut

For $m=2$ and $m=3$ we prove that any connected, oriented, open manifold $M^m$ admits a simple branched covering map over $\mathbb{R}^m$. When $M$ has $k$ ends and $k$ is finite, the degree of the cover can be taken to be $mk$. Regardless…

Geometric Topology · Mathematics 2025-12-10 Mark Hughes , Alexandra Kjuchukova , Maggie Miller

We construct explicitly a finite cover of the moduli stack of compact Riemann surfaces with a given group of symmetries by a smooth quasi-projective variety.

Algebraic Geometry · Mathematics 2021-04-06 Fabio Perroni

Let P be a d-dimensional lattice polytope. We show that there exists a natural number c_d, only depending on d, such that the multiples cP have a unimodular cover for every natural number c >= c_d. Actually, a subexponential upper bound for…

Combinatorics · Mathematics 2007-05-23 Winfried Bruns , Joseph Gubeladze

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

Combinatorics · Mathematics 2024-05-08 Khanh Nguyen Duc , Nguyen Thi Ngoc Giao , Dang Tuan Hiep , Do Le Hai Thuy

The isometry group of a compact n-dimensional hyperbolic manifold is known to be finite. We show that for every n > 2, every finite group is realized as the full isometry group of some compact hyperbolic n-manifold. The cases n = 2 and n =…

Group Theory · Mathematics 2009-11-10 M. Belolipetsky , A. Lubotzky

In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…

Computational Geometry · Computer Science 2019-08-07 Michael G. Dobbins , Andreas Holmsen , Tillmann Miltzow