Results 31 to 40 of about 94 (68)
Supersolvable posets and fiber-type abelian arrangements
Selecta MathematicaAbstractWe 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.
Bibby, Christin, Delucchi, Emanuele
openaire +3 more sources
On The CW Complex of the Complement of A Hypersolvable Graphic Arrangement
, 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
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
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
European Journal of CombinatoricsFor an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge between any two vertices whose corresponding regions are separated by a single hyperplane from $\mathcal{H}$.
Sofia Brenner +4 more
openaire +2 more sources
Combinatorial polar orderings and recursively orderable arrangements
, 2009 Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and reach thereby a ...
Delucchi, Emanuele +3 more
core +1 more source
On rational K[pi,1] spaces and Koszul algebras
, 1997 this paper were first studied in the arrangement setting in [2, 20, 21, 22, 14, 13]. Falk [13] studied conditions for X to be a rational K[ß; 1]. He proved that X is a rational K[ß; 1] for every arrangement of so called fiber-type.
Stefan Papadima, Sergey Yuzvinsky
core
Combinatorial construction of logarithmic differential forms
, 1989 H. Terao has shown that the structure of the module of (rational) differential forms with at most logarithmic poles at an arrangement of hyperplanes (as defined by K.
Ziegler, Günter M., Ziegler, Günter M
core +1 more source
Biclosed sets in Combinatorics [PDF]
, 2015 University of Minnesota Ph.D. dissertation. August 2015. Major: Mathematics. Advisor: Pavlo Pylyavskyy. 1 computer file (PDF); ix, 151 pages.The weak order is the set of permutations of [n] partially ordered by inclusion of inversion sets. This partial
McConville, Thomas
core
Intersection subgroups of complex hyperplane arrangements
, 2000 Let A be a central arrangement of hyperplanes in Cn , let M(A) be the complement of A , and let L(A) be the intersection lattice of A . For X in L(A) we set AX={H∈A:H⫆X} , and A/X={H/X:H∈AX} , and AX={H∩X:H∈A\AX} .
Luis Paris, Paris, Luis
core +1 more source
Hamiltonian Cycles in Simplicial and Supersolvable Hyperplane Arrangements
Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable arrangements. We confirm Hamiltonicity for all 3-dimensional simplicial arrangements listed in the Grünbaum--Cuntz ...
Körber, Veronika +3 more
openaire +2 more sources