Related papers: The Johnson homomorphism, embedding calculus and g…
The contraction of the image of the Johnson homomorphism is called the Chillingworth class. In this paper, we derive a combinatorial description of the Chillingworth class for Putman's subsurface Torelli groups. We also prove the naturality…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component of magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to…
A Collino cycle is a higher cycle on the Jacobian of a hyperelliptic curve. The universal family of Collino cycles naturally gives rise to a normal function, whose induced monodromy relates to the hyperelliptic Johnson homomorphism. Colombo…
In the work of C. Donovan and N. A. Scoville, the homotopy type of the Morse complex of the extended star graph which is obtained as the one-point union of n paths of length 2 was determined by using star clusters and Cluster Lemma. In this…
We establish compatibility of Lie structures that appear in homotopy calculus of functors and isotopy calculus of embeddings. On one hand, we give a new proof of the Johnson--Arone--Mahowald result describing the layers of the Goodwillie…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…
We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…
The Jones polynomial is a famous link invariant that can be defined diagrammatically via a skein relation. Khovanov homology is a richer link invariant that categorifies the Jones polynomial. Using spectral sequences, we obtain a skein-type…
The homology cobordism group of homology cylinders is a generalization of both the mapping class group of surfaces and the string link concordance group. We consider extensions of Johnson homomorphisms of a mapping class group, Milnor…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We derive a second-order differential equation for the two-loop sunrise graph in two dimensions with arbitrary masses. The differential equation is obtained by viewing the Feynman integral as a period of a variation of a mixed Hodge…
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
Let E be a transitive Courant algebroid with scalar product of neutral signature. A generalized almost complex structure \mathcal J on E is a skew-symmetric smooth field of endomorphisms of E which squares to minus the identity. We say that…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…