On the non-very generic intersections in discriminantal arrangements

DOI10.5802/CRMATH.360MaRDI QIDQ2080941zbMATH OpenOpenAlexFDO

Authors Simona Settepanella, So Yamagata

Publication date 12 October 2022

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2101.00544

zbMATH Keywords

discriminantal arrangements

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: In 1985 Crapo introduced in cite{Crapo} a new mathematical object that he called $extitgeometryofcircuits$. Four years later, in 1989, Manin and Schechtman defined in cite{MS} the same object and called it $extitdiscriminantalarrangement$, the name by which it is known now a days. Those discriminantal arrangements $mathcalB(n,k,mathcal{A}^0)$ are builded from an arrangement $mathcal{A}^0$ of $n$ hyperplanes in general position in a $k$-dimensional space and their combinatorics depends on the arrangement $mathcal{A}^0$. On this basis, in 1997 Bayer and Brandt (see cite{BB}) distinguished two different type of arrangements $mathcal{A}^0$ calling $extitverygeneric$ the ones for which the intersection lattice of $mathcalB(n,k,mathcal{A}^0)$ has maximum cardinality and $extitnon-verygeneric$ the others. Results on the combinatorics of $mathcalB(n,k,mathcal{A}^0)$ in the very generic case already appear in Crapo cite{Crapo} and in 1997 in Athanasiadis cite{Atha} while the first known result on non-very generic case is due to Libgober and the first author in 2018. In their paper cite{LS} they provided a necessary and sufficient condition on $mathcal{A}^0$ for which the cardinality of rank 2 intersections in $mathcalB(n,k,mathcal{A}^0)$ is not maximal anymore. In this paper we further develop their result providing a sufficient condition on $mathcal{A}^0$ for which the cardinality of rank r, $rgeq2$, intersections in $mathcalB(n,k,mathcal{A}^0)$ decreases.

Recommendations

• A classification of combinatorial types of discriminantal arrangements
• The largest intersection lattice of a discriminantal arrangement
• A Note on Discriminantal Arrangements
• On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points
• Strata of discriminantal arrangements

Cites work

• A Note on Discriminantal Arrangements
• Braided monoidal 2-categories and Manin-Schechtman higher braid groups
• Discriminantal arrangement, \(3{\times}3\) minors of Plücker matrix and hypersurfaces in Grassmannian \(\mathrm{Gr}(3, n)\)
• Discriminantal arrangements, fiber polytopes and formality
• Divisorial cohomology vanishing on toric varieties
• Free \(n\)-category generated by a cube, oriented matroids, and higher Bruhat orders
• Higher Bruhat orders and cyclic hyperplane arrangements
• scientific article; zbMATH DE number 4190548 (Why is no real title available?)
• scientific article; zbMATH DE number 3953697 (Why is no real title available?)
• scientific article; zbMATH DE number 16339 (Why is no real title available?)
• scientific article; zbMATH DE number 29045 (Why is no real title available?)
• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• scientific article; zbMATH DE number 967405 (Why is no real title available?)
• Integrable connections related to Manin and Schechtman's higher braid groups
• Pappus's Theorem in Grassmannian Gr(3, ℂ^n)
• Strata of discriminantal arrangements
• The largest intersection lattice of a discriminantal arrangement
• Zonotopes associated with higher Bruhat orders

Cited in

(13)

• Discriminantal arrangements, fiber polytopes and formality
• The largest intersection lattice of a discriminantal arrangement
• On intersection lattices of hyperplane arrangements generated by generic points
• Likelihood degenerations
• On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points
• A Note on Discriminantal Arrangements
• Strata of discriminantal arrangements
• A classification of combinatorial types of discriminantal arrangements
• The generalized Sylvester's and orchard problems via discriminantal arrangement
• Arithmetic non-very generic arrangements
• Degeneration in discriminantal arrangements
• A linear condition for non-very generic discriminantal arrangements
• Non-very generic arrangements in low dimension

This page was built for publication: On the non-very generic intersections in discriminantal arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2080941)