Related papers: Hyperplane Arrangements with Large Average Diamete…
Let ${\mathcal A}$ be a nonempty real central arrangement of hyperplanes and ${\rm \bf Ch}$ be the set of chambers of ${\mathcal A}$. Each hyperplane $H$ defines a half-space $H^{+} $ and the other half-space $H^{-}$. Let $B = \{+, -\}$.…
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
We show that when $n$ is a power of two, any $nD$ measures in $\mathbb{R}^n$ can be bisected by an arrangement of $D$ hyperplanes.
We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…
A free multiarrangement of rank $k$ is defined to be extendable if it is obtained from a simple rank $(k+1)$ free arrangement by the natural restriction to a hyperplane (in the sense of Ziegler). Not all free multiarrangements are…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…
It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…
We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…
A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…
For a hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. The minimum width…
Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…
There exists a proper holomorphic mapping between balls of different dimensions such that it does not extend continuously to the boundary. The aim of this paper is to show the same phenomenon occurs for pseudoconvex domains of different…
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…
A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…
The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…