Related papers: Levels in the toposes of simplicial sets and cubic…

We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $\Delta$-complexes, respectively. The functors of classifying spaces and face posets are compatible with…

Given a closed $n$-manifold, we consider the set of simple homotopy types of $n$-manifolds within its homotopy type, called its simple homotopy manifold set. We characterise it in terms of algebraic K-theory, the surgery obstruction map,…

Let two distinct $N$-simplexes be given in an Euclidean or pseudo-Euclidean $N+1$ dimensional space as each is defined by the coordinates of its $N+1$ vertexes. We consider the two families of $N$-spheres passing through the vertexes of the…

We observe that the category of topological space, uniform spaces, and simplicial sets are all, in a natural way, full subcategories of the same larger category, namely the simplicial category of filters; this is, moreover, implicit in the…

In this paper we give a summary of the comparisons between different definitions of so-called (\infty,1)-categories, which are considered to be models for \infty-categories whose n-morphisms are all invertible for n>1. They are also, from…

Both simplicial sets and simplicial spaces are used pervasively in homotopy theory as presentations of spaces, where in both cases we extract the "underlying space" by taking geometric realization. We have a good handle on the category of…

A classification of 2-dimensional surfaces imbedded in spacetime is presented, according to the algebraic properties of their shape tensor. The classification has five levels, and provides among other things a refinement of the concepts of…

The $k$-deck of a graph is its multiset of induced subgraphs on $k$ vertices. We prove that $n$-vertex graphs with maximum degree $2$ have the same $k$-decks if each cycle has at least $k+1$ vertices, each path component has at least $k-1$…

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

We show that the category of simplicial sets is a co-reflective subcategory of the category of cubical sets with connections, with the inclusion given by a version of the straightening functor. We show that using the co-reflector, one can…

For each n\geq 1 we introduce two new Segal-type models of n-types of topological spaces: weakly globular n-fold groupoids, and a lax version of these. We show that any n-type can be represented up to homotopy by such models via an explicit…

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…

An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…

We introduce a partial order on the set of all normal polytopes in R^d. This poset NPol(d) is a natural discrete counterpart of the continuum of convex compact sets in R^d, ordered by inclusion, and exhibits a remarkably rich combinatorial…

We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…

A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…

This is a sequel to a previous paper, developing an intrinsic, combinatorial homotopy theory for simplicial complexes; the latter form the cartesian closed subcategory of 'simple presheaves' in !Smp, the topos of symmetric simplicial sets,…