Related papers: Tight complexes are Golod
The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In this paper we completely characterize the pairs (graph, matching complex) for…
We show that fundamental groups of compact, orientable, irreducible 3-manifolds with toroidal boundary are Grothendieck rigid.
We investigate the classification of topological quandles on some simple manifolds. Precisely we classify all Alexander quandle structures, up to isomorphism, on the real line and the unit circle. For the closed unit interval $[0, 1]$, we…
A discrete group $\G$ is called rigidly symmetric if for every $C^*$-algebra $\A$ the projective tensor product $\ell^1(\G)\widehat\otimes\A$ is a symmetric Banach $^*$-algebra. For such a group we show that the twisted crossed product…
We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian…
A hypercomplex manifold is by definition a smooth manifold equipped with two anticommuting integrable almost complex structures. For example, every hyperkaehler manifold is canonically hypercomplex (the converse is not true). For every…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…
The main invariant to study the combinatorics of a simplicial complex $K$ is the associated face ring or Stanley-Reisner algebra. Reisner respectively Stanley explained in which sense Cohen-Macaulay and Gorenstein properties of the face…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…
We write out some sequences of linear maps of vector spaces with fixed bases. Each term of a sequence is a linear space of differentials of metric values ascribed to the elements of a simplicial complex - a triangulation of a manifold. If…
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
The notion of strict closedness of rings was given by J. Lipman in connection with a conjecture of O. Zariski. The present purpose is to give a practical method of construction of strictly closed rings. It is also shown that the…
The goal of this paper is to generalize some of the existing toolkit of combinatorial algebraic topology in order to study the homology of abstract chain complexes. We define shellability of chain complexes in a similar way as for cell…
A hypercomplex structure on a differentiable manifold consists of three integrable almost complex structures that satisfy quaternionic relations. If, in addition, there exists a metric on the manifold which is Hermitian with respect to the…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
It is conjectured that every cusped hyperbolic 3-manifold admits a geometric triangulation, i.e. it is decomposed into positive volume ideal hyperbolic tetrahedra. Here, we show that sufficiently highly twisted knots admit a geometric…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution traces leading to the same observable outcomes, while assigning…
A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly…