Results 11 to 20 of about 344,627 (73)
Supersolvable orders and inductively free arrangements
Open Mathematics, 2017 In this paper, we define the supersolvable order of hyperplanes in a supersolvable arrangement, and obtain a class of inductively free arrangements according to this order.
Gao Ruimei, Cui Xiupeng, Li Zhe
doaj +5 more sources
Gallery Posets of Supersolvable Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 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 ...
Thomas McConville
doaj +6 more sources
On supersolvable and nearly supersolvable line arrangements [PDF]
Journal of Algebraic Combinatorics, 2018 v.3, a version of the Slope Problem, valid over the real and the complex numbers as well, is obtained, see Thm. 1.1 and Thm.
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 Roehrle, Torsten Hoge
exaly +5 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
exaly +5 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
Supersolvable resolutions of line arrangements
Hokkaido Mathematical Journal, 2023 9 pages, 1 ...
exaly +4 more sources
Two Generator Subalgebras Of Lie Algebras. [PDF]
, 2007 In [14] Thompson showed that a finite group G is solvable if and only if every twogenerated subgroup is solvable (Corollary 2, p. 388). Recently, Grunevald et al.
Bowman, Kevin +2 more
core +5 more sources
Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
Comptes Rendus. Mathématique, 2021 The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings the characteristic and Ehrhart quasi-polynomials into ...
Tran, Tan Nhat, Tsuchiya, Akiyoshi
doaj +1 more source
Supersolvable reflection arrangements [PDF]
Proceedings of the American Mathematical Society, 2014 Let A = ( A
Hoge, Torsten, Röhrle, Gerhard
openaire +1 more source