کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4653957 1632803 2011 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 32, Issue 6, August 2011, Pages 870–881
نویسندگان
,