Results 51 to 60 of about 358,772 (72)
On supersolvable and nearly supersolvable line arrangements [PDF]
Journal of Algebraic Combinatorics, 2018 v.2, major changes, main new result is Proposition 2.1International audienceWe introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free ...
Gabriel Sticlaru, Alexandru Dimca
exaly +4 more sources
Supersolvable restrictions of reflection arrangements
Journal of Combinatorial Theory - Series A, 2014 16 pages; final version, to appear in Journal of Combinatorial Theory, Series ...
Gerhard Röhrle, Torsten Hoge
exaly +5 more sources
Supersolvable resolutions of line arrangements
Hokkaido Mathematical Journal, 2023 9 pages, 1 ...
exaly +4 more sources
On complex supersolvable line arrangements
Journal of Algebra, 2020 v.9: Takuro Abe joins as a co-author, after proving that the conjectural upper bounds 3m-3 holds indeed.
Alexandru Dimca, Takuro Abe
exaly +4 more sources
Supersolvable simplicial arrangements [PDF]
Advances in Applied Mathematics, 2019 Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane arrangements with particularly nice geometric, algebraic, topological, and combinatorial properties are the ...
Michael Cuntz
exaly +3 more sources
On the Finite Group Which Is a Product of Two Subnormal Supersolvable Subgroups
Mathematics, 2022 Let G be a finite group that is a product of two subnormal ( normal) supersolvable subgroups. The following are interesting topics in the study of the structure of G: obtaining the conditions in addition to guarantee that G is supersolvable and giving ...
Yubo Lv, Yangming Li
exaly +2 more sources
On the geometry of real or complex supersolvable line arrangements
Journal of Combinatorial Theory - Series A, 2016 Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal A$ is greater than or equal to $n/2$.
Stefan O Tohaneanu, Benjamin Anzis
exaly +5 more sources
Lattice and order properties of the poset of regions in a hyperplane arrangement [PDF]
Algebra Universalis, 2003 We show that the poset of regions (with respect to a canonical base region)of a supersolvable hyperplane arrangement is a congruence normal lattice. Specifically,the poset of regions of a supersolvable arrangement of rank k is obtained via a sequenceof ...
Nathan Reading
exaly +2 more sources
Free arrangements of hyperplanes and supersolvable lattices
Advances in Mathematics, 1984 The authors investigate the relation between two different concepts that come up with an arrangement A of hyperplanes through the origin in \({\mathbb{C}}^{\ell +1}\). On one hand, A is said to be free if the corresponding module of logarithmic vector fields is a free module.
Hiroaki Terao
exaly +2 more sources
The Counting Polynomial of a Supersolvable Arrangement
Advances in Mathematics, 1995 Let \(A\) be an arrangement of hyperplanes in a real finite dimensional vector space \(V\). The components of the complement of the union of the hyperplanes are called the chambers of \(A\). The counting polynomial \(\sum_{i \geq 0} a_i t^i\) of \(A\) in a chamber \(C\) is defined by setting \(a_i\) equal to the number of chambers which are separated ...
exaly +2 more sources