Related papers: Inductive construction of path homology chains

Prime path coverage is a powerful structural testing criterion, but generating all prime paths in a directed graph remains computationally challenging due to the potentially exponential number of them. Existing approaches typically rely on…

We use assembly maps to study $\mathbf{TC}(\mathbb{A}[G];p)$, the topological cyclic homology at a prime $p$ of the group algebra of a discrete group $G$ with coefficients in a connective ring spectrum $\mathbb{A}$. For any finite group, we…

With the growing adoption of AI-based systems across everyday life, the need to understand their decision-making mechanisms is correspondingly increasing. The level at which we can trust the statistical inferences made from AI-based…

The main goal of this article is to construct some geometric invariants for the topology of the set $\mathcal{F}$ of flat connections on a principal $G$-bundle $P\,\longrightarrow\, M$. Although the characteristic classes of principal…

Higher order group cohomology is defined and first properties are given. Using modular symbols, an Eichler-Shimura homomorphism is constructed mapping spaces of higher order cusp forms to higher order cohomology groups.

In this work, we introduce a novel approach based on algebraic topology to enhance graph convolution and attention modules by incorporating local topological properties of the data. To do so, we consider the framework of sheaf neural…

Excitations in (3+1)D topologically ordered phases have very rich structures. (3+1)D topological phases support both point-like and string-like excitations, and in particular the loop (closed string) excitations may admit knotted and linked…

Accurate lane topology is essential for autonomous driving, yet traditional methods struggle to model the complex, non-linear structures-such as loops and bidirectional lanes-prevalent in real-world road structure. We present SeqGrowGraph,…

In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

In this paper, we consider a structural and geometric property of graphs, namely the presence of large expanders. The problem of finding such structures was first considered by Krivelevich [SIAM J. Disc. Math. 32 1 (2018)]. Here, we show…

The cohomology of the degree-$n$ general linear group over a finite field of characteristic $p$, with coefficients also in characteristic $p$, remains poorly understood. For example, the lowest degree previously known to contain nontrivial…

For integer $n$, the $n$-iterated line graph $L^n(G)$ of an undirected graph $G$ is defined to be $L(L^{n-1}(G))$, where $L^1(G)$ is the line graph $L(G)$ of $G$. In this paper we introduce hamiltonian path index. Hamiltonian path index,…

Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…

We show that if a graph $G$ admits a quasi-isometry $\phi$ to a graph $H$ of bounded path-width, then we can assign a non-negative integer length to each edge of $H$, such that the same function $\phi$ is a quasi-isometry to this weighted…

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…

Homotopy type theory is a logical setting based on Martin-L\"of type theory in which geometric constructions and proofs can be carried out synthetically. Here, types can be interpreted as spaces up to homotopy, and proofs as…

Paths $P^1,\ldots,P^k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P^i$ and $P^j$ have neither common vertices nor adjacent vertices. For a fixed integer $k$, the $k$-Induced Disjoint Paths problem is to decide if a graph…

The cohomology theory known as Tmf, for "topological modular forms," is a universal object mapping out to elliptic cohomology theories, and its coefficient ring is closely connected to the classical ring of modular forms. We extend this to…