Results 51 to 60 of about 94 (68)
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 ...
Paris, L., Paris, Luis
exaly +3 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 ...
Torsten Hoge, Gerhard Röhrle
exaly +4 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, Reading Nathan
exaly +2 more sources
Supersolvable resolutions of line arrangements
Hokkaido Mathematical Journal, 2023 9 pages, 1 ...
exaly +4 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 +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.
Takuro Abe, Alexandru Dimca
exaly +4 more sources
Supersolvability of complementary signed-graphic hyperplane arrangements [PDF]
Australas. J Comb., 2004 The authors study the graphic arrangenment associated to complementary signed graphs consisting of positive and negative graphs such that their union is the complete graph (the reference on arrangements of hyperplanes is the book by \textit{P. Orlik} and \textit{H.
Guangfeng Jiang, Jianming Yu
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Supersolvable Groups and the Nilpotator
Communications in Algebra, 2004Piroska Csörgö, Marcel Herzog
exaly