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

Period collapse in characteristic quasi-polynomials of hyperplane arrangements

138   0   0.0 ( 0 )
 نشر من قبل Tan Nhat Tran
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




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

Given an integral hyperplane arrangement, Kamiya-Takemura-Terao (2008 & 2011) introduced the notion of characteristic quasi-polynomial, which enumerates the cardinality of the complement of the arrangement modulo a positive integer. The most popular candidate for period of the characteristic quasi-polynomials is the lcm period. In this paper, we initiate a study of period collapse in characteristic quasi-polynomials stemming from the concept of period collapse in the theory of Ehrhart quasi-polynomials. We say that period collapse occurs in a characteristic quasi-polynomial when the minimum period is strictly less than the lcm period. Our first main result is that in the non-central case, with regard to period collapse anything is possible: period collapse occurs in any dimension $ge 1$, occurs for any value of the lcm period $ge 2$, and the minimum period when it is not the lcm period can be any proper divisor of the lcm period. Our second main result states that in the central case, however, no period collapse is possible in any dimension, that is, the lcm period is always the minimum period.



قيم البحث

اقرأ أيضاً

Let $q$ be a positive integer. In our recent paper, we proved that the cardinality of the complement of an integral arrangement, after the modulo $q$ reduction, is a quasi-polynomial of $q$, which we call the characteristic quasi-polynomial. In this paper, we study general properties of the characteristic quasi-polynomial as well as discuss two important examples: the arrangements of reflecting hyperplanes arising from irreducible root systems and the mid-hyperplane arrangements. In the root system case, we present a beautiful formula for the generating function of the characteristic quasi-polynomial which has been essentially obtained by Ch. Athanasiadis and by A. Blass and B. Sagan. On the other hand, it is hard to find the generating function of the characteristic quasi-polynomial in the mid-hyperplane arrangement case. We determine them when the dimension is less than six.
234 - Takuro Abe 2021
Teraos factorization theorem shows that if an arrangement is free, then its characteristic polynomial factors into the product of linear polynomials over the integer ring. This is not a necessary condition, but there are not so many non-free arrangem ents whose characteristic polynomial factors over the integer ring. On the other hand, the localization of a free arrangement is free, and its restriction is in many cases free, thus its characteristic polynomial factors. In this paper, we consider how their integer, or real roots behave.
A graph whose nodes have degree 1 or 3 is called a ${1,3}$-graph. Liu and Osserman associated a polytope to each ${1,3}$-graph and studied the Ehrhart quasi-polynomials of these polytopes. They showed that the vertices of these polytopes have coordin ates in the set ${0,frac14,frac12,1}$, which implies that the period of their Ehrhart quasi-polynomials is either 1, 2, or 4. We show that the period of the Ehrhart quasi-polynomial of these polytopes is at most 2 if the graph is a tree or a cubic graph, and it is equal to 4 otherwise. In the process of proving this theorem, several interesting combinatorial and geometric properties of these polytopes were uncovered, arising from the structure of their associated graphs. The tools developed here may find other applications in the study of Ehrhart quasi-polynomials and enumeration problems for other polytopes that arise from graphs. Additionally, we have identified some interesting connections with triangulations of 3-manifolds.
77 - Masahiko Yoshinaga 2016
The (extended) Linial arrangement $mathcal{L}_{Phi}^m$ is a certain finite truncation of the affine Weyl arrangement of a root system $Phi$ with a parameter $m$. Postnikov and Stanley conjectured that all roots of the characteristic polynomial of $ma thcal{L}_{Phi}^m$ have the same real part, and this has been proved for the root systems of classical types. In this paper we prove that the conjecture is true for exceptional root systems when the parameter $m$ is sufficiently large. The proof is based on representations of the characteristic quasi-polynomials in terms of Eulerian polynomials.
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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