Related papers: On the connection between coordinate and diagonal …
Given a space $X$ and a simplicial complex $K$ with $m$-vertices, the arrangement of partially diagonal subspaces of $X^m$, called the dragonal arrangement, is defined. We decompose the suspension of the diagonal arrangement when $2(dim K +…
The complement of an arrangement of diagonal subspaces $x_{i_1} = \cdots = x_{i_k}$ in the real space is defined by a simplicial complex $K$. In this paper, we prove that the complement of a diagonal subspace arrangement is homotopy…
We study the reciprocal complement $\mathcal{R}(D)$ of a two-dimensional finitely generated $K$-algebra $D$ by linking it with the properties of a surface with coordinate ring $D$. We give several sufficient criteria to have…
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
We present a comparison map between the uberhomology of a simplicial complex $\mathcal{K}$ and the double homology of its associated moment-angle complex $\mathcal{Z}_{\mathcal{K}}$. We show these two homology theories differ at three…
The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…
An abelian arrangement is a finite set of codimension one abelian subvarieties (possibly translated) in a complex abelian variety. In this paper, we study the cohomology of the complement of an abelian arrangement. For unimodular abelian…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…
We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…
An abstract $(v_k,b_r)$-configuration is a pair of finite sets of cardinalities $v$ and $b$ with a relation on the product of the sets such that each element of the first set is related to the same number $k$ of elements from the second set…
The dominance complex $D(G)$ of a simple graph $G = (V,E)$ is the simplicial complex consisting of the subsets of $V$ whose complements are dominating. We show that the connectivity of $D(G)$ plus $2$ is a lower bound for the vertex cover…
In this work we prove constructively that the complement ${\mathbb R}^n\setminus{\mathcal K}$ of an $n$-dimensional unbounded convex polyhedron ${\mathcal K}\subset{\mathbb R}^n$ and the complement ${\mathbb R}^n\setminus{\rm Int}({\mathcal…
Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…
In this paper, we study $k$-parabolic arrangements, a generalization of $k$-equal arrangements for finite real reflection groups. When $k=2$, these arrangements correspond to the well-studied Coxeter arrangements. Brieskorn (1971) showed…