Related papers: Biclosed sets in real hyperplane arrangements
A bi-arrangement of hyperplanes in a complex affine space is the data of two sets of hyperplanes along with a coloring information on the strata. To such a bi-arrangement, one naturally associates a relative cohomology group, that we call…
We introduce a new discrete system that arises from ellipsoidal billiards and is closely related to the double reflection nets. The system is defined on the lattice of a uniform honeycomb consisting of rectified hypercubes and cross…
In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…
We study the order dimension of the lattice of closed sets for a convex geometry. Further, we prove the existence of large convex geometries realized by planar point sets that have very low order dimension. We show that the planar point set…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
To every affine real arrangement of hyperplanes we associate a family of diagrams of spaces over the face poset of the arrangement. We show that any cover of the complement of the complexification of the arrangement is homotopy equivalent…
We show that if the fundamental groups of the complements of two line arrangements in the complex projective plane are isomorphic to the same direct sum of free groups, then the complements of the arrangements are homotopy equivalent. For…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…
We present a theory that produces several examples where the homotopy Lie algebra of a complex hyperplane arrangement is not finitely presented. We also present examples of hyperplane arrangements where the enveloping algebra of this Lie…
We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we…
This article presents a study of an algebra spanned by the faces of a hyperplane arrangement. The quiver with relations of the algebra is computed and the algebra is shown to be a Koszul algebra. It is shown that the algebra depends only on…
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…
A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced…
The purpose of this paper is applying minimality of hyperplane arrangements to local system cohomology groups. It is well known that twisted cohomology groups with coefficients in a generic rank one local system vanish except in the top…
Determining the number of pieces after cutting a cake is a classical problem. Roberts (1887) provided an exact solution by computing the number of chambers contained in a plane cut by lines. About 88 years later, Zaslavsky (1975) even…