Related papers: Tight orientably-regular polytopes

By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices…

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…

Let $n\in\mathbb{N}$ and let $\Theta \subset \{1,\dots,n\}$ be a non-empty subset. We prove that if $\Theta$ contains an odd integer, then any $P_\Theta$-Anosov subgroup of ${\rm Sp}(2n,\mathbb{R})$ is virtually isomorphic to a free group…

In 1970, Coxeter gave a short and elegant geometric proof showing that if $p_1, p_2, \ldots, p_n$ are vertices of an $n$-gon $P$ in cyclic order, then $P$ is affinely regular if, and only if there is some $\lambda \geq 0$ such that…

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

Multiple-choice load balancing has been a topic of intense study since the seminal paper of Azar, Broder, Karlin, and Upfal. Questions in this area can be phrased in terms of orientations of a graph, or more generally a k-uniform random…

A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Let $(M, \om)$ be a symplectic manifold, endowed with a compatible almost complex structure J and the associated metric g . For any p \in {1, 2, ... (dim M)/2} the form $\Om := \frac{\om^p}{p!}$ is a calibration. More generally, dropping…

Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…

An infinitely smooth convex body in $\mathbb R^n$ is called polynomially integrable of degree $N$ if its parallel section functions are polynomials of degree $N$. We prove that the only smooth convex bodies with this property in odd…

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

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…

The group PGL(2) of linear transformations of the projective line acts naturally on the d-dimensional projective space P^d parametrizing configurations (`d-tuples') of points on the line. In this note we are concerned with the orbits of…

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

If $\phi$ is an analytic selfmap of the disk (not an elliptic automorphism) the Denjoy-Wolff Theorem predicts the existence of a point $p$ with $|p|\leq 1$ such that the iterates $\phi_{n}$ converge to $p$ uniformly on compact subsets of…

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms],…

We construct $(P_2)$-closed groups acting on $T_3$ in which all edge inversions have infinite order. This provides a negative answer to a question posed by Tornier. We also construct a family of $(P_2)$-closed groups for which the smallest…

It is proved that if $I$ and $J$ are weakly stable ideals in a polynomial ring $R=k[x_1,\ldots,x_n]$, with $k$ a field, then the regularity of $\text{Tor}^R_i(R/I,R/J)$ has the expected upper bound. We also give a bound for the regularity…