Related papers: A linear condition for non-very generic discrimina…

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…

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

The discriminantal arrangement $\mathcal{B}(n,k,\mathcal{A})$ has been introduced by Manin and Schectman in 1989 and it consists of all non-generic translates of a generic arrangement $\mathcal{A}$ of n hyperplanes in a $k$-dimensional…

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

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…

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…

A hyperplane arrangement is called formal provided all linear dependencies among the defining forms of the hyperplanes are generated by ones corresponding to intersections of codimension two. The significance of this notion stems from the…

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…

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…

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…

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

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…

An embedding of the complete bipartite graph $K_{3,3}$ in $\mathbb{P}^2$ gives rise to both a line arrangement and a bar-and-joint framework. For a generic placement of the six vertices, the graded Betti numbers of the logarithmic module of…

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…

In this paper we study Cynk-Szemberg octic hyperplane arrangements from the perspective of homological properties of their derivation modules. In particular, we define the notion of the type of hyperplane arrangements that will be used in…

In the present note we focus on conic line arrangements in the plane with quasihomogeneous ordinary singularities from the perspective of weak Ziegler pairs. The foundations of this article come from an active area of research devoted to…