Related papers: Higher analogs of simplicial and combinatorial com…
We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times…
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…
In this paper we focus on various aspects of singular complex plane curves, mostly in the context of their homological properties and the associated combinatorial structures. We formulate some challenging open problems that can point to new…
We introduce the notion of the "covering type" of a space, which is more subtle that the notion of Lusternik Schnirelman category. It measures the complexity of a space which arises from coverings by contractible subspaces whose non-empty…
A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…
We give a new explicit construction for the simplicial group $K(A,n)$. We explain the topological interpretation and discuss some possible applications.
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
In this paper, we examine the relations of two closely related concepts, the digital Lusternik-Schnirelmann category and the digital higher topological complexity, with each other in digital images. For some certain digital images, we…
Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K_P which carries complete information about the combinatorial type of P. In the case when P is simple, K_P is the same as dP*, where P*…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
We construct new geometric realizations of simplicial and pre-simplicial sets where the standard $n$-simplex, viewed as the space of probability measures on $n+1$ elements, is replaced by the space of $(n+1)$-valued random variables, with…
In this paper, we show that any finite simplicial complex is homeomorphic to the inverse limit of a sequence of finite posets, which is an extension of Claders result.
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
We discuss physical systems with topologies more complicated than simple gaussian linking. Our examples of these higher topologies are in non-relativistic quantum mechanics and in QCD.
We determine the symmetrized topological complexity of the circle, using primarily just general topology.
The aim of these notes is to introduce the intuition motivating the notion of a "complicial set", a simplicial set with certain marked "thin" simplices that witness a composition relation between the simplices on their boundary. By varying…