Related papers: Higher chordality: From graphs to complexes
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…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
Assuming complex functions defined on complex curves satisfy recursion relations with respect to number of parameters, we express the corresponding cohomology theory via generalizations of holomorphic connections. In examples provided, the…
We introduce a generalization of the notion of operad that we call a contractad, whose set of operations is indexed by connected graphs and whose composition rules are numbered by contractions of connected subgraphs. We show that many…
We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
This paper studies the magnitude homology of graphs focusing mainly on the relationship between its diagonality and the girth. Magnitude and magnitude homology are formulations of the Euler characteristic and the corresponding homology,…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
Homotopy algebraic methods have become increasingly influential in studying field theories. We consider semi-holomorphic Chern-Simons theory and its relation with the principal chiral model. In particular, we establish an explicit…
We extend homological perturbation theory to encompass algebraic structures governed by operads and cooperads. The main difficulty is to find a suitable notion of algebra homotopy that generalizes to algebras over operads O. To solve this…
We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the…
We study several different notions of algebraicity in use in stable homotopy theory and prove implications between them. The relationships between the different meanings of algebraic are unexpectedly subtle, and we illustrate this with…
We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of…
Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…
We present a theory of reduction for Courant algebroids as well as Dirac structures, generalized complex, and generalized K\"ahler structures which interpolates between holomorphic reduction of complex manifolds and symplectic reduction.…
The processing of signals on simplicial and cellular complexes defined by nodes, edges, and higher-order cells has recently emerged as a principled extension of graph signal processing for signals supported on more general topological…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
Homotopy links have proven to be one of the most powerful tools of stratified homotopy theory. In previous work, we described combinatorial models for the generalized homotopy links of a stratified simplicial set. For many purposes, in…