Related papers: Arithmetic non-very generic arrangements

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

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.…

In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…

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…

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making…

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, 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…

Let $\mathcal A\subset\mathbb P^{k-1}$ be a rank $k$ arrangement of $n$ hyperplanes, with the property that any $k$ of the defining linear forms are linearly independent (i.e., $\mathcal A$ is called $k-$generic). We show that for any…

Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…

The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

Hetyei recently introduced a hyperplane arrangement (called the homogenized Linial arrangement) and used the finite field method of Athanasiadis to show that its number of regions is a median Genocchi number. These numbers count a class of…

Non-idempotent intersection types provide quantitative information about typed programs, and have been used to obtain time and space complexity measures. Intersection type systems characterize termination, so restrictions need to be made in…

We study the nonresonance phenomenon for complex rank-one local systems on complements of hyperplane arrangements. We refine the method of Cohen, Dimca, and Orlik and obtain a combinatorial sufficient condition for nonresonance. As an…

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…