Results 11 to 20 of about 57 (42)
Free arrangements of hyperplanes and supersolvable lattices
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.
Hiroaki Terao
exaly +2 more sources
Supersolvable posets and fiber-type abelian arrangements
AbstractWe present a combinatorial analysis of fiber bundles of generalized configuration spaces on connected abelian Lie groups. These bundles are akin to those of Fadell–Neuwirth for configuration spaces, and their existence is detected by a combinatorial property of an associated finite partially ordered set.
Emanuele Delucchi +2 more
exaly +4 more sources
Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings the characteristic and Ehrhart quasi-polynomials into ...
Tran, Tan Nhat, Tsuchiya, Akiyoshi
doaj +1 more source
Supersolvable reflection arrangements [PDF]
Let A = ( A
Hoge, Torsten, Röhrle, Gerhard
openaire +1 more source
Graded Linearity of Stanley–Reisner Ring of Broken Circuit Complexes
This paper introduces two new notions of graded linear resolution and graded linear quotients, which generalize the concepts of linear resolution property and linear quotient for modules over the polynomial ring A = k[x1, …, xn]. Besides, we compare graded linearity with componentwise linearity in general.
Mohammad Reza-Rahmati +2 more
wiley +1 more source
Supersolvability and Freeness for $$\psi $$ ψ -Graphical Arrangements [PDF]
6 ...
Mu, Lili, Stanley, Richard P
openaire +5 more sources
The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes [PDF]
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
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
On supersolvable reflection arrangements
13 pages, updated references, to appear in Proc. Amer. Math. Soc. v3.
Hoge, Torsten, Roehrle, Gerhard
openaire +2 more sources
The Counting Polynomial of a Supersolvable Arrangement
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 ...
openaire +1 more source

