Search arXivSearch

arXiv · 1803.10487

Quandles of cyclic type with several fixed points

Abstract

A quandle of cyclic type of order $n$ with $f\geq 2$ fixed points is such that each of its permutations splits into $f$ cycles of length $1$ and one cycle of length $n-f$. In this article we prove that there is only one such connected quandle, up to isomorphism. This is a quandle of order $6$ and $2$ fixed points, known in the literature as octahedron quandle. We prove also that, for each $f\geq 2$, the non-connected versions of these quandles only occur for orders $n$ in the range $f+2 \leq n \leq 2f$ and that, for each $f>1$, there is only one such quandle of order $2f$ with $f$ fixed points, up to isomorphism. Still in the range $f+2 \leq n \leq 2f$, we present sufficient conditions for the existence of such quandles, writing down their permutations; we also show how to obtain new quandles form old ones, leaning on the notion of common fixed point.

Explore related subjects

Keep this discovery

BibTeXRIS

António Lages, Pedro Lopes. 2018-03-28. Quandles of cyclic type with several fixed points. https://arxiv.org/abs/1803.10487

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR