Searcharxiv⌕ Search

arXiv · 2610.12087

Group maps on initial intervals

Abstract

Let $S$ denote a $k$-subset of $\mathbb{Z}$. Let $G$ be a (multiplicative) group of size $k$. Assume that there exists a function $φ\colon S \to G$ that is injective and that satisfies the following: If $x, y, z \in S$ and $z = xy$, then $φ(z) = φ(x) φ(y)$. In 1990, Forcade and Pollington conjectured that if $S = \{ 1, 2, \ldots, k \}$, then $G$ is abelian. This has been a long-standing conjecture highlighted by Richard K. Guy as an unsolved problem, and this problem appears to have remained open, with its open status having been noted by Caicedo et al. in 2021 [Electron. J. Combin.]. We succeed in proving the Forcade-Pollington conjecture in the affirmative and in full generality.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2026-10-08. Group maps on initial intervals. https://searcharxiv.com/abs/2610.12087

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗