Related papers: Higher analogs of simplicial and combinatorial com…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
In this paper, we introduce higher symmetric simplicial complexity $SC_n^{\Sigma}(K)$ of a simplicial complex $K$ and higher symmetric combinatorial complexity $CC_n^{\Sigma}(P)$ of a finite poset $P$. These are simplicial and combinatorial…
We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
We present a comparison map between the uberhomology of a simplicial complex $\mathcal{K}$ and the double homology of its associated moment-angle complex $\mathcal{Z}_{\mathcal{K}}$. We show these two homology theories differ at three…
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
In this paper we introduce the concepts of higher equivariant and invariant topological complexity; and study their properties. Then we compare them with equivariant LS-category. We give lower and upper bounds for these new invariants. We…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…
We introduce and analyze a new geometric structure on topological surfaces generalizing the complex structure. To define this so called higher complex structure we use the punctual Hilbert scheme of the plane. The moduli space of higher…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…
In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…
We classify here combinatorially rigid simple polytopes with three facets more than their dimension.