Results 31 to 40 of about 344,627 (73)
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
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.
Jambu, Michel, Terao, Hiroaki
openaire +1 more source
On supersolvable reflection arrangements
, 2012 13 pages, updated references, to appear in Proc. Amer. Math. Soc. v3.
Hoge, Torsten, Roehrle, Gerhard
openaire +2 more sources
A generalization of semiconductor supersolvable lattices [PDF]
, 1995 Stanley (Algebra Universalis 2, 1972, 197–217) introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing
Bennett, Curtis, Sagan, Bruce E
core +1 more source
Inductive and divisional posets
Journal of the London Mathematical Society, Volume 109, Issue 1, January 2024.Abstract We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their superclass of divisional posets.
Roberto Pagaria +3 more
wiley +1 more source
Products of normal supersolvable subgroups
, 1971 It is shown in this paper that if G is a finite group which is the product of two normal supersolvable subgroups of relatively prime index, then G is supersolvable.
D. K. Friesen
core +1 more source
On The CW Complex of the Complement of A Hypersolvable Graphic Arrangement [PDF]
, 2016 This paper interested in studying a CW complex for the complement of a hypersolvable graphic arrangement that related to a hypersolvable graph , by comparing it with the minimal CW complex for the complement of Jambu's-Papadima's deformed supersolvable ...
Ali, Hana' M.
core +1 more source
Supersolvability and the Koszul property of root ideal arrangements [PDF]
Proceedings of the American Mathematical Society, 2015 13 pages, 3 ...
openaire +2 more sources
Irreducible representations of semisimple algebraic groups and supersolvable lattices [PDF]
, 2012 Let Λ be the cross section lattice of an irreducible representation of a semisimple algebraic group. Certain combinatorial properties of Λ are studied. Supersolvable Λʼs are determined in terms of Dynkin diagrams.
Can, Mahir Bilen, Mahir Bilen Can
core +1 more source
How Is a Chordal Graph Like a Supersolvable Binary Matroid? [PDF]
, 2004 Let G be a finite simple graph Fromth pioneering work of R.P. Stanley it is known that the cycle matroid of G is supersolvable iff G ischfi'J' (rigid):thg is another way to read Dirac'sthLTPO onchO'PO graphO ChphO binary matroids are
Forge, David +5 more
core +1 more source