论文信息 - Enumeration in torus arrangements

Enumeration in torus arrangements

This paper presents two new results of somewhat different flavors. The first result is a formula for the numbers of cells of each dimension determined by an arrangement of closed subgroups of a torus group. This is accompanied by a brief description of previous work on cell counting in torus groups. In the course of things, two distinct formulas yielding the numbers of cells are encountered. The question of how to reconcile these two formulas motivates a general result that applies to lattices whose elements are the closed sets of a closure system. This result gives the characteristic polynomial for the (lattice) dual of such a lattice as a sum of characteristic polynomials of lattices of closed sets of deleted minors of the closure system.

Jim Lawrence | J. Lawrence

[1] Christos A. Athanasiadis. Characteristic Polynomials of Subspace Arrangements and Finite Fields , 1996 .

[2] B. Sturmfels,et al. SYZYGIES OF ORIENTED MATROIDS , 2000 .

[3] Jim Lawrence. Finite Unions of Closed Subgroups of the n-Dimensional Torus. , 1988 .

[4] G. Rota. On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[5] Alexander Borisov. On classification of toric singularities , 1998 .

[6] Bernd Sturmfels,et al. Sysygies of unimodular Lawrence ideals , 1999 .

[7] R. Winder. Partitions of N-Space by Hyperplanes , 1966 .

[8] T. Zaslavsky. Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[9] T. Zaslavsky. A combinatorial analysis of topological dissections , 1977 .

[10] Richard Ehrenborg,et al. Affine and Toric Hyperplane Arrangements , 2009, Discret. Comput. Geom..

[11] Jim Lawrence,et al. Characteristic polynomials, Ehrhart quasi-polynomials, and torus groups☆ , 2006 .

[12] Thomas Zaslavsky,et al. Counting the faces of cut-up spaces , 1975 .

[13] Tom Brylawski,et al. A combinatorial perspective on the Radon convexity theorem , 1976 .