Results 21 to 30 of about 283,373 (79)
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, Paul Mücksch
openaire +2 more sources
The freeness of Ish arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The Ish arrangement was introduced by Armstrong to give a new interpretation of the $q; t$-Catalan numbers of Garsia and Haiman. Armstrong and Rhoades showed that there are some striking similarities between the Shi arrangement and the Ish arrangement ...
Takuro Abe +2 more
doaj +1 more source
Supersolvability and Freeness for $$\psi $$ ψ -Graphical Arrangements [PDF]
Discrete & Computational Geometry, 2015 6 ...
Mu, Lili, Stanley, Richard P
openaire +5 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 +3 more sources
Real and complex supersolvable line arrangements in the projective plane [PDF]
Journal of Algebraic Combinatorics, 2020 17 pages; comments ...
Hanumanthu, Krishna, Harbourne, Brian
openaire +3 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
openaire +3 more sources
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes [PDF]
The Electronic Journal of Combinatorics, 2006 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.
Gioan, Emeric, Las Vergnas, Michel
openaire +3 more sources
THE BROKEN CIRCUIT COMPLEX AND THE HYPERSOLVABLE PARTITION COMPLEX
مجلة علوم ذي قار, 2019 In this paper we construct the broken circuit complex of a hypersolvable r -arrangement ? by using the hypersolvable partition analogue and the hypersolvable ordering which respects the hypersolvable structure .We used the minimal informations that ...
Hana ' M .Ali, Abid Ali Al-Ta'ai
doaj +4 more sources
Simple Geometric Characterization of Supersolvable Arrangements
Rocky Mountain Journal of Mathematics, 2001 An arrangement of hyperplanes is a finite collection of \(\mathbb{C}\)-linear subspaces of dimension \(d-1\) in \(\mathbb{C}^d.\) Let \(A\) be an arrangement in \(\mathbb{C}^3\) and \(A^*\) be the natural projective arrangements in \(\mathbb{C}\mathbb{P}^2\) associated to it.
Jiang, Tan +2 more
openaire +2 more sources
Decorous lower bounds for minimum linear arrangement [PDF]
, 2011 Minimum Linear Arrangement is a classical basic combinatorial optimization problem from the 1960s, which turns out to be extremely challenging in practice.
Salazar, J J, Caprara, A, Letchford, A N
core +3 more sources