中文
相关论文

相关论文: Edge stabilization in the homology of graph braid …

200 篇论文

We establish a homotopy-theoretic description of the homology of stable moduli spaces of $(2n+1)$-dimensional manifold triads $(N, \partial^h N, \partial^v N)$ with fixed $\partial^v N$, whenever $n \geq 3$ and $(N, \partial^h N)$ is…

代数拓扑 · 数学 2025-10-22 João Lobo Fernandes

We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…

代数拓扑 · 数学 2023-09-12 Thorben Kastenholz , Robin J. Sroka

We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…

代数拓扑 · 数学 2025-06-25 Enoch Fedah , Benjamin C. Ward

We study the rational homology of the Deligne--Mumford compactification $\overline{\mathcal M}_{g,n}$ of the moduli space of stable curves via a family of Morse functions, namely the $\text{sys}_T$ functions. Exploiting the geometric and…

微分几何 · 数学 2026-01-05 Changjie Chen

In this paper we apply the theory of finitely generated FI-modules developed by Church, Ellenberg and Farb to certain sequences of rational cohomology groups. Our main examples are the cohomology of the moduli space of n-pointed curves, the…

几何拓扑 · 数学 2013-10-01 Rita Jimenez Rolland

It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…

计算复杂性 · 计算机科学 2023-01-25 Rui Xue

An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…

数据结构与算法 · 计算机科学 2017-11-28 Zhuan Khye Koh , Laura Sanità

We give explicit formulas for the asymptotic Betti numbers, over an arbitrary field, of the ordered configuration spaces of a graph. In characteristic zero, we further give explicit formulas for the asymptotic multiplicities in homology of…

代数拓扑 · 数学 2025-10-02 Louis Hainaut , Ben Knudsen , Nicholas Wawrykow

Mapping class groups satisfy cohomological stability. In this note we show how results by Bestvina and Fujiwara imply that the bounded cohomology does not stabilize, additionally we show that stabily polynomials in the Mumford-Morita-Miller…

代数拓扑 · 数学 2023-08-29 Thorben Kastenholz

This paper continues the investigation of the configuration space of two distinct points on a graph. We analyze the process of adding an additional edge to the graph and the resulting changes in the topology of the configuration space. We…

代数拓扑 · 数学 2015-03-17 Michael Farber , Elizabeth Hanbury

For a finite group $D$, we study categorical factorisation homology on oriented surfaces equipped with principal $D$-bundles, which `integrates' a (linear) balanced braided category $\mathcal{A}$ with $D$-action over those surfaces. For…

量子代数 · 数学 2023-05-17 Corina Keller , Lukas Müller

The homology of configuration spaces of point-particles in manifolds has been studied intensively since the 1970s; in particular it is known to be stable if the underlying manifold is connected and open. Closely related to configuration…

代数拓扑 · 数学 2020-10-06 Martin Palmer

We prove that group homology of the diffeomorphism group of $\#^g S^n \times S^n$ as a discrete group is independent of $g$ in a range, provided that $n>2$. This answers the high dimensional version of a question posed by Morita about…

代数拓扑 · 数学 2017-09-12 Sam Nariman

We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…

交换代数 · 数学 2024-11-13 Akihiro Higashitani

We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked…

代数几何 · 数学 2011-08-29 Stefano Maggiolo , Nicola Pagani

A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…

代数拓扑 · 数学 2025-02-05 Joaquin Diaz Boils

Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as a computational step in neural networks or deep learning. In…

机器学习 · 计算机科学 2020-11-17 Padraig Corcoran , Bailin Deng

Homological stability for sequences of groups is often proved by studying the spectral sequence associated to the action of a typical group in the sequence on a highly-connected simplicial complex whose stabilizers are related to previous…

几何拓扑 · 数学 2018-03-16 Allen Hatcher , Karen Vogtmann

Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a…

Let $I\subseteq R=\kk[x_1,...,x_n]$ be a homogeneous equigenerated ideal of degree $r$. We show here that the shapes of the Betti tables of the ideals $I^d$ stabilize, in the sense that there exists some $D$ such that for all $d\geq D$,…

交换代数 · 数学 2011-06-14 Gwyneth Whieldon