相关论文: On the non-very generic intersections in discrimin…
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…
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,…
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 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…
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…
The study of intersection problems in Extremal Combinatorics dates back perhaps to 1938, when Paul Erd\H{o}s, Chao Ko and Richard Rado proved the (first) `Erd\H{o}s-Ko-Rado theorem' on the maximum possible size of an intersecting family of…
The nonelliptic $\mathsf{A_2}$-webs with $k$ "$+$"s on the top boundary and $3n-2k$ "$-$"s on the bottom boundary combinatorially model the space $\mathsf{Hom}_{\mathfrak{sl}_3}(\mathsf{V}^{\otimes (3n-2k)}, \mathsf{V}^{\otimes k})$ of…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
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…
Higher order free moments and cumulants, introduced by Collins, Mingo, \'Sniady and Speicher in 2006, describe the fluctuations of unitarily invariant random matrices in the limit of infinite size. The functional relations between their…
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 prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…
The notion of cross intersecting set pair system of size $m$, $\Big(\{A_i\}_{i=1}^m, \{B_i\}_{i=1}^m\Big)$ with $A_i\cap B_i=\emptyset$ and $A_i\cap B_j\ne\emptyset$, was introduced by Bollob\'as and it became an important tool of extremal…
We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…
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…
Schemes defined by residual intersections have been extensively studied in the case when they are Cohen-Macaulay, but this is a very restrictive condition. In this paper we make the first study of a class of natural examples far from…
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generated complex reflection group, the noncrossing partition lattice NCP_W of type W is a very rich combinatorial object, extending the notion of…