ترغب بنشر مسار تعليمي؟ اضغط هنا

Congruence Normality of Simplicial Hyperplane Arrangements via Oriented Matroids

192   0   0.0 ( 0 )
 نشر من قبل Sophia Elia
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

A catalogue of simplicial hyperplane arrangements was first given by Grunbaum in 1971. These arrangements naturally generalize finite Coxeter arrangements and the weak order through the poset of regions. For simplicial arrangements, posets of regions are in fact lattices. We update Grunbaums catalogue, providing normals and invariants for all known sporadic simplicial arrangements with up to 37 lines. The weak order is known to be congruence normal, and congruence normality for simplicial arrangements can be determined using polyhedral cones called shards. In this article, we provide additional structure to the catalogue of simplicial hyperplane arrangements by determining which arrangements always/sometimes/never lead to congruence normal lattices of regions. To this end, we use oriented matroids to recast shards as covectors to determine congruence normality of large hyperplane arrangements. As a consequence of this approach we derive in particular which lattices of regions of sporadic simplicial arrangements of rank 3 are always congruence normal. We also show that lattices of regions from finite Weyl groupoids of any rank are congruence normal.



قيم البحث

اقرأ أيضاً

131 - Jaeho Shin 2019
There is a trinity relationship between hyperplane arrangements, matroids and convex polytopes. We expand it as resolving the complexity issue expected by Mnevs universality theorem and conduct combinatorializing so the theory over fields becomes rea lization of our combinatorial theory. A main theorem is that for n less than or equal to 9 a specific and general enough kind of matroid tilings in the hypersimplex Delta(3,n) extend to matroid subdivisions of Delta(3,n) with the bound n=9 sharp. As a straightforward application to realizable cases, we solve an open problem in algebraic geometry proposed in 2008.
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 $sigma$-Grobner b ases. Moreover, we prove that the Teraos conjecture over finite fields implies the conjecture over the rationals.
We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of Lawrence matroid polytopes. Our resolution provides a cellular realization of Stanleys formula for their Betti numbers. For unimodular matroids our resolutions are related to hyperplane arrangements on tori, and we recover the resolutions constructed by Bayer, Popescu and Sturmfels. We resolve the combinatorial problems posed in their paper by computing Mobius invariants of graphic and cographic arrangements in terms of Hermite polynomials.
In this article, we study the weak and strong Lefschetz properties, and the related notion of almost revlex ideal, in the non-Artinian case, proving that several results known in the Artinian case hold also in this more general setting. We then apply the obtained results to the study of the Jacobian algebra of hyperplane arrangements.
67 - Takuro Abe 2017
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 and necessar y condition for the deletion theorem in terms of characteristic polynomials. This gives a lot of corollaries including the existence of free filtrations. The proof is based on the result about the form of minimal generators of a logarithmic derivation module of a multiarrangement which satisfies the $b_2$-equality.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا