Related papers: Higher analogs of simplicial and combinatorial com…
The aim of this article is to review different generalizations of the the notion of topological complexity to the equivariant setting. In particular, we review the relation (or non-relation) between these notions and the topological…
We present an alternative equivalent description of Dupont's simplicial contraction: it is an explicit example of a simplicial contraction between the simplicial differential graded algebra of polynomial differential forms on standard…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…
We show a wedge-decomposable simplicial complex has associated double homology $\mathbb{Z}\oplus\mathbb{Z}$ in bidegrees $(0,0)$, $(-1,4)$.
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…
We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.
The (n,k)-hypersimplex is the convex hull of all 0/1-vectors of length n with coordinate sum k. We explicitly determine the extension complexity of all hypersimplices as well as of certain classes of combinatorial hypersimplices. To that…
For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
An analogous construction of simplicial homotopy group for Kan complex can be applied to saturated complicial sets to give monoids. In this paper, we investigate how the construction of loop spaces of Kan complexes lifts to the complicial…
This paper presents three short, new proofs of Dowker duality using various poset fiber lemmas. We introduce modifications of joins and products of simplicial complexes called relational join and relational product complexes. These…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
In this note we introduce higher order polar loci as natural generalizations of the classical polar loci, replacing the role of tangent spaces by that of higher order osculating spaces. The close connection between polar loci and dual…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
It is shown that higher Bruhat orders admit a decomposition into a higher Tamari order, the corresponding dual Tamari order, and a "mixed order." We describe simplex equations (including the Yang-Baxter equation) as realizations of higher…
In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…