Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.03930

Primitive Positive Constructions Among Finite Permutation Groups

Sebastian Meyer
View original source ↗Read source document ↗Export metadata ↓

Abstract

Primitive positive constructions of first order structures have been shown to be a very useful tool in universal algebra for the study of constraint satisfaction problems. However, they seemed to be very rarely studied in classical algebra such as group theory. This paper fills in this gaps by looking at structures and obstructions based on permutation groups and giving a full classification in this sub-area. This special case is also very important for the generalization to all first order structures as every permutation group describes an easy-to-check necessary condition for the existence of primitive positive constructions, also between structures that are not at all linked to permutation groups.

Explore related subjects

math.GRmath.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sebastian Meyer. 2026-06-02. Primitive Positive Constructions Among Finite Permutation Groups. https://arxiv.org/abs/2606.03930

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗