Related papers: Matching and Independence Complexes Related to Sma…
Trotter and Erd\"os found conditions for when a directed $m \times n$ grid graph on a torus is Hamiltonian. We consider the analogous graphs on a two-holed torus, and study their Hamiltonicity. We find an $\mathcal{O}(n^4)$ algorithm to…
If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
Let $\mathcal{M}_{n,d}$ be the moduli space of semi-stable rank $n$, trace-free Higgs bundles with fixed determinant of degree $d$ on a Riemann surface of genus at least $3$. We determine the following automorphism groups of…
Understanding the response of an output variable to multi-dimensional inputs lies at the heart of many data exploration endeavours. Topology-based methods, in particular Morse theory and persistent homology, provide a useful framework for…
In this paper, using exclusively homotopy theoretical methods, we study degrees of maps between $(n-2)$-connected $(2n-1)$-dimensional Poincar\' e complexes which have torsion free integral homology. Necessary and sufficient algebraic…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
We introduce and geometrically characterize the notion of uniformly perfect Morse boundary for proper geodesic metric spaces. As a unifying result, we prove that the Morse boundary of any finitely generated, non-elementary group is…
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a…
The topological classification of the inner mappings on the fully invariant regular components of the wandering set with a special attracting boundary up to the topological conjugacy is defined in terms of distinguishing graph. Two inner…
We construct a new class of maximal acyclic matchings on the Salvetti complex of a locally finite hyperplane arrangement. Using discrete Morse theory, we then obtain an explicit proof of the minimality of the complement. Our construction…
Braid Floer homology is an invariant of proper relative braid classes. Closed integral curves of 1-periodic Hamiltonian vector fields on the 2-disc may be regarded as braids. If the Braid Floer homology of associated proper relative braid…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with $n$ links and prescribed lengths $\ell\in \mathbb{R}^n$ in $d$-dimensional Euclidean space. For $d>3$ these spaces are no longer manifolds generically, but they…
We study the properties of the entanglement spectrum in gapped non-interacting non-Hermitian systems, and its relation to the topological properties of the system Hamiltonian. Two different families of entanglement Hamiltonians can be…
We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability can be lost with high probability when matching the networks…
We study the problems of counting copies and induced copies of a small pattern graph $H$ in a large host graph $G$. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns $H$. In…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…
The present paper mainly presents, for example, explicit classifications of compact smooth manifolds having non-empty boundaries and simple structures where the dimensions are general. Studies of this type is fundamental and important. They…