Related papers: Borsuk and V\'azsonyi problems through Reuleaux po…

We prove that if all intersections of a convex body $B\subset\mathbb R^4$ with 3-dimensional linear subspaces are linearly equivalent then $B$ is a centered ellipsoid. This gives an affirmative answer to the case $n=3$ of the following…

A Besicovitch set is a subset of $\R^d$ that contains a unit line segment in every direction and the famous Kakeya conjecture states that Besicovitch sets should have full dimension. We provide a number of results in support of this…

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

For given positive integers $r\ge 3$, $n$ and $e\le \binom{n}{2}$, the famous Erd\H os--Rademacher problem asks for the minimum number of $r$-cliques in a graph with $n$ vertices and $e$ edges. A conjecture of Lov\'asz and Simonovits from…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…

We call a polytope P of dimension 3 admissible if it has the following two properties: (1) for each vertex of P the set of its first-neighbours is coplanar; (2) all planes determined by the first-neighbours are distinct. It is shown that…

A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

The geometry of causal diamonds or Alexandrov open sets whose initial and final events $p$ and $q$ respectively have a proper-time separation $\tau$ small compared with the curvature scale is a universal. The corrections from flat space are…

We introduce the concept of $r$-equilateral $m$-gons. We prove the existence of $r$-equilateral $p$-gons in $\mathbb R^d$ if $r<d$ and the existence of equilateral $p$-gons in the image of continuous injective maps $f:S^d\to \mathbb…

We study the resonant prescribed T-curvature problem on a compact 4-dimensional Riemannian manifold with boundary. We derive sharp energy and gradient estimates of the associated Euler-Lagrange functional to characterize the critical points…

Using equivariant obstruction theory we construct equivariant maps from certain classifying spaces to representation spheres for cyclic groups, product of elementary Abelian groups and dihedral groups. Restricting them to finite skeleta…

We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…

A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that any diameter-2-critical graph of order n has at most…

Bollob\'as and Riordan, in their paper "Metrics for sparse graphs," proposed a number of provocative conjectures extending central results of quasirandom graphs and graph limits to sparse graphs. We refute these conjectures by exhibiting a…

In the book 'Quadratic algebras' by Polishchuk and Positselski [23] algebras with a small number of generators (n=2,3) are considered. For some number r of relations possible Hilbert series are listed, and those appearing as series of…

Corsten and Frankl conjectured that a simplex is diameter-Ramsey if and only if its circumcenter lies in its convex hull. We disprove this conjecture in every dimension $d\ge 3$. The main tool is a sufficient criterion based on a…