Related papers: The Johnson homomorphism, embedding calculus and g…
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the…
Let Map(K,X) denote the space of pointed continuous maps from a finite cell complex K to a space X. Let E_* be a generalized homology theory. We use Goodwillie calculus methods to prove that under suitable conditions on K and X, Map(K, X)…
In this paper we consider endomorphisms of an undirected cycle graph from Semigroup Theory perspective. Our main aim is to present a process to determine sets of generators with minimal cardinality for the monoids $wEnd(C_n)$ and $End(C_n)$…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
We consider two-sided Jacobi matrices whose coefficients are obtained by continuous sampling along the orbits of a homeomorphim of a compact metric space. Given an ergodic probability measure, we study the topological structure of the…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
We first develop a general theory of Johnson filtrations and Johnson homomorphisms for a group $G$ acting on another group $K$ equipped with a filtration indexed by a "good" ordered commutative monoid. Then, specializing it to the case…
Graph homologies are powerful tools to compute the rational homotopy group of the space of long embeddings. Two graph homologies have been invented from two approaches to study the space of long embeddings: the hairy graph homology from…
This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphisms from a complete bipartite graph into a general bipartite…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
The so-called Johnson homomorphisms $(\tau_k)_{k \geq 1}$ embed the graded space associated to the Johnson filtration of a surface with one boundary component into the Lie ring of positive symplectic derivations $D(H)$. In this paper, we…
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
From the viewpoint of Johnson graphs as slices of a hypercube, we derive a novel algebra homomorphism $\sharp$ from the universal Racah algebra $\Re$ into $U(\mathfrak{sl}_2)$. We use the Casimir elements of $\Re$ to describe the kernel of…
Focke, Goldberg, and \v{Z}ivn\'y (arXiv 2017) prove a complexity dichotomy for the problem of counting surjective homomorphisms from a large input graph G without loops to a fixed graph H that may have loops. In this note, we give a short…
This is a biased survey for the Johnson homomorphisms of the automorphism groups of free groups. We just exposit some well known facts and recent developments for the Johnson homomorphisms and its related topics.
We count cycles of an unbounded length in generalized Johnson graphs. Asymptotics of the number of such cycles is obtained for certain growth rates of the cycle length.
We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation. Previous graph embeddings have limited expressiveness and either cannot…
We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than…
In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.
Infinite presentations are given for all of the higher Torelli groups of once-punctured surfaces. In the case of the classical Torelli group, a finite presentation of the corresponding groupoid is also given, and finite presentations of the…