Related papers: Non-very generic arrangements in low dimension

In 1985 Crapo introduced in \cite{Crapo} a new mathematical object that he called $\textit{geometry of circuits}$. Four years later, in 1989, Manin and Schechtman defined in \cite{MS} the same object and called it $\textit{discriminantal…

A discriminantal hyperplane arrangement B(n,k,A) is constructed from a given (generic) hyperplane arrangement A, which is classified as either very generic or non-very generic depending on the combinatorial structure of B(n,k,A). In…

Manin and Schechtman introduced a family of arrangements of hyperplanes generalizing classical braid arrangements, which they called the $\textit{discriminantal arrangements}$. Athanasiadis proved a conjecture by Bayer and Brandt providing…

In 1989 Manin and Schechtman defined the discriminantal arrangement $\mathcal{B}(n, k,\mathcal{A})$ associated to a generic arrangement $\mathcal{A}$ of $n$ hyperplanes in a $k$-dimensional space. An equivalent notion was already introduced…

The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…

In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement…

We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…

We show that points in specific degree 2 hypersurfaces in the Grassmannian $Gr(3, n)$ correspond to generic arrangements of $n$ hyperplanes in $\mathbb{C}^3$ with associated discriminantal arrangement having intersections of multiplicity…

We study enumerative questions on the moduli space $\mathcal{M}(L)$ of hyperplane arrangements with a given intersection lattice $L$. Mn\"ev's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it…

We give an explicit description of the multiplicities of codimension two strata of discriminantal arrangements introduced by Manin and Schechtman. As applications, we discuss the connection of these results with properties of Gale transform…

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

The fundamental group of the complement of a hyperplane arrangement in a complex vector space is an important topological invariant. The third rank of successive quotients in the lower central series of the fundamental group was called Falk…

In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

A method for dimension reduction with clustering, classification, or discriminant analysis is introduced. This mixture model-based approach is based on fitting generalized hyperbolic mixtures on a reduced subspace within the paradigm of…

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…

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…