Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe characteristic quasi-polynomials of the arrangements of root systems and mid-hyperplane arrangements
141
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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.
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 $mathcal{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.
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 arrangements 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.
The braid arrangement is the Coxeter arrangement of the type $A_ell$. The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the braid arrangement and their parallel translations. In this paper, we give an explicit basis construction for the derivation module of the cone over the Shi arrangement. The essential ingredient of our recipe is the Bernoulli polynomials.
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 realization 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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
