Results 21 to 30 of about 366,411 (69)
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
Koszulness and supersolvability for Dirichlet arrangements
Proceedings of the American Mathematical Society, 2019 We prove that the cone over a Dirichlet arrangement is supersolvable if and only if its Orlik-Solomon algebra is Koszul. This was previously shown for four other classes of arrangements. We exhibit an infinite family of cones over Dirichlet arrangements that are combinatorially distinct from these other four classes.
openaire +3 more sources
Holonomy Lie algebra of a geometric lattice [PDF]
, 2023 Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way.
Liu, Ye, Guo, Weili
core +1 more source
A generalization of semiconductor supersolvable lattices
, 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
Supersolvable LL-lattices of binary trees
, 2005 Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given.
Chapoton, Frédéric, Biagioli, Riccardo
core +2 more sources
A survey of the number of supersolvable subgroups of finite groups
, 2022 In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups.
Acosta-Humánez, Primitivo B. +2 more
core
The $\textbf{nbc}$ minimal complex of supersolvable arrangements
, 2015 In this paper we give a very natural description of the bijections between the minimal CW-complex homotopy equivalent to the complement of a supersolvable arrangement $\mathcal{A}$, the $\textbf{nbc}$ basis of the Orlik-Solomon algebra associated to $\mathcal{A}$ and the set of chambers of $\mathcal{A}$.
Settepanella, Simona, Torielli, Michele
openaire +2 more sources
Supersolvable closures of finitely generated subgroups of the free group [PDF]
, 2022 We prove the pro-supersolvable closure of a finitely generated subgroup of the free group is finitely generated. It extends similar results for pro-$p$ closures proved by Ribes-Zalesskii and pro-Nilpotent closures proved by Margolis-Sapir ...
Wu, Jianchun, Chen, Lida
core +1 more source
How Is a Chordal Graph Like a Supersolvable Binary Matroid?
, 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
Sulamita Klein +2 more
core +1 more source
The Orlik-Solomon algebra and the supersolvable class of arrangements
International Journal of Algebra, 2014 According to the powerful geometric properties of the hypersolvable order on the hyperplanes of a supersolvable arrangement, we introduced a sufficient condition on the Orlik-Solomon algebra for any central arrangement to have supersolvable analogue and we showed this condition as a necessary condition (not sufficient) on the Orlik-Solomon algebra for ...
openaire +1 more source