Generalized Cyclotomic Mappings

• Generalized cyclotomic mappings are finite-field functions defined piecewise on cosets of a fixed multiplicative subgroup, integrating monomial behavior with piecewise algebraic structure.
• They allow conversion between cyclotomic and polynomial forms and provide explicit criteria for permutation properties as well as many-to-one classifications based on local gcd and congruence conditions.
• These mappings underpin applications in constructing finite field polynomials, functional graphs, bent functions, and binary codes, highlighting their significance in both theory and cryptography.

Generalized cyclotomic mappings are finite-field maps that are defined monomially on each coset of a fixed multiplicative subgroup. If $q$ is a prime power and $\ell \mid (q-1)$, one fixes an index-$\ell$ subgroup $C_0 \le \mathbb F_q^\ast$ and its cosets $C_i$, and then prescribes $f(x)=a_i x^{r_i}$ on each $C_i$, with the normalization $f(0)=0$. In this sense they interpolate between monomial maps and fully arbitrary piecewise-defined maps, while retaining enough algebraic structure to admit explicit polynomial forms, permutation criteria, inverse formulas, functional-graph descriptions, and, more recently, complete many-to-one classifications in several regimes (Zheng et al., 9 Mar 2025).

1. Definition, cyclotomic classes, and equivalent representations

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $\ell \mid (q-1)$0 elements, and let $\ell \mid (q-1)$1 be primitive. If $\ell \mid (q-1)$2, the index-$\ell \mid (q-1)$3 subgroup

$\ell \mid (q-1)$4

has cosets

$\ell \mid (q-1)$5

which partition $\ell \mid (q-1)$6. A generalized cyclotomic mapping is then the piecewise map

$\ell \mid (q-1)$7

with $\ell \mid (q-1)$8 and $\ell \mid (q-1)$9. Classical cyclotomic mappings appear as special cases: $\ell$0 for all $\ell$1 in the first-order setting, and $\ell$2 constant $\ell$3 in the higher-order classical setting (Zheng et al., 9 Mar 2025).

A central feature of the theory is that the piecewise description admits a single polynomial representative modulo $\ell$4. Writing $\ell$5, a primitive $\ell$6-th root of unity in $\ell$7,

$\ell$8

This polynomial form is one side of a broader conversion theory: generalized cyclotomic mappings can be switched between cyclotomic form, polynomial form, and, in the permutation case on $\ell$9, wreath product form $C_0 \le \mathbb F_q^\ast$0, where the index is denoted $C_0 \le \mathbb F_q^\ast$1 rather than $C_0 \le \mathbb F_q^\ast$2 (Bors et al., 2021).

This multiplicative-coset description is the standard framework, but it is not the only one used in the literature. In bent-function constructions, an additive-coset analogue is also used, with branch functions specified on additive cosets rather than multiplicative ones. That broader usage suggests that “generalized cyclotomic mapping” now names a family of piecewise algebraic constructions organized by subgroup or subspace partitions, not merely a permutation-polynomial ansatz (Xie et al., 2023).

2. Cosetwise behavior, target cosets, and the many-to-one formalism

The local behavior of a generalized cyclotomic mapping is governed by two parameters: the exponent collapse inside a coset and the destination coset of its image. For a fixed primitive element $C_0 \le \mathbb F_q^\ast$3, define

$C_0 \le \mathbb F_q^\ast$4

Then $C_0 \le \mathbb F_q^\ast$5 maps $C_0 \le \mathbb F_q^\ast$6 onto the coset $C_0 \le \mathbb F_q^\ast$7. If

$C_0 \le \mathbb F_q^\ast$8

the restriction

$C_0 \le \mathbb F_q^\ast$9

is uniformly $C_i$0-to-$C_i$1, and $C_i$2. Thus every local branch contributes a completely explicit fiber size: raising to the $C_i$3-th power on a cyclic group of order $C_i$4 collapses each fiber by the factor $C_i$5 (Zheng et al., 9 Mar 2025).

The global many-to-one problem is therefore not local but combinatorial: it depends on how the images $C_i$6 overlap. For $C_i$7, with $C_i$8 and $C_i$9, the intersection behavior is characterized by congruences in $f(x)=a_i x^{r_i}$0: $f(x)=a_i x^{r_i}$1

$f(x)=a_i x^{r_i}$2

and partial overlap without containment occurs exactly when $f(x)=a_i x^{r_i}$3 and $f(x)=a_i x^{r_i}$4, in which case the intersection has size $f(x)=a_i x^{r_i}$5 and is an explicit coset progression. The proofs reduce these alternatives to linear Diophantine congruences modulo $f(x)=a_i x^{r_i}$6, and this intersection calculus is the core mechanism behind all global $f(x)=a_i x^{r_i}$7-to-$f(x)=a_i x^{r_i}$8 classifications (Zheng et al., 9 Mar 2025).

The paper on many-to-one properties also fixes the relevant notion of $f(x)=a_i x^{r_i}$9-to-$C_i$0. If $C_i$1 is finite and $C_i$2 with $C_i$3, a map $C_i$4 is called $C_i$5-to-$C_i$6 on $C_i$7 if there exist $C_i$8 distinct images each having exactly $C_i$9 preimages; the remaining $f(0)=0$0 domain elements form the exceptional set $f(0)=0$1. Over $f(0)=0$2, under the normalization $f(0)=0$3 and assuming $f(0)=0$4 is the only root, one has:

• for $f(0)=0$5, $f(0)=0$6 is $f(0)=0$7-to-$f(0)=0$8 on $f(0)=0$9 iff it is $q$0-to-$q$1 on $q$2;
• for $q$3, $q$4 is $q$5-to-$q$6 on $q$7 iff $q$8 and $q$9 is $\mathbb F_q$0-to-$\mathbb F_q$1 on $\mathbb F_q$2.

A common misconception is that generalized cyclotomic mappings are primarily a permutation-theoretic object. Earlier work indeed concentrated on the one-to-one property, inversion, cycle structure, and functional graphs, but the many-to-one viewpoint shows that the same cosetwise algebra supports a parallel fiber-distribution theory rather than merely a permutation theory (Zheng et al., 9 Mar 2025).

3. Complete many-to-one classifications for $\mathbb F_q$3

For $\mathbb F_q$4, generalized cyclotomic mappings reduce to monomials

$\mathbb F_q$5

In that case $\mathbb F_q$6 is $\mathbb F_q$7-to-$\mathbb F_q$8 on $\mathbb F_q$9 if and only if

$\ell \mid (q-1)$00

and $\ell \mid (q-1)$01. For $\ell \mid (q-1)$02, $\ell \mid (q-1)$03 is $\ell \mid (q-1)$04-to-$\ell \mid (q-1)$05 on $\ell \mid (q-1)$06 iff $\ell \mid (q-1)$07 and the same condition holds on $\ell \mid (q-1)$08. Thus the monomial case is completely rigid: the fiber size is exactly the exponent’s gcd with the multiplicative group order (Zheng et al., 9 Mar 2025).

For $\ell \mid (q-1)$09, with $\ell \mid (q-1)$10 odd and $\ell \mid (q-1)$11, the mapping can be written as

$\ell \mid (q-1)$12

which agrees with $\ell \mid (q-1)$13 on $\ell \mid (q-1)$14 and $\ell \mid (q-1)$15 on $\ell \mid (q-1)$16. Let $\ell \mid (q-1)$17. Then for $\ell \mid (q-1)$18, $\ell \mid (q-1)$19 is $\ell \mid (q-1)$20-to-$\ell \mid (q-1)$21 on $\ell \mid (q-1)$22 if and only if one of two situations holds:

1. $\ell \mid (q-1)$23 and $\ell \mid (q-1)$24;
2. $\ell \mid (q-1)$25, $\ell \mid (q-1)$26 divides $\ell \mid (q-1)$27, $\ell \mid (q-1)$28, and

$\ell \mid (q-1)$29

The paper also isolates low-degree specializations. For $\ell \mid (q-1)$30, $\ell \mid (q-1)$31 is $\ell \mid (q-1)$32-to-$\ell \mid (q-1)$33 on $\ell \mid (q-1)$34 iff either $\ell \mid (q-1)$35 with $\ell \mid (q-1)$36, or $\ell \mid (q-1)$37 with $\ell \mid (q-1)$38. For $\ell \mid (q-1)$39 and $\ell \mid (q-1)$40, $\ell \mid (q-1)$41 is $\ell \mid (q-1)$42-to-$\ell \mid (q-1)$43 iff $\ell \mid (q-1)$44 and $\ell \mid (q-1)$45 (Zheng et al., 9 Mar 2025).

For $\ell \mid (q-1)$46, with $\ell \mid (q-1)$47,

$\ell \mid (q-1)$48

where $\ell \mid (q-1)$49 is a primitive cube root of unity. Writing $\ell \mid (q-1)$50 and ordering them as $\ell \mid (q-1)$51, the paper proves a complete classification: $\ell \mid (q-1)$52 is $\ell \mid (q-1)$53-to-$\ell \mid (q-1)$54 on $\ell \mid (q-1)$55 if and only if exactly one of six structural scenarios holds. These six cases are organized by the equalities among the $\ell \mid (q-1)$56, the equalities or inequalities among the relevant $\ell \mid (q-1)$57, and an exceptional-set inequality. Concretely, the scenarios are:

1. $\ell \mid (q-1)$58, with $\ell \mid (q-1)$59 pairwise distinct;
2. $\ell \mid (q-1)$60, $\ell \mid (q-1)$61, $\ell \mid (q-1)$62, and $\ell \mid (q-1)$63;
3. $\ell \mid (q-1)$64, $\ell \mid (q-1)$65, $\ell \mid (q-1)$66, $\ell \mid (q-1)$67, $\ell \mid (q-1)$68, and $\ell \mid (q-1)$69;
4. $\ell \mid (q-1)$70, $\ell \mid (q-1)$71, and $\ell \mid (q-1)$72 with $\ell \mid (q-1)$73;
5. $\ell \mid (q-1)$74, $\ell \mid (q-1)$75, $\ell \mid (q-1)$76, and $\ell \mid (q-1)$77;
6. $\ell \mid (q-1)$78, $\ell \mid (q-1)$79, $\ell \mid (q-1)$80, $\ell \mid (q-1)$81, $\ell \mid (q-1)$82, and $\ell \mid (q-1)$83.

The significance of the $\ell \mid (q-1)$84 results is not merely that they settle small indices. They show that many-to-one behavior is controlled by a finite set of local gcd parameters and target-coset congruences, together with explicit exceptional-set bounds. This strongly suggests that the obstruction to a general classification at larger index is combinatorial explosion rather than the absence of structural invariants (Zheng et al., 9 Mar 2025).

4. General $\ell \mid (q-1)$85-to-$\ell \mid (q-1)$86 classification and the equal-gcd regime

The strongest all-index theorem in the 2025 work is the complete classification of $\ell \mid (q-1)$87-to-$\ell \mid (q-1)$88 generalized cyclotomic mappings for arbitrary $\ell \mid (q-1)$89. Let $\ell \mid (q-1)$90 with $\ell \mid (q-1)$91, and define

$\ell \mid (q-1)$92

Then $\ell \mid (q-1)$93 is $\ell \mid (q-1)$94-to-$\ell \mid (q-1)$95 on $\ell \mid (q-1)$96 if and only if one of three cases holds:

1. $\ell \mid (q-1)$97, $\ell \mid (q-1)$98 is even, and $\ell \mid (q-1)$99 is $\ell$00-to-$\ell$01 on $\ell$02;
2. $\ell$03 and $\ell$04 is injective on $\ell$05;
3. $\ell$06, $\ell$07 for all $\ell$08, $\ell$09, $\ell$10 is $\ell$11-to-$\ell$12 on $\ell$13 with $\ell$14 even, and $\ell$15 is injective on $\ell$16.

This theorem yields a direct decision procedure: compute $\ell$17, reject if any $\ell$18, partition the indices into $\ell$19 and $\ell$20, compute the appropriate $\ell$21, and then check the pairing or injectivity conditions. The proof idea is equally transparent: since each local branch $\ell$22 is $\ell$23-to-$\ell$24, only $\ell$25 are compatible with global $\ell$26-to-$\ell$27, and the arithmetic of $\ell$28 determines how distinct coset images collide (Zheng et al., 9 Mar 2025).

The same paper also records a broader “equal gcd case.” If

$\ell$29

then $\ell$30 is $\ell$31-to-$\ell$32 on $\ell$33 if and only if

$\ell$34

This statement does not solve the general $\ell$35-to-$\ell$36 problem for all $\ell$37, but it gives a complete answer when the local collapsing factors are constant across all branches (Zheng et al., 9 Mar 2025).

The limitation is explicit. Complete many-to-one characterizations are proved for $\ell$38, while for $\ell$39 a complete classification for general $\ell$40 remains open. Enumerative questions—how many parameter tuples $\ell$41 yield a prescribed $\ell$42-to-$\ell$43 behavior for fixed $\ell$44 and $\ell$45—are also left open, and the paper notes that such counts depend on discrete logarithms and modular constraints (Zheng et al., 9 Mar 2025).

5. Constructions on $\ell$46 via $\ell$47

A major extension of the many-to-one theory is the passage from $\ell$48 to $\ell$49. Let

$\ell$50

a cyclic subgroup of $\ell$51. If $\ell$52, then an index-$\ell$53 subgroup

$\ell$54

has cosets $\ell$55, where $\ell$56 generates $\ell$57. One studies polynomials

$\ell$58

under the condition that

$\ell$59

induces monomial functions on the cosets $\ell$60, namely

$\ell$61

This recreates the generalized cyclotomic mapping setup over $\ell$62 (Zheng et al., 9 Mar 2025).

The bridge lemma is exact. If $\ell$63 and $\ell$64 has no roots in $\ell$65, then for $\ell$66,

$\ell$67

and

$\ell$68

Thus the construction of many-to-one polynomials $\ell$69 reduces to a cyclotomic many-to-one problem on the norm-one subgroup (Zheng et al., 9 Mar 2025).

For $\ell$70, with $\ell$71, the criterion on $\ell$72 parallels the $\ell$73 case. Writing

$\ell$74

and

$\ell$75

one has that $\ell$76 is $\ell$77-to-$\ell$78 on $\ell$79 iff either $\ell$80 with $\ell$81, or $\ell$82, $\ell$83, $\ell$84, and

$\ell$85

The bridge lemma then transfers this to $\ell$86 on $\ell$87 (Zheng et al., 9 Mar 2025).

The paper derives explicit binomial and trinomial families. For instance, if $\ell$88 is monomial on each $\ell$89, as in the Hou–Lavorante list, then for

$\ell$90

one obtains explicit many-to-one families. In the case $\ell$91,

$\ell$92

is $\ell$93-to-$\ell$94 precisely when

$\ell$95

or

$\ell$96

together with

$\ell$97

and

$\ell$98

Analogous trinomial criteria are given for

$\ell$99

under the conditions $C_0 \le \mathbb F_q^\ast$00, $C_0 \le \mathbb F_q^\ast$01, $C_0 \le \mathbb F_q^\ast$02, and $C_0 \le \mathbb F_q^\ast$03 (Zheng et al., 9 Mar 2025).

A plausible implication is that the subgroup $C_0 \le \mathbb F_q^\ast$04 functions as a transfer device: once generalized cyclotomic many-to-one behavior is understood on this cyclic subgroup, substantial families of structured binomials and trinomials over $C_0 \le \mathbb F_q^\ast$05 become accessible without repeating the entire finite-field analysis from scratch.

6. Permutations, inverses, functional graphs, and applications

The many-to-one theory sits inside a larger body of work on generalized cyclotomic mappings. In the permutation direction, the criterion is classical: when the coefficients are nonzero and each local exponent is invertible modulo the subgroup size, bijectivity reduces to distinct coset images. This viewpoint is formalized in several equivalent languages. One paper develops an explicit conversion from cyclotomic form to polynomial form and back, and establishes a concrete permutation-group isomorphism between the restrictions of generalized index-$C_0 \le \mathbb F_q^\ast$06 cyclotomic permutations to $C_0 \le \mathbb F_q^\ast$07 and the wreath product $C_0 \le \mathbb F_q^\ast$08. Within the same framework, one obtains criteria for permutation status, formulas for inverses, and classifications of long cycles and involutions (Bors et al., 2021).

A more specialized inverse theory appears in the study of cyclotomic mapping permutation polynomials. For branch monomials $C_0 \le \mathbb F_q^\ast$09, the permutation criterion can be written as: $C_0 \le \mathbb F_q^\ast$10 for all $C_0 \le \mathbb F_q^\ast$11, and $C_0 \le \mathbb F_q^\ast$12 is a complete set of residues modulo $C_0 \le \mathbb F_q^\ast$13. The inverse is again cyclotomic, with exponents $C_0 \le \mathbb F_q^\ast$14 and explicitly computable coefficients, and the involution condition becomes a system of modular equalities on the exponents and discrete-log parameters. The paper emphasizes that these constructions and tests require only modular operations (Wang, 2016).

Beyond bijectivity, the iteration theory of generalized cyclotomic mappings has been developed via functional graphs. By identifying each coset $C_0 \le \mathbb F_q^\ast$15 with $C_0 \le \mathbb F_q^\ast$16, the restriction to a coset becomes an affine map $C_0 \le \mathbb F_q^\ast$17, and the global dynamics decomposes into cycles of cosets with affine trees attached. The paper “Functional graphs of generalized cyclotomic mappings of finite fields” provides structural results, parametrizations of connected components by representative vertices, and Las Vegas algorithms whose expected runtime, for fixed index $C_0 \le \mathbb F_q^\ast$18 and most prime powers $C_0 \le \mathbb F_q^\ast$19, is polynomial in $C_0 \le \mathbb F_q^\ast$20 on quantum computers and subexponential in $C_0 \le \mathbb F_q^\ast$21 on a classical computer (Bors et al., 2023).

The first-order case $C_0 \le \mathbb F_q^\ast$22 on each coset, sometimes treated separately as first-order cyclotomic mappings, has its own cycle-theoretic results. In particular, for $C_0 \le \mathbb F_q^\ast$23 sufficiently large relative to the index, all cycle types of first-order cyclotomic permutations with only long cycles on $C_0 \le \mathbb F_q^\ast$24 can be achieved through a complete mapping, as can all permutations of the cosets of the underlying subgroup. There are also constructions of complete mappings $C_0 \le \mathbb F_q^\ast$25 such that both $C_0 \le \mathbb F_q^\ast$26 and $C_0 \le \mathbb F_q^\ast$27 permute the nonzero field elements in one cycle (Bors et al., 2021).

Applications extend beyond permutation theory. Generalized cyclotomic mappings have been used to construct binary linear codes with few weights and bent functions, and recent bent-function work uses piecewise branch functions of Dillon, Niho, and Kasami type on multiplicative or additive cosets to obtain new explicit infinite families together with duals and EA-inequivalence observations (Zheng et al., 9 Mar 2025, Xie et al., 2023). This suggests that fiber-distribution results, such as many-to-one classifications, are relevant not only as standalone algebraic statements but also as structural constraints on code weights, Walsh spectra, and related cryptographic design parameters.

Open problems remain conspicuous. Complete many-to-one characterizations are known for $C_0 \le \mathbb F_q^\ast$28, complete $C_0 \le \mathbb F_q^\ast$29-to-$C_0 \le \mathbb F_q^\ast$30 classifications are known for arbitrary $C_0 \le \mathbb F_q^\ast$31, and the equal-gcd case is settled for general $C_0 \le \mathbb F_q^\ast$32. For larger index and general $C_0 \le \mathbb F_q^\ast$33, however, a full classification is still unavailable. Further directions explicitly mentioned in the literature include extensions to functional-graph and cycle-structure analysis for many-to-one mappings, more applications in codes and cryptography, and generalizations beyond the subgroup $C_0 \le \mathbb F_q^\ast$34 (Zheng et al., 9 Mar 2025).