Related papers: On regular polytopes of order $2^n$

The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following:…

Given arbitrary integers $d$ and $r$ with $d \geq 4$ and $1 \leq r \leq d + 1$, a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ with ${\rm depth} K[\mathcal{P}] = r$ for which its dual polytope $\mathcal{P}^\vee$ is…

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Let k be a regular F_p-algebra, let A = k[x,y]/(x^b - y^a) be the coordinate ring of a planar cuspical curve, and let I = (x,y) be the ideal that defines the cusp point. We give a formula for the relative K-groups K_q(A,I) in terms of the…

Suppose that a finite group $G$ admits an automorphism $\varphi $ of order $2^n$ such that the fixed-point subgroup $C_G(\varphi ^{2^{n-1}})$ of the involution $\varphi ^{2^{n-1}}$ is nilpotent of class $c$. Let $m=|C_G(\varphi)|$ be the…

We prove the following statement. Let $f\in\mathbb{R}[x_1,\ldots,x_d]$, for some $d\ge 3$, and assume that $f$ depends non-trivially in each of $x_1,\ldots,x_d$. Then one of the following holds. (i) For every finite sets…

We classify the d-dimensional simplicial, terminal, and reflexive polytopes with at least 3d-2 vertices. In particular, it turns out that these are all smooth Fano polytopes. This improves on previous results of Casagrande in 2006 and Oebro…

We prove the following theorem, which is related to McMullen's problem on projective transformations of polytopes; let $2\leq k\leq \lfloor{\frac{d}{2}}\rfloor$ and $\nu{(d, k)}$ be the largest number such that any set of $\nu{(d,k)}$…

For every algebraically closed field $k$ and natural number $r$, we construct several algebraic varieties (over $k$) whose birational automorphism group contains every finite nilpotent group of class at most $2$, rank at most $r$ whose…

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

We study automorphisms of smooth hypersurfaces in projective space $\mathbb{P}^{n+1}$ whose fixed loci have codimension at most two for $n\geq2$. While classifications of possible orders of automorphisms are known, our aim is to explore the…

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…

The rank of a $d$-dimensional polytope $P$ is defined by $F-(d+1)$, where $F$ denotes the number of facets of $P$. In this paper, We focus on the toric rings of $(0,1)$-polytopes with small rank. We study their normality, the…

In this article, we study orientably-regular maps of Euler characteristic $-2p^2$ and classify those that admit a group of orientation-preserving automorphisms of order $10p^2$, where $p$ is a prime number. Along the way, we classify all…

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

Let $E$ be a finite-dimensional real vector space and $M\subseteq E$ be a convex polytope with non-empty interior. We turn the group of all $C^\infty$-diffeomorphisms of $M$ into a regular Lie group.

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Every indefinite binary form occurs as the Picard lattice of some K3-surface. The group of its isometries, or automorphs, coincides with the automorphism group of the K3-surface, but only up to finite groups. The classical theory of…

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…