Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.13940

Fixed point indices and fixed words at infinity of selfmaps of graphs

Qiang Zhang·Xuezhi Zhao
View original source ↗Read source document ↗Export metadata ↓

Abstract

Indices of fixed point classes play a central role in Nielsen fixed point theory. Jiang-Wang-Zhang proved that for selfmaps of graphs and surfaces, the index of any fixed point class has an upper bound called its characteristic. In this paper, we study the difference between the index and the characteristic for selfmaps of graphs. First, for free groups, we extend attracting fixed words at infinity of automorphisms into that of injective endomorphisms. Then, by using relative train track technique, we show that the difference mentioned above is quite likely to be the number of equivalence classes of attracting fixed words of the endomorphism induced on the fundamental group. Since both of attracting fixed words and the existed characteristic are totally determined by endomorphisms themselves, we give a new algebraic approach to estimate indices of fixed point classes of graph selfmaps. As consequence, we obtain an upper bound for attracting fixed words of injective endomorphisms of free groups, generalizing the one for automorphisms due to Gaboriau-Jaeger-Levitt-Lustig. Furthermore, we give a simple approach to roughly detecting whether fixed words exist or not.

Explore related subjects

math.GTmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiang Zhang, Xuezhi Zhao. 2020-05-25. Fixed point indices and fixed words at infinity of selfmaps of graphs. https://arxiv.org/abs/2003.13940

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT↗
arXiv2026

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT↗
arXiv2026

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT↗