On supersolvable and nearly supersolvable line 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...
متن کاملNearly Supersolvable Groups and Applications to Artin L-functions
In this note, we apply the group-theoretic method to study Artin’s conjecture, and introduce the notations of nearly nilpotent groups and nearly supersolvable groups to answer of a question of Arthur and Clozel. As an application, we show that Artin’s conjecture is valid for all nearly supersolvable Galois extensions of number fields as well as all solvable Frobenius extensions.
متن کاملSupersolvable Frame-matroid and Graphic-lift Lattices
A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...
متن کاملConverse Lagrange Theorem Orders and Supersolvable Orders
For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...
متن کاملBinary Supersolvable Matroids and Modular Constructions
Let Jt be the class of binary matroids without a Fano plane as a submatroid. We show that every supersolvable matroid in JÍ is graphic, corresponding to a chordal graph. Then we characterize the case that the modular join of two matroids is supersolvable. This is used to study modular flats and modular joins of binary supersolvable matroids. We decompose supersolvable matroids in JH as modular ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2018
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-018-0859-6