Related papers: Higher analogs of simplicial and combinatorial com…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two…
We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…
In this paper we will introduce and give topological properties of a new concept named simplicial distance which is the simplicial analog of the homotopic distance (in the sense of Marcias-Virgos and Mosquera-Lois in their paper [6]).…
We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a…
All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…
We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of…
For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…
We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…
In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint…
We present a new approach to simple homotopy theory of polyhedra using finite topological spaces. We define the concept of collapse of a finite space and prove that this new notion corresponds exactly to the concept of a simplicial…
A finite poset $P$ is called "simplicial", if it has the smallest element $\hat{0}$, and every interval $[\hat{0}, x]$ is a boolean algebra. The face poset of a simplicial complex is a typical example. Generalizing the Stanley-Reisner ring…
We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…
We provide combinatorial/topological formula for the multiplicity of a complex analytic normal surface singularity whenever the analytic structure on the fixed topological type is generic.
We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…
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…
For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…
Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative…
Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a…