Related papers: A Lost Counterexample and a Problem on Illuminated…

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…

The Generalised Baker--Schmidt Problem (1970) concerns the $f$-dimensional Hausdorff measure of the set of $\psi$-approximable points on a nondegenerate manifold. There are two variants of this problem, concerning simultaneous and dual…

We investigate geometric and topological properties of $d$-majorization -- a generalization of classical majorization to positive weight vectors $d \in \mathbb{R}^n$. In particular, we derive a new, simplified characterization of…

In 1998, in the winter issue of the journal Mathematics and Computer education (see [1]), Monte Zerger posed the following problem. He had noticed the Pythagorean triple (216,630,666);(216)^2+(630)^2=(666)^2. Note that 216=6^3 and 666 is…

We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…

In his study of Halperin's toral-rank conjecture, M. R. Hilali conjectured that for any simply connected rationally elliptic space $X$, one must have $dim\pi_*(X)\otimes \mathbb{Q} \leq dimH^*(X,\mathbb{Q})$. Let $(\Lambda V, d)$ denote a…

We show that there exist reduced polytopes in three-dimensional Euclidean space. This partially answers the question posed by Lassak on the existence of reduced polytopes in $d$-dimensional Euclidean space for $d\geq 3$. Moreover, we prove…

Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatorial diameters. The main open problem in this area is the…

We provide counterexamples to several conjectures concerning strongly maximal and strongly minimal structures in infinite graphs and hypergraphs. In particular, we construct 3-uniform hypergraphs without strongly maximal matchings and…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

We show that Wall's D(2) problem, the Realization problem and the Relation Gap problem could all be solved if it could be shown that the deficiency of a certain group is, as intuition would suggest, less than -1. Note the paper has been…

We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…

Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

In this paper, we introduce an $m$-fold illumination number $I^m(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$, which is the smallest number of directions required to $m$-fold illuminate $K$, i.e., each point on the boundary 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…