Related papers: Simplicial complexes from finite projective planes…

In 1992, Brehm and K\"uhnel constructed a 8-dimensional simplicial complex $M^8_{15}$ with 15 vertices as a candidate to be a minimal triangulation of the quaternionic projective plane. They managed to prove that it is a manifold "like a…

We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.

We prove that for any partition of the plane into a closed set $C$ and an open set $O$ and for any configuration $T$ of three points, there is a translated and rotated copy of $T$ contained in $C$ or in $O$. Apart from that, we consider…

In their solution to the orchard-planting problem, Green and Tao established a structure theorem which proves that in a line arrangement in the real projective plane with few double points, most lines are tangent to the dual curve of a…

How complex must two finite 2-complexes be to admit a common, but not finite common, covering? We obtain an almost answer: the minimum possible number of triangles in a pseudo-simplicial triangulation of each complex is 3, 4, or 5.

We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr\"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines,…

In this paper we study plus-one generated arrangements of conics and lines in the complex projective plane with simple singularities. We provide several degree-wise classification results that allow us to construct explicit examples of such…

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…

The number of nonisomorphic simplicial complexes with up to $n$ vertices increases super-exponentially with $n$, which makes exhaustive computation of invariants associated with such complexes a daunting task. In this paper we provide a…

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost surely contains infinitely many copies of…

For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges given by elementary transfers of one unit between parts, followed by reordering. We study the local simplex dimension in the clique…

The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied,…

We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…

We point out a somewhat mysterious appearance of $SU_c(3)$ representations, which exhibit the behaviour of three full generations of standard model particles. These representations are found in the Clifford algebra $\mathbb{C}l(6)$, arising…

A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…

The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…

The SL(3,C)-representation variety R of a free group F arises naturally by considering surface group representations for a surface with boundary. There is a SL(3,C)-action on the coordinate ring of R. The geometric points of the subring of…