Characteristic quasi-polynomials of deletions of Shi arrangements of type C and type D
summary
The gist
Characteristic quasi-polynomials enumerate the number of points in the complement of hyperplane arrangements modulo positive integers…
In short
This paper computes characteristic quasi-polynomials for deletions of Shi arrangements of type C and D modulo positive integers. It establishes explicit formulas for these counting functions based on the parity of q, and determines conditions under which period collapse occurs in these arrangements.
Key concepts
- Characteristic Quasi-Polynomial
- This is a generalization of the characteristic polynomial used to count points in the complement of a hyperplane arrangement when working modulo a positive integer q. It encodes complex combinatorial information about the arrangement's structure over finite fields.
- Shi Arrangement
- These are specific types of hyperplane arrangements related to root systems, categorized as type C and type D. They are central objects in this study because their properties are being analyzed through the lens of characteristic quasi-polynomials.
- Period Collapse
- Period collapse occurs when the characteristic quasi-polynomial simplifies into a standard polynomial form. The paper investigates when this simplification happens for deletions of these Shi arrangements, linking it to specific geometric conditions like fixing certain hyperplanes or examining parallel hyperplanes.
Terminology used across episodes
This episode discusses
- Characteristic quasi-polynomials of deletions of Shi arrangements of type C and type D · Paper Radio
- Characteristic quasi-polynomials of deletions of Shi arrangements of type B and their period collapse
- Characteristic quasi-polynomials for deformations of Coxeter arrangements of types A, B, C, and D
The paper
Characteristic quasi-polynomials of deletions of Shi arrangements of type C and type D · Read on arXiv
Akihiro Higashitani, Masato Konoike, Norihiro Nakashima, Satoshi Ono
Graduate School of Information Science and Technology, Osaka University · Department of Mathematics, Nagoya Institute of Technology
Characteristic quasi-polynomials enumerate the number of points in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic quasi-polynomials of the restrictions of the Shi arrangements of type C and type D by one given hyperplane, respectively. The case of type C is established by extending the method developed in our previous work on type B, while the case of type D is deduced through a direct connection with the results on type B. As a corollary, we determine whether period collapse occurs in the characteristic quasi-polynomials of the deletions of the Shi arrangements of type C and type D. Moreover, it turns out that the intersection posets of the Shi arrangements of type B and type C are not isomorphic as posets if their rank is at least 3.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Characteristic quasi-polynomials of deletions of Shi arrangements of type C and type D".
Emmy: Here's the gist of the paper. Characteristic quasi-polynomials enumerate the number of points in the complement of hyperplane arrangements modulo positive integers, and this paper computes these characteristic quasi-polynomials for deletions of Shi arrangements of type C and type D The characteristic quasi-polynomial is a generalization of the characteristic polynomial that encodes information about the number of points in the complement of a hyperplane arrangement over Z/qZ, where q is a positive integer The paper focuses on computing these for Shi arrangements, which are central objects in this study The authors investigate whether period collapse occurs in these characteristic quasi-polynomials by examining restrictions and deletions of the arrangements.
Ada: Characteristic Quasi-Polynomials of Type C The characteristic quasi-polynomial of the Shi arrangement Cm is established as M(Cm)q = (q − 2m)m This result holds for any q > 0 The counting method involves preparing boxes and circles similar to previous work on type B The authors analyze the case where q is odd by creating a specific arrangement of boxes and circles to enumerate the elements in M(Cq).
Emmy: For example, for m = 5 and q = 15, the tuple (x1, x2, x3, x4, x5) = (3, 7, 10, 11, 14) is an element of M(Cq).
Ada: The case where q is even yields the same count M(Cq) = (q − 2m)m.
Paper summary: Ada: So to summarize this paper, it computes characteristic quasi-polynomials for deletions of Shi arrangements of type C and D. The core idea is how these counts behave modulo a positive integer q >
Emmy: The authors establish the formulas for type C and D by comparing them to previous work on type B arrangements, showing how they are related through bijections >
Kolya: It matters because it gives us explicit, computable formulas for these counting functions based on the structure of the arrangement types C and D >
Ada: Specifically, they get M(Cm)q equals q minus two m times m and M(Dm)q equals q minus two m plus two times m >
Emmy: And they also provide conditions under which period collapse occurs in these deletions, linking the structure of the arrangement to the behavior of these polynomials >
Kolya: So it's a way to understand when and how these counting functions simplify or behave differently depending on whether q is odd or even, or based on how you restrict the arrangement >
Conclusion: Ada: Thinking about the title, "Characteristic quasi-polynomials of deletions," it highlights that we aren't just looking at the original arrangement anymore, but how removing certain hyperplanes affects the count >
Emmy: And by focusing on type C and D Shi arrangements, they are giving us concrete algebraic structures to study this phenomenon with >
Kolya: The implication is that these explicit formulas give researchers a clear tool to predict if period collapse will happen in specific geometric counting problems related to these types of arrangements >
Ada: So it’s about connecting the combinatorial structure of these arrangements directly to the arithmetic properties of how they count points modulo q >
Emmy: It suggests that understanding these quasi-polynomials is crucial for analyzing more complex hyperplane arrangements where this connection might not be as direct >
More episodes
- 2508.20749-Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products