Related papers: Orbit counting in conjugacy classes for free group…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…
Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…
Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.
A group $G$ has property $R_\infty$ if for every $\phi\in Aut(G)$, there are an infinite number of $\phi$-twisted conjugacy classes of elements in $G$. In this note, we determine the $R_\infty$-property for $G=\pi_1(M)$ for all geometric…
This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given…
We prove that the conjugacy problem in Out(Fm) is solvable for the class of outer automorphisms whose restrictions to their polynomial subgroups are of finite order. To do this, we first investigate the structure of suspensions of free…
We study Hecke algebras of groups acting on trees with respect to geometrically defined subgroups. In particular, we consider Hecke algebras of groups of automorphisms of locally finite trees with respect to vertex and edge stabilizers and…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
We are concerned with mapping class groups of surfaces with nonempty boundary. We present a very natural method, due to Thurston, of finding many different left orderings of such groups. The construction involves equipping the surface with…
We study widths of conjugacy classes in anisotropic higher rank $S$-arithmetic groups of orthogonal type. Assuming the GRH, we prove that many such groups have bounded conjugacy width. For example, this holds if the degree is greater or…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
Given any connected compact orientable surface, a pair of mapping classes are said to be procongruently conjugate if they induce a conjugate pair of outer automophisms on the profinite completion of the fundamental group of the surface. For…
Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…
We investigate how exchange-graph techniques can be used to study the topology of strata of meromorphic quadratic differentials. The exchange graph provides natural generators for the fundamental group. By extending the combinatorics of…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power…