English
Related papers

Related papers: The Johnson homomorphism, embedding calculus and g…

200 papers

We study the cokernel of the Johnson homomorphism for the mapping class group of a surface with one boundary component. A graphical trace map simultaneously generalizing trace maps of Enomoto-Satoh and Conant-Kassabov-Vogtmann is given, and…

Quantum Algebra · Mathematics 2016-01-20 Jim Conant

We propose an approach to study non-Abelian Iwasawa theory, using the idea of Johnson homomorphisms in low dimensional topology. We introduce arithmetic analogues of Johnson homomorphisms/maps, called the p-Johnson homomorphisms/maps,…

Number Theory · Mathematics 2017-02-01 Masanori Morishita , Yuji Terashima

We study stable Sp-decompositions of the cokernel of the Johnson homomorphism. Continuing the work of Conant in 2016, which identified the 1-loop part of the Johnson cokernel as the Enomoto-Satoh obstruction, we study the 2-loop part. Using…

Geometric Topology · Mathematics 2025-12-01 Yusuke Kuno , Masatoshi Sato

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

Combinatorics · Mathematics 2023-05-08 Delia Garijo , Andrew Goodall , Lluís Vena

The Johnson filtration of the mapping class group of a compact, oriented surface is the descending series consisting of the kernels of the actions on the nilpotent quotients of the fundamental group of the surface. Each term of the Johnson…

Group Theory · Mathematics 2018-08-10 Kazuo Habiro , Gwenael Massuyeau

The Johnson graph $J(n,i)$ is defined to the graph whose vertex set is the set of all $i$-element subsets of $\{1,\ldots,n\}$, and two vertices are joined whenever the cardinality of their intersection is equal to $i-1$. In Ramras and…

Combinatorics · Mathematics 2014-12-17 Ashwin Ganesan

We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give…

Combinatorics · Mathematics 2014-08-12 Deborah Lockett , John K. Truss

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

Combinatorics · Mathematics 2014-04-23 Yangjing Long

We suggest an extension of a certain logarithm of the total Johnson map in terms of solvable Lie groups. Here, the domain of the map is extended to a subset consisting of exponential solvable elements in the mapping class group of a…

Geometric Topology · Mathematics 2023-11-28 Takefumi Nosaka

This paper surveys work on generalized Johnson homomorphisms and tools for studying them. The goal is to unite several related threads in the literature and to clarify existing results and relationships among them using Hodge theory. We…

Geometric Topology · Mathematics 2020-12-24 Richard Hain

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

Logic in Computer Science · Computer Science 2021-12-20 Jonathan Prieto-Cubides

Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…

Combinatorics · Mathematics 2010-09-15 Zh. G. Nikoghosyan

We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…

Neurons and Cognition · Quantitative Biology 2014-12-10 Peteris Daugulis

We provide a new construction of the topological cyclic homology $TC(C)$ of any spectrally-enriched $\infty$-category $C$, which affords a precise algebro-geometric interpretation of the cyclotomic trace map $K(X) \to TC(X)$ from algebraic…

Algebraic Topology · Mathematics 2017-10-18 David Ayala , Aaron Mazel-Gee , Nick Rozenblyum

On a closed symplectic surface Sigma of genus two or more, we give a new construction of an extended flux map (a crossed homomorphism from the symplectomorphism group Symp(Sigma) to the cohomology group H^1(Sigma;R) that extends the flux…

Geometric Topology · Mathematics 2009-09-04 Matthew B. Day

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

Combinatorics · Mathematics 2019-03-19 Jeffrey Beyerl , Cameron Sharpe

In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…

Machine Learning · Computer Science 2020-07-03 Hoang NT , Takanori Maehara

A homology cylinder of a surface induces an automorphism of the completed group ring of the fundamental group of the surface. We introduce a new method of computing the automorphism by using the Goldman Lie algebra of the surface or some…

Geometric Topology · Mathematics 2020-10-09 Shunsuke Tsuji

By introducing a refinement of the Goldman-Turaev Lie bialgebra, we interpret the divergence cocycle in the Kashiwara-Vergne problem and the Enomoto-Satoh obstructions for the surjectivity of the Johnson homomorphisms as some part of a…

Geometric Topology · Mathematics 2014-06-03 Nariya Kawazumi

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

Combinatorics · Mathematics 2026-01-23 Ziemowit Kostana , Jarosław Swaczyna , Agnieszka Widz
‹ Prev 1 2 3 10 Next ›