Related papers: Generalized threshold arrangements

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…

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…

Characteristic quasi-polynomials enumerate the number of points in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic quasi-polynomials of the restrictions of the Shi…

For a reduced hyperplane arrangement we prove the analytic Twisted Logarithmic Comparison Theorem, subject to mild combinatorial arithmetic conditions on the weights defining the twist. This gives a quasi-isomorphism between the twisted…

Kamiya, Takemura, and Terao initiated the theory of the characteristic quasi-polynomial of an integral arrangement, which is a function counting the elements in the complement of the arrangement modulo positive integers. They gave a period…

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…

Let $H$ be an arbitrary family of hyper-planes in $d$-dimensions. We show that the point-location problem for $H$ can be solved by a linear decision tree that only uses a special type of queries called \emph{generalized comparison queries}.…

For $p$ prime, let $\mathcal{H}^n$ be the linear span of characteristic functions of hyperplanes in $(\mathbb{Z}/p^k\mathbb{Z})^n$. We establish new upper bounds on the dimension of $\mathcal{H}^n$ over $\mathbb{Z}/p\mathbb{Z}$, or…

A new relation between a class of complex polynomials with a good behavior at infinity studied by A. N\'emethi and A. Zaharia and the cohomology groups of affine complex hyperplane arrangement complements with rank one local system…

A barred preferential arrangement is a preferential arrangement, onto which in-between the blocks of the preferential arrangement a number of identical bars are inserted. We offer a generalisation of barred preferential arrangements by…

The \emph{Shi arrangement} is the set of all hyperplanes in $\mathbb R^n$ of the form $x_j - x_k = 0$ or $1$ for $1 \le j < k \le n$. Shi observed in 1986 that the number of regions (i.e., connected components of the complement) of this…

We compute the periods associated with a special class of hyperplane arrangements. In particular, we exhibit a combinatorial condition on the intersection lattice of a hyperplane arrangement that ensures that its associated periods are…

We obtain a novel formula for characteristic polynomials of deformations of the Braid arrangement using the notion of levels of regions. As an application, we recover and strengthen results of Chen et al. on the characteristic polynomial of…

We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…

In this paper, we introduce an equivariant version of the characteristic quasi-polynomials as the permutation characters on the complement of mod $q$ hyperplane arrangements. We prove that the permutation character is a quasi-polynomial in…

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…

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…

Determining the number of pieces after cutting a cake is a classical problem. Roberts (1887) provided an exact solution by computing the number of chambers contained in a plane cut by lines. About 88 years later, Zaslavsky (1975) even…

We define arrangements of codimension-1 submanifolds in a smooth manifold which generalize arrangements of hyperplanes. When these submanifolds are removed the manifold breaks up into regions, each of which is homeomorphic to an open disc.…

Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…