Related papers: Higher analogs of simplicial and combinatorial com…

We review some semantic and syntactic complexity classes that were introduced to better understand the relationship between complexity classes P and NP. We also define several new complexity classes, some of which are associated with…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…

In this paper we establish a natural definition of Lusternik-Schnirelmann category for simplicial complexes via the well known notion of contiguity. This category has the property of being homotopy invariant under strong equivalences, and…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…

We associate with any simplicial complex $\K$ and any integer $m$ a system of linear equations and inequalities. If $\K$ has a simplicial embedding in $\R^m$ then the system has an integer solution. This result extends the work of I. Novik…

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

There is a canonical way to associate two simplicial complexes K, L to any relation $R\subset X\times Y$. Moreover, the geometric realizations of K and L are homotopy equivalent. This was studied in the fifties by C.H. Dowker. In this…

We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,\{(S^{k_i},\star)\})$, e.g. robot arms with restrictions on the possible combinations of…

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

This paper explores topological complexity in the finite equivariant setting. We first define and study an equivariant version of Tanaka's combinatorial complexity for finite topological spaces. We explore the relationships between this…

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to…

We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…

In this paper, we study three relative LS categories of a map and study some of their properties. Then we introduce the `higher topological complexity' and `weak higher topological complexity' of a map. Each of them are homotopy invariants.…

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…

Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.

We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…