Add to ORKGWe investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which are free, simplicial, factored, or supersolvable. In particular, such an arrangement is free if and only if the graph is a cycle, a path, an almost path, or a path with a triangle attached to it.Comment: 22 pages, 7 figures, minor edit
AbstractLet GH(S,H) be the bipartite graph with partition sets S and H, the set of simplices and hyp...
AbstractIn this article we prove that a complex arrangement (i.e. a finite union of hyperplanes in C...
It is known that there exist hyperplane arrangements with the same underlying matroid that admit no...
The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated ...
A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set ...
AbstractWe classify the hyperplane arrangements between the cones of the braid arrangement and the S...
Hyperplane Arrangements of rank $3$ admitting an unbalanced Ziegler restriction are known to fulfill...
Let V be a finite vector space of dimension n over the field K. A hyperplane in V is an n − 1 dimens...
We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a ce...
AbstractLetG(r, 1, l) be the complex arrangement {xi, xj−ξhxk}, whereξis a primitiverth root of unit...
AbstractGiven a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we d...
In this thesis, we study simplicial arrangements of hyperplanes. Classically, a simplicial arrangeme...
A toric hyperplane is the preimage of a point $x \in S^1$ of a continuous surjective group homomorph...
A catalogue of simplicial hyperplane arrangements was first given by Grünbaum in 1971. These arrange...
A catalogue of simplicial hyperplane arrangements was first given by Grünbaum in 1971. These arrange...
AbstractLet GH(S,H) be the bipartite graph with partition sets S and H, the set of simplices and hyp...
AbstractIn this article we prove that a complex arrangement (i.e. a finite union of hyperplanes in C...
It is known that there exist hyperplane arrangements with the same underlying matroid that admit no...
The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated ...
A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set ...
AbstractWe classify the hyperplane arrangements between the cones of the braid arrangement and the S...
Hyperplane Arrangements of rank $3$ admitting an unbalanced Ziegler restriction are known to fulfill...
Let V be a finite vector space of dimension n over the field K. A hyperplane in V is an n − 1 dimens...
We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a ce...
AbstractLetG(r, 1, l) be the complex arrangement {xi, xj−ξhxk}, whereξis a primitiverth root of unit...
AbstractGiven a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we d...
In this thesis, we study simplicial arrangements of hyperplanes. Classically, a simplicial arrangeme...
A toric hyperplane is the preimage of a point $x \in S^1$ of a continuous surjective group homomorph...
A catalogue of simplicial hyperplane arrangements was first given by Grünbaum in 1971. These arrange...
A catalogue of simplicial hyperplane arrangements was first given by Grünbaum in 1971. These arrange...
AbstractLet GH(S,H) be the bipartite graph with partition sets S and H, the set of simplices and hyp...
AbstractIn this article we prove that a complex arrangement (i.e. a finite union of hyperplanes in C...
It is known that there exist hyperplane arrangements with the same underlying matroid that admit no...