Related papers: Local-global intersection homology
Matlis duals of local cohomology modules are investigated with respect to many different topics (see section 0 - Introduction). One of these topics are complete intersections - see Corollary 1.1.4.
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…
There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this…
For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…
Most complex systems can be captured by graphs or networks. Networks connect nodes (e.g.\ neurons) through edges (synapses), thus summarizing the system's structure. A popular way of interrogating graphs is community detection, which…
Recent evidence indicates that the abundance of recurring elementary interaction patterns in complex networks, often called subgraphs or motifs, carry significant information about their function and overall organization. Yet, the…
In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
We develop a formalism of cohomological descent encoding adelic points and obstructions to local-global principle on algebraic stacks. As an application, by constructing new obstructions using the formalism, we obtain some comparison…
We investigate conditions that guarantee local indicability of groups that admit presentations with the homology of a circle, generalizing a result of J. Howie for two-relator presentations. We apply our results to investigate local…
Let G be an algebraic group and let X be a smooth integral scheme over a field k. In this paper we construct homology-type groups $H_i(X,G)$ by considering cycles in the simplicial scheme $BG\times X (an idea suggested by Andrei Suslin). We…
We outline the main features of the definitions and applications of crossed complexes and cubical $\omega$-groupoids with connections. These give forms of higher homotopy groupoids, and new views of basic algebraic topology and the…
In this paper, we answer a question of Dwyer, Greenlees, and Iyengar by proving a local ring $R$ is a complete intersection if and only if every complex of $R$-modules with finitely generated homology is proxy small. Moreover, we establish…
The purpose of this paper is twofold: 1. we prove the triangulability of smooth orbifolds with corners, generalizing the same statement for orbifolds. 2. based on 1, we propose a new homology theory. We call it geometric homology theory…
We introduce a generalization of the notion of local homology module, which we call a local homology module with respect to a pair of ideals $\left(I,J\right)$, and study its various properties such as vanishing, co-support and…
Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
Orbit codes are a family of codes employable for communications on a random linear network coding channel. The paper focuses on the classification of these codes. We start by classifying the conjugacy classes of cyclic subgroups of the…
Homological algebra is often understood as the translator between the world of topology and algebra. However, this branch of mathematics is worth studying by itself, given that it provides fascinating perspectives about other disciplines,…