Related papers: Local-global intersection homology
In group representations several inductions given by tensoring with appropriate bimodules may be reconstructed via homology of $G$-posets with $G$-equivariant coefficients. For this purpose, we need various local categories of a finite…
Locally symmetric spaces like $SL(n,\mathbb Z)\backslash SL_n(\mathbb R)/SO(n)$ contain immersed compact flat manifolds of dimension equal to the real rank. We give a lower bound for the contribution of these cycles to the homology of…
Quite often real-world networks can be thought of as being symmetric, in the abstract sense that vertices can be found to have similar or equivalent structural roles. However, traditional measures of symmetry in graphs are based on their…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…
We study local-global principles for torsors under reductive linear algebraic groups over semi-global fields; i.e., over one variable function fields over complete discretely valued fields. We provide conditions on the group and the…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
Topological cyclic homology is a refinement of Connes--Tsygan's cyclic homology which was introduced by B\"okstedt--Hsiang--Madsen in 1993 as an approximation to algebraic $K$-theory. There is a trace map from algebraic $K$-theory to…
Within the context of topological data analysis, the problems of identifying topological significance and matching signals across datasets are important and useful inferential tasks in many applications. The limitation of existing solutions…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we…
We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of math.CT/9902151 disappear.…
Topological invariants have played a fundamental role in the advancement of theoretical high energy physics. Physicists have used several kinematic techniques to distinguish new physics predictions from the Standard Model (SM) of particle…
We introduce the notion of a Thom class of a current and define the localized intersection of currents. In particular we consider the situation where we have a smooth map of manifolds and study localized intersections of the source manifold…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…
Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…
A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…
Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer…
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…