Group Theory
Infinitely many Nielsen classes in mapping class groups and free-group automorphism groups
Wenchang Yang
We formulate a root-conjugation criterion for producing generating pairs and detecting Nielsen inequivalence by a
polynomial symmetric-trace invariant. The method simultaneously treats mapping class groups and automorphism groups of free groups. We prove that $\mathrm{Mod}(\Sigma_g)$, $g\ge2$, and $\mathrm{Aut}(F_n)$, $\mathrm{SAut}(F_n)$, $\mathrm{Out}(F_n)$ and $\mathrm{SOut}(F_n)$, $n\ge3$, have countably infinitely many Nielsen classes of generating pairs. A sign parameter unifies the full and special automorphism-group constructions, with common generation arguments and trace
polynomials. The same homology representations give the corresponding results for $\mathrm{Sp}_{2g}(\mathbb{Z})$, $g\ge2$, and $\mathrm{SL}_n(\mathbb{Z})$ and $\mathrm{GL}_n(\mathbb{Z})$, $n\ge3$. This answers Hirose–Monden's low-genus question and Kapovich's Question 8.1.
Read the full abstract ▾
Group Theory
On weak commutativity between $n$ isomorphic groups, $n \geq 2$
Said N. Sidki, Noraí R. Rocco, Ricardo N. de Oliveira et al. (+1 more)
The Weak Commutativity Group was defined by the first author in the early 1980's as $ \chi(H) = \langle H, H^\psi \mid [h,h^\psi] = 1, \ \forall h \in H \rangle $ where $H$ and $H^\psi$ are isomorphic groups under an isomorphism $\psi$, and proved that $\chi(-)$, seen as a group operator, preserved the classes of solvable groups, finite groups, finite $p$-groups, and perfect groups. The list has grown considerably since then (see references). It is clear that the iterated operator $\chi^n (-)$ also preserves the same classes. However, we observe that for $n \geq 2$ many of the $2^n$ $H$-generating copies of $\chi^n (H)$ fail to weakly commute among themselves. We introduce in this paper the "$n$-ary Weak Commutativity Group" generated by $n$ copies of $H$ which weakly commute among themselves; that is $ \chi_n (H) = \langle H, H^\psi, \dots, H^{\psi_{n-1}} \mid [h^{\psi_i}, h^{\psi_j}] = 1, \ \forall h \in H, \ 0 \leq i < j \leq n-1 \rangle $ (by definition, $H^{\psi_0} = H, H^{\psi_1} = H^\psi$). We study quotients of $\chi^n (H)$ which are also simultaneously quotients of $\chi_{2^n} (H)$; we refer to them as Hybrid $\chi^n (H)$ - $\chi_{2^n} (H)$ groups. For $n=2$ we determine the largest common quotient $Q(H)$ of $\chi^2(H)$ and $\chi_4(H)$, that is, the largest hybrid $\chi^2(H)$-$\chi_4(H)$ group. A related class of groups in our study is $\chi(n,H)$, a quotient of $\chi_n(H)$, previously introduced by the third named author in his 2007 doctoral thesis. We prove that this class of groups continues to preserve finiteness, nilpotency and perfectness, and we provide detailed information about their structure. In contrast, $\chi_n(H)$ behaves differently: $\chi_3(C_2 \times C_2)$ is infinite, while $\chi_3(C_{p^t} \times C_{p^u})$ is finite for $p$ odd.
Read the full abstract ▾
All authors Said N. Sidki, Noraí R. Rocco, Ricardo N. de Oliveira, Dmytro Savchuk
Group Theory
Boundary Algorithms for Thompson Groups
Ayberk Zeytin
We construct a deterministic Farey-boundary
algorithm converting a cyclic prefix table for an element of $\mathsf T$ into a word in addressed boundary flips. The reduction uses rational boundary pairs and cyclic order, with a marked edge determining the residual modular correction. Its unmarked stage uses at most twice the minimum number of diagonal exchanges. For input size $s$, the complete output has $O(s)$ factors, encoded length $O(s^2)$, and running time $O(s^3)$. Adjoining shuffles extends the construction to $\mathsf V$ with
polynomial bounds. We also give explicit boundary generating sets and their local flip–shuffle relations. Changes of generators in the Lochak–Schneps and Bleak–Quick presentations yield a two-flip presentation of $\mathsf T$ and a presentation of $\mathsf V$ with two flips, one shuffle, and nine relations.
Read the full abstract ▾
Group Theory · Cross-listed from cs.FL
Irreducibility of Endomorphisms of Finitely Generated Free Semigroups
Paul C. Bell, Eva Foster and Daniel Reidenbach
We introduce and investigate the irreducibility of endomorphisms of finitely generated free semigroups, i.e., we investigate when an endomorphism $\phi: \Sigma^+ -> \Sigma^+$, where $\Sigma$ is any alphabet, can be nontrivially expressed as a composition $\phi = \psi_2 \circ \psi_1$ of endomorphisms $\psi_1, \psi_2: \Sigma^+ -> \Sigma^+$. We, hence, study a notion of primality in the endomorphism monoid of the free semigroup—a natural and fundamental concept in this algebraic structure. We establish that irreducibility is a nontrivial property for the class of so-called rank-preserving endomorphisms, and we provide a characteristic condition separating the reducible and irreducible endomorphisms. We also characterise when an endomorphism is a factor of another endomorphism, analyse the non-uniqueness of factorisations of a rank-preserving endomorphism into its irreducible components, and investigate the use of incidence
matrices to give insights into the (ir-)reducibility of rank-preserving endomorphisms.
Read the full abstract ▾
Group Theory · Cross-listed from math-ph
A Cohomological Characterization of the Clifford Hierarchy
Junaid Aftab
The Clifford hierarchy plays a central role in fault-tolerant
quantum computation, but its higher levels remain only partially understood. Recent work on
quantum higher order
Fourier analysis characterizes membership in the Clifford hierarchy using
quantum derivatives, but does not provide an explicit description of the individual levels. In this work, we address this problem by showing that the collection of
quantum derivatives of a
unitary operator forms a non-abelian \(1\)-cocycle, and conversely that every such \(1\)-cocycle arises from a
unitary operator. This yields a recursive cohomological characterization of the Clifford hierarchy. We then specialize this framework to the third level and decompose the cocycle data into symplectic, affine, and phase components, each admitting a cohomological interpretation. As applications, we give a new proof that every two-qudit gate in the third level of the Clifford hierarchy is semi-Clifford, and prove for the first time that every three-qudit gate in the third level is semi-Clifford.
Read the full abstract ▾
Group Theory · Cross-listed from math.RT
The Broué invariant of a Morita equivalence with an endopermutation source
Xin Huang
A perfect isometry $I$ (introduced by Broué) between two blocks $b$ and $c$ is a frequent phenomenon in the block theory of finite groups. It maps an irreducible character $\psi$ of $c$ to $\pm$ an irreducible character of $b$. Broué proved that the ratio of the codegrees of $\psi$ and $I(\psi)$ is a rational number with $p$-value zero and that its class in $\mathbb{F}_p$ is independent of $\psi$. This element is called the Broué invariant of $I$ by Boltje. The goal of this paper is to show that if $I$ comes from a Morita equivalence with an endopermutation source $V$, then, up to a sign, the Broué invariant of $I$ is determined by local data of $b$ and $c$. Therefore, up to a sign, it is independent of the endopermutation-source Morita equivalence. Moreover, we show that the sign factor is given by the reduction of the rank of $V$ modulo $p$. As a corollary, we obtain that the Isaacs–Navarro refinement of the Alperin–McKay
conjecture holds for inertial blocks.
Read the full abstract ▾
Group Theory · Cross-listed from math.GN
Profinite rigidity and quandle colourings
Jacques Darné
We show that the numbers of colourings of a link by all finite quandles is equivalent, as an invariant of links, to the profinite completion of the peripheral system. This allows us to reformulate the classical question of the completeness of the former invariant in terms of profinite rigidity. We also develop some profinite quandle theory, and we show that a topological quandle is profinite if and only if it is compact and totally discontinuous and its group of inner automorphism is relatively compact in its homeomorphism group.
Read the full abstract ▾