Results 11 to 20 of about 344,627 (72)
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 +5 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
Minimal non-supersolvable Lie algebras
, 1985 Three classes of finite-dimensional Lie algebras are studied here: those in which every proper subalgebra is supersolvable, those for which every proper homomorphic image is supersolvable and those which satisfy both ...
Towers, David
core +4 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
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