Simple Geometric Characterization of Supersolvable Arrangements
نویسندگان
چکیده
منابع مشابه
Gallery Posets of Supersolvable Arrangements
We introduce a poset structure on the reduced galleries in a supersolvable arrangement of hyperplanes. In particular, for Coxeter groups of type A or B, we construct a poset of reduced words for the longest element whose Hasse diagram is the graph of reduced words. Using Rambau’s Suspension Lemma, we show that these posets are homotopy equivalent to spheres. We furthermore conjecture that its i...
متن کاملGeometric Graphs and Arrangements
Preface The body of this text is written. It remains to find some words to explain what to expect in this book. A first attempt of characterizing the content could be: In words: The questions posed and partly answered in this book are from the intersection of graph theory and discrete geometry. The reader will meet some graph theory with a geometric flavor and some combinatorial geometry of the...
متن کاملGeometric Arrangements: Substructures and Algorithms
In this thesis we study a variety of problems in computational and combinatorial geometry, which involve arrangements of geometric objects in the plane and in higher dimensions. Some of these problems involve the design and analysis of algorithms on arrangements and related structures, while others establish combinatorial bounds on the complexity of various substructures in arrangements. Inform...
متن کاملThe Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes
Comparing two expressions of the Tutte polynomial of an ordered oriented matroid yields a remarkable numerical relation between the numbers of reorientations and bases with given activities. A natural activity preserving reorientation-to-basis mapping compatible with this relation is described in a series of papers by the present authors. This mapping, equivalent to a bijection between regions ...
متن کاملCounting External Facets of Simple Hyperplane Arrangements
The number of external facets of a simple arrangement depends on its combinatorial type. A computation framework for counting the number of external facets is introduced and improved by exploiting the combinatorial structure of the set of sign vectors of the cells of the arrangement. 1 Background and introduction n hyperplanes in dimension d form a hyperplane arrangement. An hyperplane arrangem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2001
ISSN: 0035-7596
DOI: 10.1216/rmjm/1008959682