Related papers: Hyperplane Arrangements with Large Average Diamete…

For every 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$. We prove that…

We show a combinatorial formula for a lower bound of the dimension of the non-unipotent monodromy part of the first Milnor cohomology of a hyperplane arrangement satisfying some combinatorial conditions. This gives exactly its dimension if…

Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…

Planar posets can have arbitrarily large dimension. However, a planar poset of height $h$ has dimension at most $192h+96$, while a planar poset with $t$ minimal elements has dimension at most $2t+1$. In particular, a planar poset with a…

Erd\H{o}s asked what is the maximum number $\alpha(n)$ such that every set of $n$ points in the plane with no four on a line contains $\alpha(n)$ points in general position. We consider variants of this question for $d$-dimensional point…

The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that…

We prove that for any finite real hyperplane arrangement the average projection volumes of the maximal cones is given by the coefficients of the characteristic polynomial of the arrangement. This settles the conjecture of Drton and Klivans…

Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

An arrangement of hyperplanes is called formal, if the relations between the hyperplanes are generated by relations in codimension 2. Formality is not a combinatorial property, raising the question for a characterization for combinatorial…

We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…

An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…

The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes which has all non-zero $0/1$-vectors in $\mathbb{R}^n$ as normal vectors. It is the adjoint of the Braid arrangement and is also called the all-subsets arrangement.…

We show there is an upper bound on the diameter of a closed, hyperbolic 3-manifold in terms of the length of any presentation of its fundamental group.

We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…

We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

We conjecture that for every dimension n not equal 3 there exists a noncompact hyperbolic n-manifold whose volume is smaller than the volume of any compact hyperbolic n-manifold. For dimensions n at most 4 and n=6 this conjecture follows…

We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for…

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…