Related papers: Flagifying the Dowker Complex
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For…
Topological data analysis (TDA) is an active field of mathematics for quantifying shape in complex data. Standard methods in TDA such as persistent homology (PH) are typically focused on the analysis of data consisting of a single entity…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
This thesis concerns the relationship between bounded and controlled topology and how these can be used to recognise which homotopy equivalences of reasonable topological spaces are homotopic to homeomorphisms. Let $f:X\to Y$ be a…
We demonstrate an equivalence between two integrable flows defined in a polynomial ring quotiented by an ideal generated by a polynomial. This duality of integrable systems allows us to systematically exploit the Korteweg-de Vries hierarchy…
One of the most common and effective methods of obtaining structural information on simplicial complexes is to use tools from algebraic geometry/commutative algebra (often motivated by properties of toric varieties). However, there is no…
We introduce a linear dimensionality reduction technique preserving topological features via persistent homology. The method is designed to find linear projection $L$ which preserves the persistent diagram of a point cloud $\mathbb{X}$ via…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…
We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification $\pi$ of the poset $P$ of…
We introduce a new invariant of $G$-varieties, the dual complex, which roughly measures how divisors in the complement of the free locus intersect. We show that the top homology group of this complex is an equivariant birational invariant…
Persistent homology is one of the most popular methods in topological data analysis. An initial step in its use involves constructing a nested sequence of simplicial complexes. There is an abundance of different complexes to choose from,…
Energy evaluation using fast Fourier transforms enables sampling billions of putative complex structures and hence revolutionized rigid protein-protein docking. However, in current methods efficient acceleration is achieved only in either…
We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…
Over the years a number of topologies for the set of laws of stochastic processes have been proposed. Building on the weak topology they all aim to capture more accurately the temporal structure of the processes. In a parallel paper we show…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
We present a unified framework to systematically embed complex knotted and linked structures, beyond the torus family, into diverse topological phases, including Hopf insulators, classical spin liquids, topological semimetals, and…
Information has intrinsic geometric and topological structure, arising from relative relationships beyond absolute values or types. For instance, the fact that two people share a meal describes a relationship independent of the meal's…
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 consider high dimensional variants of the maximum flow and minimum cut problems in the setting of simplicial complexes and provide both algorithmic and hardness results. By viewing flows and cuts topologically in terms of the simplicial…