Questions tagged [hyperplane-arrangements]

A hyperplane arrangement is a set of hyperplanes in a vector space or in a projective space. The complement of the union of these hyperplanes defines an algebraic variety, with interesting geometry and topology.

Filter by
Sorted by
Tagged with
1 vote
1 answer
152 views

Affine Hyperplane Arrangements in $\mathbb R^d$

Consider $\mathcal A=(u_i)_{i=1}^m $ to be a set of hyperplanes in $\mathbb R^d$, such that for every $1\leq i \leq m$: $u_i \in \mathbb R^d$. These hyperplanes are disconnecting $\mathbb R^d$ to ...
AvidLearner's user avatar
3 votes
2 answers
599 views

Counting Regions in Hyperplane Arranglements

Consider the following: 1) How many connected regions can $n$ hyperplanes form in $\mathbb R^d$? 2) What if the set of hyperplanes are homogeneous? 3) Given a set of $n$ pairs of ...
AvidLearner's user avatar
1 vote
0 answers
72 views

Is there any notion of a slack-matrix (and its rank) for a hyperplane arrangement?

I am assuming that the common lineality space of the hyperplane arrangement has already been factored out. So we are looking at an ``effective" arrangement in lower dimensions where all the polyhedra ...
gradstudent's user avatar
  • 2,136
1 vote
2 answers
339 views

Chambers of central hyperplane arrangements

Let $\mathcal{A}$ be a central hyperplane arrangement in a (finite dimensional) real vector space $V$. Assume for each hyperplane $H\in\mathcal{A}$ that we're given a labelling $H^+$, $H^-$ of the ...
Avi Steiner's user avatar
  • 3,031
20 votes
2 answers
891 views

Counting problems where unlabeled is easier than labeled

I was encouraged to post this question by Jim Propp during a meeting of the Cambridge Combinatorics and Coffee Club. It is a counterpoint to the MathOverflow question "Counting Problems where Labeled ...
Sam Hopkins's user avatar
  • 22.7k
1 vote
0 answers
99 views

Characterizing normal vectors of affinely independent subsets of the hypercube

Suppose we are looking at the hypercube in $\mathbb{R}^n$. I tend to the think of the cube with vertex coordinates 0 or 1, but maybe this is easier for the $\pm1$ cube. Now suppose we have an affine ...
batconjurer's user avatar
12 votes
1 answer
1k views

Maximal Number of Pairs of Orthogonal vectors in a set of $n$ vectors in $\mathbb{R}^3$

Suppose you are given a set of $n$ non-zero vectors in $\mathbb{R}^3$. What is the maximum number of pairs of them that are orthogonal? The current guess is $\le 2n$. EDIT: I forgot to add that no ...
batconjurer's user avatar
9 votes
2 answers
763 views

Open problems in hyperplane/subspace arrangements?

What are some open problems in hyperplane/subspace arrangements, preferably of the combinatorial algebraic topology kind, and where can one read about them? That is, where are they discussed, and ...
2 votes
0 answers
249 views

Volume of bounded regions in hyperplane arrangements

I am given a hyperplane arrangement $\mathcal{H}_0$ in $\mathbb{R}^n$ and a function $\phi \colon \mathbb{R}^n \to \mathbb{Q}.$ I choose any enumeration on the set of primitive vectors (i.e. vectors ...
cata's user avatar
  • 337
5 votes
1 answer
592 views

Number of regions of a hyperplane arrangement avoiding a generic hyperplane

Let $\mathcal{A}$ be an essential arrangement of hyperplanes in $\mathbb{R}^n$. Zaslavsky's theorem says that the number of regions of $\mathcal{A}$ is given by $r(\mathcal{A})=(-1)^n\chi_{\mathcal{A}}...
Sam Hopkins's user avatar
  • 22.7k
3 votes
3 answers
282 views

Characterizing orthants with polynomials

Let $x=(x_1,\ldots,x_n)\in\mathbb{R}^n$. Can one find a polynomial $p$ (of arbitrary degree) in the coordinates of $x$ such that $p(x)\geq 0$ if and only if $x$ is an element of the positive orthant $\...
fact's user avatar
  • 133
1 vote
0 answers
72 views

What are / could be the applications of Delaunay oriented matroids?

The Delaunay oriented matroid is studied in detail by F. Santos (actually this paper is more general). For a set of points $S$ (in any dimension), let $C$ be a sphere, $C^+$ be its interior, $C^-$ be ...
Hao Chen's user avatar
  • 2,541
0 votes
1 answer
182 views

help with cohomology of $\mathbb{P}^n$ relative to a NCD

Let $H_0, \ldots, H_n$ be $n$ hyperplanes in $\mathbb{P}^n(\mathbb{C})$ with normal crossings and denote by $H$ the union of them. I am trying to understand why (1) $H^n(\mathbb{P}^n(\mathbb{C}), H)$...
hyper95's user avatar
5 votes
0 answers
227 views

Tensor product of hyperplane arrangements

Let $(A_{1},V_{1})$ and $(A_{2},V_{2})$ be two central hyperplane arrangements, which 0 belongs to their intersections. Let $V=V_{1}\otimes V_{2}$. Define the tensor product arrangement $(A_{1}\otimes ...
Moh514's user avatar
  • 451
45 votes
0 answers
909 views

Extending a line-arrangement so that the bounded components of its complement are triangles

Given a finite collection of lines $L_1,\dots,L_m$ in ${\bf{R}}^2$, let $R_1,\dots,R_n$ be the connected components of ${\bf{R}}^2 \setminus (L_1 \cup \dots \cup L_m)$, and say that $\{L_1,\dots,L_m\}...
James Propp's user avatar
  • 19.4k
2 votes
0 answers
64 views

How many regions are created by the set of all hyperplanes defined by a set of points?

If we have a set of points X in d-dimensional euclidean space, and we look at the set of all hyperplanes that are defined by any subset Y of X (in the sense of being the unique hyperplane containing ...
capybaralet's user avatar
6 votes
2 answers
294 views

Functionals on oriented matroids

Oriented matroids are abstractions of hyperplane arrangements, or equivalently vector configurations. Let me recall the definition in terms of covectors. Let $R=\lbrace 0,+,-\rbrace$ with the monoid ...
Benjamin Steinberg's user avatar
3 votes
2 answers
2k views

Is there a characterization of hyperplane arrangement intersection posets?

For a hyperplane arrangement $\mathcal{A}$ over a vector space $V$, we define its intersection poset, $L(\mathcal{A})$, as the set of all nonempty intersections of hyperplanes in $\mathcal{A}$ ordered ...
Sam Hopkins's user avatar
  • 22.7k
4 votes
3 answers
328 views

lines through A_n reflection arrangement and permutations

(updated; apologies for way too much room left for interpretation in the original post) Let $\mathcal{A} =A_{n-1}$ be the $A_{n-1}$ arrangement in $\mathbb{R}^{n}$, i.e. the set of hyperplanes $H_{ij}...
Dima Pasechnik's user avatar
5 votes
1 answer
302 views

Hyperplane arrangements and covering numbers

Let $H$ be a set of $(d-1)$-dimensional hyperplanes in $\mathbb{R}^d$. For each hyperplane $h \in H$ let $D(h)$ and $\bar{D}(h)$ be the corresponding half spaces of $\mathbb{R}^d$. For a point $x \...
Robby McKilliam's user avatar
1 vote
0 answers
512 views

Maximal disjoint hyperplanes

Assume a set of $n^{r}$ points $X_{r} = \{ x_{1}, \cdots, x_{n^{r}} \}$ is given occupying a codimension $t^{r}$ subspace in $\mathbb{R}^{n^{r}}$. Let $M_{r}$ be the set of $t^{r}$-tuples of these ...
user16007's user avatar
  • 780
18 votes
1 answer
1k views

A natural refinement of the $A_n$ arrangement is to consider all $2^n-1$ hyperplanes given by the sums of the coordinate functions. Have you seen this arrangement? Is it completely intractable?

The short version Here is an extremely natural hyperplane arrangement in $\mathbb{R}^n$, which I will call $R_n$ for resonance arrangement. Let $x_i$ be the standard coordinates on $\mathbb{R}^n$. For ...
Paul Johnson's user avatar
  • 2,362
6 votes
0 answers
273 views

balls in arrangements of hyperplanes

The following theorem is from Aronov, Naiman, Pach and Sharir's An invariant property of balls in arrangements of hyperplanes. I would like to state them and then ask if any related problem/theorem ...
Thomas Z's user avatar
1 vote
2 answers
169 views

How does one map regression depth to undirected depth of a point?

The regression depth of a line is the minimum number of points it has to cross to take it from its initial position to vertical. The undirected depth of a point is the minimum number of lines a ray ...
Umar Sheikh's user avatar
4 votes
1 answer
262 views

Criterion for being a simple vector

1) I was wondering if there exists a criterion (of (a) combinatorial or (b) geometric nature) for a sum of simple vectors $V\in\wedge^k(\mathbb R^n)$, $V=e_{a_{11}}\wedge\cdots\wedge e_{a_{1k}} + \...
Mircea's user avatar
  • 2,031
16 votes
1 answer
912 views

Coxeter Arrangements and an Identity

Let $\{A_i\}$ be a collection of $m$ hyperplanes in $\mathbb{C}^n$ which all pass through the origin (a central hyperplane arrangement). Such an arrangement is called Coxeter if reflecting across any ...
Greg Muller's user avatar
  • 12.7k
12 votes
0 answers
579 views

Pencils with many completely decomposable fibers

Let $F= \frac{G}{H} : \mathbb P^n \to \mathbb P^1$ be a non-constant rational function ($G$ and $H$ homogenous polynomials of the same degree in $\mathbb C^{n+1})$. The fiber over $(\lambda:\mu) \in ...
Jorge Vitório Pereira's user avatar

1
2