English
Related papers

Related papers: Tight orientably-regular polytopes

200 papers

We address the problem about under what conditions an endomorphism having a dense orbit, verifies that a sufficiently close perturbed map also exhibits a dense orbit. In this direction, we give sufficient conditions, that cover a large…

Dynamical Systems · Mathematics 2012-03-20 Cristina Lizana , Enrique Pujals

We answer a weaker version of the classification problem for the homotopy types of $(n-2)$-connected closed orientable $(2n-1)$-manifolds. Let $n\geq 6$ be an even integer, and $X$ be a $(n-2)$-connected finite orientable Poincar\'e…

Algebraic Topology · Mathematics 2014-06-04 Piotr Beben , Jie Wu

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

Optimization and Control · Mathematics 2022-06-14 Hamza Fawzi

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Combinatorics · Mathematics 2010-11-04 Xavier Allamigeon , Stephane Gaubert , Ricardo D. Katz

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

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

Combinatorics · Mathematics 2012-06-05 H. K. Kim , J. Y. Lee

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

Optimization and Control · Mathematics 2022-11-24 Divya Padmanabhan , Selin Damla Ahipasaoglu , Arjun Ramachandra , Karthik Natarajan

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Dynamical Systems · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert , Bas Lemmens , Roger Nussbaum

In this paper we classify the closed orientable manifolds of arbitrary dimension.

General Mathematics · Mathematics 2007-05-23 Igor Bayak

Equilibrium states of a closed semiflexible polymer binding to a cylinder are described. This may be either by confinement or by constriction. Closed completely bound states are labeled by two integers: the number of oscillations, $n$, and…

Soft Condensed Matter · Physics 2017-11-17 Pablo Vázquez-Montejo , Zachary McDargh , Markus Deserno , Jemal Guven

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Combinatorics · Mathematics 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello

A group of order $p^n$ ($p$ prime) has an indecomposable polynomial invariant of degree at least $p^{n-1}$ if and only if the group has a cyclic subgroup of index at most $p$ or it is isomorphic to one of two particular groups of small…

Group Theory · Mathematics 2018-03-20 Kálmán Cziszter

An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction…

Combinatorics · Mathematics 2012-01-17 Gabe Cunningham

For a positive integer $n$, let $\mathcal T(n)$ be the set of all integers greater than or equal to $n$. An integral quadratic form $f$ is called tight $\mathcal T(n)$-universal if the set of nonzero integers that are represented by $f$ is…

Number Theory · Mathematics 2021-04-07 Mingyu Kim , Byeong-Kweon Oh

In this article, we study closed, positively curved $n$-manifolds that admit an effective, isometric $\mathbb{Z}_p^r$-action with a fixed point, where $p$ is an odd prime. For all sufficiently large $n$, we obtain a symmetry-rank bound in…

Differential Geometry · Mathematics 2026-02-09 Muhammad Abdullah , Catherine Searle

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

Number Theory · Mathematics 2008-12-06 Hongze Li , Hao Pan

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

Combinatorics · Mathematics 2009-01-13 Jaron Treutlein

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…

Consider a logharmonic polynomial; that is, a product of the form $p(z)\overline{q(z)}$, where $p$, $q$ are holomorphic polynomials. Assume $q$ is linear and denote by $n$ the degree of $p$. It was recently shown in arXiv:2302.04339…

Complex Variables · Mathematics 2025-08-15 Kirill Lazebnik , Erik Lundberg

Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all $i\ge 0$: (i) $\exp \Omega_-i(G)\le p^i$ for odd p, and $\exp \Omega_-i(G)\le 2^{i+1}$ for p = 2; (ii) the index $|G:G^{p^i}|$…

Group Theory · Mathematics 2011-08-13 Gustavo A. Fernández-Alcober