Related papers: Computing the poset of layers of a toric arrangeme…
Given the toric (or toral) arrangement defined by a root system $\Phi$, we describe the poset of its layers (connected components of intersections) and we count its elements. Indeed we show how to reduce to zero-dimensional layers, and in…
A toric arrangement is a finite collection of codimension-$1$ subtori in a torus. These subtori stratify the ambient torus into faces of various dimensions. Let $f_i$ denote the number of $i$-dimensional faces; these so-called face numbers…
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…
We introduce toric arrangements, essentially finite families of codimension 1 subtori of a torus or of their cosets, as a periodic generalization of hyperplane arrangements, compute cohomology of the complement of such an arrangement and…
A toric arrangement is a finite set of hypersurfaces in a complex torus, every hypersurface being the kernel of a character. In the present paper we build a CW-complex homotopy equivalent to the arrangement complement, with a combinatorial…
A subspace arrangement is a finite collection of affine subspaces in $\mathbb{R}^n$. One of the main problems associated to arrangements asks up to what extent the topological invariants of the union of these spaces, and of their complement…
We show that the integral cohomology algebra of the complement of a toric arrangement is not determined by the poset of layers. Moreover, the rational cohomology algebra is not determined by the arithmetic matroid (however it is determined…
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…
We consider the arrangements of subtori in a flat d - dimensional torus T. Let us consider an arrangement on n subtori of codimension one, let f be the number of connected components of the complement in T to the union of subtori. We found…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
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…
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.
The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…
We describe a combinatorial model for the complement of a complexified toric arrangement by using nerves of acyclic categories. This generalizes recent work of Moci and Settepanella on thick toric arrangements. Moreover, we compute its…
For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…
Given an arrangement of subtori of arbitrary codimension in a torus, we compute the cohomology groups of the complement. Then, using the Leray spectral sequence, we describe the multiplicative structure on the graded cohomology. We also…
In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.
We compute the cohomology of the complement of toric arrangements associated to root systems as representations of the corresponding Weyl groups. Specifically, we develop an algorithm for computing the cohomology of the complement of toric…
In this article we investigate a class of linear error correcting codes in relation with the order polytopes. In particular we consider the order polytopes of tree posets and bipartite posets. We calculate the parameters of the associated…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…