Related papers: Local-global intersection homology
Graph maps that are homotopic to the identity and that permute the vertices are studied. Given a periodic point for such a map, a {\em rotation element} is defined in terms of the fundamental group. A number of results are proved about the…
We study synchronization of sinusoidally coupled phase oscillators on networks with modular structure and a large number of oscillators in each community. Of particular interest is the hierarchy of local and global synchrony, i.e.,…
We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…
This paper studies observability for non-uniform hypergraphs with inputs and outputs. To capture higher-order interactions, we define a canonical non-homogeneous dynamical system with nonlinear outputs on hypergraphs. We then construct…
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
The topological organization of several world cities are studied according to respective representations by complex networks. As a first step, the city maps are processed by a recently developed methodology that allows the most significant…
We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep…
We study homological properties of a locally complete intersection ring by importing facts from homological algebra over exterior algebras. One application is showing that the thick subcategories of the bounded derived category of a locally…
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…
Here we show the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks, for the topological universality class of the…
An explicit isomorphism between Morse homology and singular homology is constructed via the technique of pseudo-cycles. Given a Morse cycle as a formal sum of critical points of a Morse function, the unstable manifolds for the negative…
A commutative local ring is generally defined to be a complete intersection if its completion is isomorphic to the quotient of a regular local ring by an ideal generated by a regular sequence. It has not previously been determined whether…
Local graph clustering is an important algorithmic technique for analysing massive graphs, and has been widely applied in many research fields of data science. While the objective of most (local) graph clustering algorithms is to find a…
We define an integral Borel-Moore homology theory over finite fields, called arithmetic homology, and an integral version of Kato homology. Both types of groups are expected to be finitely generated, and sit in a long exact sequence with…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…
We determine the symmetrized topological complexity of the circle, using primarily just general topology.
An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…
Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…