Related papers: Fat 4-polytopes and fatter 3-spheres

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

We investigate the orbit space of the scalar potential of a $\Delta(54)$-symmetric three-Higgs-doublet model. We find that, if the potential enjoys $CP$ invariance, then its three-dimensional orbit space is a polytope; if the potential has…

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Let $p$ and $q$ be anisotropic quadratic forms over a field $F$ of characteristic $\neq 2$, let $s$ be the unique non-negative integer such that $2^s < \mathrm{dim}(p) \leq 2^{s+1}$, and let $k$ denote the dimension of the anisotropic part…

For $i= 1,2$, let $G_i$ be cocompact groups of isometries of hyperbolic space $\Hyp^n$ of real dimension $n$, $n \geq 3$. Let $H_i \subset G_i$ be infinite index quasiconvex subgroups satisfying one of the following conditions: 1) limit set…

In complex dynamics, the boundaries of higher dimensional hyperbolic components in holomorphic families of polynomials or rational maps are mysterious objects, whose topological and analytic properties are fundamental problems. In this…

A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

We discuss the Euclidean limit of hyperbolic SU(2)-monopoles, framed at infinity, from the point of view of pluricomplex geometry. More generally, we discuss the geometry of hypercomplex manifolds arising as limits of pluricomplex…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

The aim of this paper is to provide some new tools to aid the study of decomposition complexity, a notion introduced by Guentner, Tessera and Yu. In this paper, three equivalent definitions for decomposition complexity are established. We…

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

We construct infinite families of abstract regular polytopes of type $\{4,p_1,\ldots,p_{n-1}\}$ from extensions of centrally symmetric spherical abstract regular $n$-polytopes. In addition, by applying the halving operation, we obtain…

In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that…

Abstract polytopes are a combinatorial generalization of convex and skeletal polytopes. Counting how many flag orbits a polytope has under its automorphism group is a way of measuring how symmetric it is. Polytopes with one flag orbit are…

We show there exist polynomial bounds on torsion of elliptic curves which come from a fixed geometric isogeny class. More precisely, for an elliptic curve $E_0$ defined over a number field $F_0$, for each $\epsilon>0$ there exist constants…

In this paper, we develop a theory on the degenerations of Blaschke products $\mathcal{B}_d$ to study the boundaries of hyperbolic components. We give a combinatorial classification of geometrically finite polynomials on the boundary of the…

We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…

A set $\mathcal{S}$ of points in $\mathbb{R}^n$ is called a rationally parameterisable hypersurface if $\mathcal{S}=\{\boldsymbol{\sigma}(\mathbf{t}): \mathbf{t} \in D\}$, where $\boldsymbol{\sigma}: \mathbb{R}^{n-1} \rightarrow…

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…