Related papers: Orbit counting in conjugacy classes for free group…

The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that…

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

We examine a condition on a simply connected 2-complex X ensuring that groups acting properly on X are coherent. This extends earlier work on 2-complexes with negative sectional curvature which covers the case that G acts freely. Our…

Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called the automorphism orbits of $G$, and their number is denoted by $\omega(G)$. Let $\mathbb{F}$ be an infinite field, and let $UT_n(\mathbb{F})$ denote the…

We construct a boundary of a finite rank free group relative to a finite list of conjugacy classes of maximal cyclic subgroups. From the cut points and uncrossed cut pairs of this boundary we construct a simplicial tree on which the group…

We study the asymptotic behaviour of the orbit-counting function and a dynamical Mertens' theorem for the full $G$-shift for a finitely-generated torsion-free nilpotent group $G$. Using bounds for the M{\"o}bius function on the lattice of…

For a simple graph $G=(V,E),$ let $\mathcal{S}_+(G)$ denote the set of real positive semidefinite matrices $A=(a_{ij})$ such that $a_{ij}\neq 0$ if $\{i,j\}\in E$ and $a_{ij}=0$ if $\{i,j\}\notin E$. The maximum positive semidefinite…

A conjugation-free geometric presentation of a fundamental group is a presentation with the natural topological generators $x_1, ..., x_n$ and the cyclic relations: $x_{i_k}x_{i_{k-1}} ... x_{i_1} = x_{i_{k-1}} ... x_{i_1} x_{i_k} = ... =…

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

Let $\Lambda_0$ be an ordered abelian group. We show how an $\mathrm{ATF}(\mathbb{Z}\times\Lambda_0)$ group -- that is, a group admitting a free affine action without inversions on a $\mathbb{Z}\times\Lambda_0$-tree -- admits a natural…

The classical prime geodesic theorem (PGT) gives an asymptotic formula (as $x$ tends to infinity) for the number of closed geodesics with length at most $x$ on a hyperbolic manifold $M$. Closed geodesics correspond to conjugacy classes of…

We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the…

We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…

We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free…

We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the…

Let G be a finite group. An element x in G is a real element if x is conjugate to its inverse in G. For x in G, the conjugacy class x^G is said to be a real conjugacy class if every element of x^G is real. We show that if 4 divides no real…

The conjugacy growth function counts the number of distinct conjugacy classes in a ball of radius $n$. We give a lower bound for the conjugacy growth of certain branch groups, among them the Grigorchuk group. This bound is a function of…

We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…

The average size of connected vertex subsets of a connected graph generalises a much-studied parameter for subtrees of trees. For trees, the possible values of this parameter are critically affected by the presence or absence of vertices of…

This note presents the study of the conjugacy classes of elements of some given finite order n in the Cremona group of the plane. In particular, it is shown that the number of conjugacy classes is infinite if n is even, n=3 or n=5, and that…