English
Related papers

Related papers: On diagram-chasing in double complexes

200 papers

We use the homological perturbation lemma to produce explicit formulas computing the class in the twisted de Rham complex represented by an arbitrary polynomial. This is a non-asymptotic version of the method of Feynman diagrams. In…

Mathematical Physics · Physics 2019-11-05 Theo Johnson-Freyd

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

Category Theory · Mathematics 2014-03-20 Adam J. Przezdziecki

Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…

Combinatorics · Mathematics 2017-02-20 Ori Parzanchevski , Ron Rosenthal

Finding point-wise correspondences between images is a long-standing problem in image analysis. This becomes particularly challenging for sketch images, due to the varying nature of human drawing style, projection distortions and viewport…

Computer Vision and Pattern Recognition · Computer Science 2021-01-05 Pablo Navarro , José Ignacio Orlando , Claudio Delrieux , Emmanuel Iarussi

Consider an exact couple in a semiabelian category in the sense of Palamodov, i.e., in an additive category in which every morphism has a kernel as well as a cokernel and the induced morphism between coimage and image is always monic and…

Category Theory · Mathematics 2014-06-27 Yaroslav Kopylov , Sven-Ake Wegner

We investigate how the concepts of intersection and sums of subobjects carry to exact categories. We obtain a new characterisation of quasi-abelian categories in terms of admitting admissible intersections in the sense of Hassoun and Roy.…

Category Theory · Mathematics 2021-07-06 Thomas Brüstle , Souheila Hassoun , Aran Tattar

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

Combinatorics · Mathematics 2024-03-05 Oswin Aichholzer , Joachim Orthaber , Birgit Vogtenhuber

Graph-based representations such as Scene Graphs enable localization in structured indoor environments by matching a locally observed graph, constructed from sensor data, to a prior map. This process is particularly challenging in…

This paper provides a systematization of some recent results in homology of algebras. Our main theorem gives criteria under which the homology of a diagram algebra is isomorphic to the homology of the subalgebra on diagrams having the…

Algebraic Topology · Mathematics 2025-08-26 Guy Boyde

This paper studies questions of coherence and strictification related to self-similarity - the identity $S\cong S\otimes S$ in a (semi-)monoidal category. Based on Saavedra's theory of units, we first demonstrate that strict self-similarity…

Category Theory · Mathematics 2015-02-10 Peter Hines

We study abelian lattice gauge theory defined on a simplicial complex with arbitrary topology. The use of dual objects allows one to reformulate the theory in terms of new dynamical variables; however, we avoid the use of the dual lattice…

High Energy Physics - Theory · Physics 2007-05-23 Mark Rakowski , Siddhartha Sen

We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…

Algebraic Topology · Mathematics 2014-05-13 Peter Bubenik , Jonathan A. Scott

The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…

Algebraic Topology · Mathematics 2019-04-22 Shaun V. Ault

Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…

Algebraic Topology · Mathematics 2025-10-14 Ellen Gasparovic , Emilie Purvine , Radmila Sazdanovic , Bei Wang , Yusu Wang , Lori Ziegelmeier

The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…

Algebraic Geometry · Mathematics 2014-03-18 Tommaso de Fernex , János Kollár , Chenyang Xu

We investigate relative CS-Baer objects in abelian categories in relationship with other relevant classes of objects such as relative Baer objects, extending objects, objects having certain summand intersection properties and relative…

Category Theory · Mathematics 2022-01-26 Septimiu Crivei , Derya Keskin Tütüncü , Simona Maria Radu , Rachid Tribak

As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…

Combinatorics · Mathematics 2025-08-13 Xiongfeng Zhan , Xueyi Huang , Lu Lu

We prove the existence of two long exact sequences relating the Hochschild cohomology of a triangular matrix algebra with the Hochschild homology of its component subalgebras. We also study the structure of the maps of the first sequence.

K-Theory and Homology · Mathematics 2007-05-23 Jorge A. Guccione , Juan J. Guccione

We establish a large class of homotopy coherent Morita-equivalences of Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical Dold-Kan…

Representation Theory · Mathematics 2022-03-18 Tashi Walde

This paper extends the problem of 2-dimensional palindrome search into the area of approximate matching. Using the Hamming distance as the measure, we search for 2D palindromes that allow up to $k$ mismatches. We consider two different…

Data Structures and Algorithms · Computer Science 2020-02-27 Dina Sokol