Goto Chapter: Top 1 2 3 4 5 6 7 Bib Ind
Top of Book Previous Chapter Next Chapter

2. Residue-Class-Wise Affine Mappings
2.1 Basic definitions
2.2 Entering residue-class-wise affine mappings
2.2-1 ClassShift
2.2-2 ClassReflection
2.2-3 ClassTransposition
2.2-4 ClassRotation
2.2-5 RcwaMapping (the general constructor)
2.2-6 LocalizedRcwaMapping
2.3 Basic arithmetic for residue-class-wise affine mappings
2.4 Attributes and properties of residue-class-wise affine mappings
2.4-1 LargestSourcesOfAffineMappings
2.4-2 FixedPointsOfAffinePartialMappings
2.4-3 Multpk
2.4-4 Determinant
2.4-5 Sign
2.5 Factoring residue-class-wise affine permutations
2.5-1 FactorizationIntoCSCRCT
2.5-2 PrimeSwitch
2.5-3 mKnot
2.6 Extracting roots of residue-class-wise affine mappings
2.6-1 Root
2.7 Special functions for non-bijective mappings
2.7-1 RightInverse
2.7-2 CommonRightInverse
2.7-3 ImageDensity
2.8 On trajectories and cycles of residue-class-wise affine mappings
2.8-1 Trajectory (methods for rcwa mappings)
2.8-2 Trajectory (methods for rcwa mappings -- "accumulated coefficients")
2.8-3 IncreasingOn & DecreasingOn (for an rcwa mapping)
2.8-4 TransitionGraph
2.8-5 OrbitsModulo
2.8-6 FactorizationOnConnectedComponents
2.8-7 TransitionMatrix
2.8-8 Sources & Sinks (of an rcwa mapping)
2.8-9 Loops
2.8-10 GluckTaylorInvariant
2.8-11 LikelyContractionCentre
2.8-12 GuessedDivergence
2.9 The categories and families of rcwa mappings
2.9-1 IsRcwaMapping
2.9-2 RcwaMappingsFamily

### 2. Residue-Class-Wise Affine Mappings

In this chapter we give the basic definitions, and describe how to enter residue-class-wise affine mappings and how to compute with them.

How to compute with residue-class-wise affine groups is described in detail in the next chapter. The reader is encouraged to look there already after having read the first few pages of this chapter, and to look up definitions as he needs to.

#### 2.1 Basic definitions

Residue-class-wise affine groups, or rcwa groups for short, are permutation groups whose elements are bijective residue-class-wise affine mappings.

A mapping f: Z -> Z is called residue-class-wise affine, or for short an rcwa mapping, if there is a positive integer m such that the restrictions of f to the residue classes r(m) in Z/mZ are all affine, i.e. given by

for certain coefficients a_r(m), b_r(m), c_r(m) in Z depending on r(m). The smallest possible m is called the modulus of f. It is understood that all fractions are reduced, i.e. that gcd( a_r(m), b_r(m), c_r(m) ) = 1, and that c_r(m) > 0. The lcm of the coefficients a_r(m) is called the multiplier of f, and the lcm of the coefficients c_r(m) is called the divisor of f.

It is easy to see that the residue-class-wise affine mappings of Z form a monoid under composition, and that the residue-class-wise affine permutations of Z form a countable subgroup of Sym(Z). We denote the former by Rcwa(Z), and the latter by RCWA(Z).

An rcwa mapping is called tame if the set of moduli of its powers is bounded, or equivalently if it permutes a partition of Z into finitely many residue classes on all of which it is affine. An rcwa group is called tame if there is a common such partition for all of its elements, or equivalently if the set of moduli of its elements is bounded. Rcwa mappings and -groups which are not tame are called wild. Tame rcwa mappings and -groups are something which one could call the "trivial cases" or "basic building blocks", while wild rcwa groups are the objects of primary interest.

The definitions of residue-class-wise affine mappings and -groups can be generalized in an obvious way to suitable rings other than Z. In fact, this package provides also some support for residue-class-wise affine groups over semilocalizations of Z and over univariate polynomial rings over finite fields. The former of these rings have been chosen as examples of rings with only finitely prime elements, and the latter have been chosen as examples of rings with nonzero characteristic.

#### 2.2 Entering residue-class-wise affine mappings

Entering an rcwa mapping of Z requires giving the modulus m and the coefficients a_r(m), b_r(m) and c_r(m) for r(m) running over the residue classes (mod m).

This can be done easiest by `RcwaMapping( coeffs )`, where coeffs is a list of m coefficient triples `coeffs[`r+1`] = [`a_r(m), b_r(m), c_r(m)`]`, with r running from 0 to m-1.

If some coefficient c_r(m) is zero or if images of some integers under the mapping to be defined would not be integers, an error message is printed and a break loop is entered. For example, the coefficient triple `[1,4,3]` is not allowed at the first position. The reason for this is that not all integers congruent to 1 * 0 + 4 = 4 mod m are divisible by 3.

For the general constructor for rcwa mappings, see `RcwaMapping` (2.2-5).

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]); # The Collatz mapping.
    <rcwa mapping of Z with modulus 2>
    gap> [ IsSurjective(T), IsInjective(T) ];
    [ true, false ]
    gap> SetName(T,"T"); Display(T);

    Surjective rcwa mapping of Z with modulus 2

                  n mod 2               |                n^T
    ------------------------------------+------------------------------------
      0                                 | n/2
      1                                 | (3n + 1)/2

    gap> a := RcwaMapping([[2,0,3],[4,-1,3],[4,1,3]]); SetName(a,"a");
    <rcwa mapping of Z with modulus 3>
    gap> IsBijective(a);
    true
    gap> Display(a); # This is Collatz' permutation:

    Bijective rcwa mapping of Z with modulus 3

                  n mod 3               |                n^a
    ------------------------------------+------------------------------------
      0                                 | 2n/3
      1                                 | (4n - 1)/3
      2                                 | (4n + 1)/3

    gap> Support(a);
    Z \ [ -1, 0, 1 ]
    gap> Cycle(a,44);
    [ 44, 59, 79, 105, 70, 93, 62, 83, 111, 74, 99, 66 ]

There is computational evidence for the conjecture that any residue-class-wise affine permutation of Z can be factored into members of the following three series of permutations of particularly simple structure (cf. `FactorizationIntoCSCRCT` (2.5-1)):

##### 2.2-1 ClassShift

`> ClassShift`( r, m ) | ( function )

`> ClassShift`( cl ) | ( function )

Returns: The class shift nu_r(m).

The class shift nu_r(m) is the rcwa mapping of Z which maps n in r(m) to n + m and which fixes Z \ r(m) pointwise.

In the one-argument form, the argument cl stands for the residue class r(m). Enclosing the argument list in list brackets is permitted.

    gap> Display(ClassShift(5,12));

    Tame bijective rcwa mapping of Z with modulus 12, of order infinity

                  n mod 12              |         n^ClassShift(5,12)
    ------------------------------------+------------------------------------
       0  1  2  3  4  6  7  8  9 10 11  | n
       5                                | n + 12

##### 2.2-2 ClassReflection

`> ClassReflection`( r, m ) | ( function )

`> ClassReflection`( cl ) | ( function )

Returns: The class reflection varsigma_r(m).

The class reflection varsigma_r(m) is the rcwa mapping of Z which maps n in r(m) to -n + 2r and which fixes Z \ r(m) pointwise, where it is understood that 0 <= r < m.

In the one-argument form, the argument cl stands for the residue class r(m). Enclosing the argument list in list brackets is permitted.

    gap> Display(ClassReflection(5,9));

    Bijective rcwa mapping of Z with modulus 9, of order 2

                  n mod 9               |       n^ClassReflection(5,9)
    ------------------------------------+------------------------------------
      0 1 2 3 4 6 7 8                   | n
      5                                 | -n + 10

##### 2.2-3 ClassTransposition

`> ClassTransposition`( r1, m1, r2, m2 ) | ( function )

`> ClassTransposition`( cl1, cl2 ) | ( function )

Returns: The class transposition tau_r_1(m_1),r_2(m_2).

Given two disjoint residue classes r_1(m_1) and r_2(m_2) of the integers, the class transposition tau_r_1(m_1),r_2(m_2) in RCWA(Z) is defined as the involution which interchanges r_1+km_1 and r_2+km_2 for any integer k and which fixes all other points. It is understood that m_1 and m_2 are positive, that 0 <= r_1 < m_1 and that 0 <= r_2 < m_2. For a generalized class transposition, the latter assumptions are not made.

The class transposition tau_r_1(m_1),r_2(m_2) interchanges the residue classes r_1(m_1) and r_2(m_2) and fixes the complement of their union pointwise.

In the four-argument form, the arguments r1, m1, r2 and m2 stand for r_1, m_1, r_2 and m_2, respectively. In the two-argument form, the arguments cl1 and cl2 stand for the residue classes r_1(m_1) and r_2(m_2), respectively. Enclosing the argument list in list brackets is permitted. The residue classes r_1(m_1) and r_2(m_2) are stored as an attribute `TransposedClasses`.

A class transposition can be written as a product of any given number k of class transpositions. Such a decomposition can be obtained by `SplittedClassTransposition(ct,k)`.

    gap> Display(ClassTransposition(1,2,8,10));

    Bijective rcwa mapping of Z with modulus 10, of order 2

                  n mod 10              |   n^ClassTransposition(1,2,8,10)
    ------------------------------------+------------------------------------
       0  2  4  6                       | n
       1  3  5  7  9                    | 5n + 3
       8                                | (n - 3)/5

The set of all class transpositions of the ring of integers generates the simple group CT(Z) mentioned in Chapter 1.. This group has a representation as a GAP object -- see `CT` (3.1-2). The set of all generalized class transpositions of Z generates a simple group as well, cf. [Koh06a].

Class shifts, class reflections and class transpositions of rings R other than Z are defined in an entirely analogous way -- all one needs to do is to replace Z by R and to read < and <= in the sense of the ordering used by GAP. They can also be entered basically as described above -- just prepend the desired ring R to the argument list. Often also a sensible "default ring" (-> `DefaultRing` in the GAP Reference Manual) is chosen if that optional first argument is omitted.

On rings which have more than two units, there is another basic series of rcwa permutations which generalizes class reflections:

##### 2.2-4 ClassRotation

`> ClassRotation`( r, m, u ) | ( function )

`> ClassRotation`( cl, u ) | ( function )

Returns: The class rotation rho_r(m),u.

Given a residue class r(m) and a unit u of a suitable ring R, the class rotation rho_r(m),u is the rcwa mapping which maps n in r(m) to un + (1-u)r and which fixes R \ r(m) pointwise. Class rotations generalize class reflections, as we have rho_r(m),-1 = varsigma_r(m).

In the two-argument form, the argument cl stands for the residue class r(m). Enclosing the argument list in list brackets is permitted. The argument u is stored as an attribute `RotationFactor`.

    gap> Display(ClassRotation(ResidueClass(Z_pi(2),2,1),1/3));

    Tame bijective rcwa mapping of Z_( 2 ) with modulus 2, of order infinity

                  n mod 2               |      n^ClassRotation(1,2,1/3)
    ------------------------------------+------------------------------------
      0                                 | n
      1                                 | 1/3 n + 2/3

    gap> x := Indeterminate(GF(8),1);; SetName(x,"x");
    gap> R := PolynomialRing(GF(8),1);;
    gap> Display(ClassRotation(1,x,Z(8)*One(R)));

    Bijective rcwa mapping of GF(2^3)[x] with modulus x, of order 7

            P mod x         |       P^(ClassRotation(Z(2)^0,x,Z(2^3)))
    ------------------------+------------------------------------------------
     0*Z(2)   Z(2^3)        |
     Z(2^3)^2 Z(2^3)^3      |
     Z(2^3)^4 Z(2^3)^5      |
     Z(2^3)^6               | P
     Z(2)^0                 | Z(2^3)*P + Z(2^3)^3

There are properties `IsClassShift`, `IsClassReflection`, `IsClassRotation`, `IsClassTransposition` and `IsGeneralizedClassTransposition`, which indicate whether a given rcwa mapping belongs to the corresponding series. By default, class shifts, class reflections, class transpositions and class rotations are given descriptive names of the form `Class...(...)`. They can be given user-defined names upon creation via the option `Name`. Setting the `Name` attribute can be avoided by passing the empty string.

In the sequel, a description of the general-purpose constructor for rcwa mappings is given. This might look a bit technical on a first glance, but knowing all possible ways of entering an rcwa mapping is by no means necessary for understanding this manual or for using this package.

##### 2.2-5 RcwaMapping (the general constructor)

`> RcwaMapping`( R, m, coeffs ) | ( method )

`> RcwaMapping`( R, coeffs ) | ( method )

`> RcwaMapping`( coeffs ) | ( method )

`> RcwaMapping`( perm, range ) | ( method )

`> RcwaMapping`( m, values ) | ( method )

`> RcwaMapping`( pi, coeffs ) | ( method )

`> RcwaMapping`( q, m, coeffs ) | ( method )

`> RcwaMapping`( P1, P2 ) | ( method )

`> RcwaMapping`( cycles ) | ( method )

Returns: An rcwa mapping.

In all cases the argument R is the underlying ring, m is the modulus and coeffs is the coefficient list. A coefficient list for an rcwa mapping with modulus m consists of |R/mR| coefficient triples `[`a_r(m), b_r(m), c_r(m)`]`. Their ordering is determined by the ordering of the representatives of the residue classes (mod m) in the sorted list returned by `AllResidues(R, m)`. In case R = Z this means that the coefficient triple for the residue class 0(m) comes first and is followed by the one for 1(m), the one for 2(m) and so on.

In case one or several of the arguments R, m and coeffs are omitted or replaced by other arguments, the former are either derived from the latter or default values are taken. The meaning of the other arguments is defined in the detailed description of the particular methods given in the sequel: The above methods return the rcwa mapping

(a)

  of R with modulus m and coefficients coeffs,

(b)

  of R = Z or R = Z_(pi) with modulus `Length(coeffs)` and coefficients coeffs,

(c)

  of R = Z with modulus `Length(coeffs)` and coefficients coeffs,

(d)

  of R = Z, permuting any set `range+k*Length(range)` like perm permutes range,

(e)

  of R = Z with modulus m and values given by a list val of 2 pairs `[`preimage`,` image`]` per residue class (mod m),

(f)

  of R = Z_(pi) with modulus `Length(coeffs)` and coefficients coeffs (the set of primes pi which denotes the underlying ring is passed as argument pi),

(g)

  of R = GF(q)[x] with modulus m and coefficients coeffs,

(h)

  a bijective rcwa mapping which induces a bijection between the partitions P1 and P2 of R into residue classes and which is affine on the elements of P1, or

(i)

  a bijective rcwa mapping with "residue class cycles" given by a list cycles of lists of pairwise disjoint residue classes which are to be permuted cyclically, each, respectively.

The methods for the operation `RcwaMapping` perform a number of argument checks, which can be skipped by using `RcwaMappingNC` instead.

    gap> R := PolynomialRing(GF(2),1);; x := X(GF(2),1);; SetName(x,"x");
    gap> RcwaMapping(R,x+1,[[1,0,x+One(R)],[x+One(R),0,1]]*One(R));     # (a)
    <rcwa mapping of GF(2)[x] with modulus x+Z(2)^0>
    gap> RcwaMapping(Z_pi(2),[[1/3,0,1]]);                              # (b)
    Rcwa mapping of Z_( 2 ): n -> 1/3 n
    gap> a := RcwaMapping([[2,0,3],[4,-1,3],[4,1,3]]);                  # (c)
    <rcwa mapping of Z with modulus 3>
    gap> RcwaMapping((1,2,3),[1..4]);                                   # (d)
    <bijective rcwa mapping of Z with modulus 4, of order 3>
    gap> T = RcwaMapping(2,[[1,2],[2,1],[3,5],[4,2]]);                  # (e)
    true
    gap> RcwaMapping([2],[[1/3,0,1]]);                                  # (f)
    Rcwa mapping of Z_( 2 ): n -> 1/3 n
    gap> RcwaMapping(2,x+1,[[1,0,x+One(R)],[x+One(R),0,1]]*One(R));     # (g)
    <rcwa mapping of GF(2)[x] with modulus x+Z(2)^0>
    gap> a = RcwaMapping(List([[0,3],[1,3],[2,3]],ResidueClass),
    >                    List([[0,2],[1,4],[3,4]],ResidueClass));       # (h)
    true
    gap> RcwaMapping([List([[0,2],[1,4],[3,8],[7,16]],ResidueClass)]);  # (i)
    <bijective rcwa mapping of Z with modulus 16, of order 4>
    gap> Cycle(last,ResidueClass(0,2));
    [ 0(2), 1(4), 3(8), 7(16) ]

Rcwa mappings of Z can be "translated" to rcwa mappings of some semilocalization Z_(pi) of Z:

##### 2.2-6 LocalizedRcwaMapping

`> LocalizedRcwaMapping`( f, p ) | ( function )

`> SemilocalizedRcwaMapping`( f, pi ) | ( function )

Returns: The rcwa mapping of Z_(p) respectively Z_(pi) with the same coefficients as the rcwa mapping f of Z.

The argument p or pi must be a prime or a set of primes, respectively. The argument f must be an rcwa mapping of Z whose modulus is a power of p, or whose modulus has only prime divisors which lie in pi, respectively.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);; # The Collatz mapping.
    gap> Cycle(LocalizedRcwaMapping(T,2),131/13);
    [ 131/13, 203/13, 311/13, 473/13, 716/13, 358/13, 179/13, 275/13,
      419/13, 635/13, 959/13, 1445/13, 2174/13, 1087/13, 1637/13, 2462/13,
      1231/13, 1853/13, 2786/13, 1393/13, 2096/13, 1048/13, 524/13, 262/13 ]

Rcwa mappings can be `View`ed, `Display`ed, `Print`ed and written to a `String`. The output of the `View` method is kept reasonably short. In most cases it does not describe an rcwa mapping completely. In these cases the output is enclosed in brackets. The output of the methods for `Display` and `Print` describe an rcwa mapping in full. The `Print`ed representation of an rcwa mapping is GAP - readable if and only if the `Print`ed representation of the elements of the underlying ring is so.

There is also a method for `LaTeX`, respectively `LaTeXObj`. The output of this method makes use of the LaTeX macro package amsmath. If the option Factorization is set and the argument is bijective, a factorization into class shifts, class reflections, class transpositions and prime switches is printed (cf. `FactorizationIntoCSCRCT` (2.5-1)). For rcwa mappings with modulus greater than 1, an indentation by Indentation characters can be obtained by setting this option value accor\-dingly.

    gap> Print(LaTeXObj(T));
    n \ \longmapsto \
    \begin{cases}
      n/2        & \text{if} \ n \in 0(2), \\
      (3n + 1)/2 & \text{if} \ n \in 1(2).
    \end{cases}

There is an operation `LaTeXAndXDVI` which displays an rcwa mapping in an xdvi window. This works as follows: The string returned by the `LaTeXObj` - method described above is inserted into a LaTeX template file. This file is LaTeX'ed, and the result is shown with xdvi. Calling `Display` with option xdvi has the same effect. The operation `LaTeXAndXDVI` is only available on UNIX systems, and requires suitable installations of LaTeX and xdvi.

#### 2.3 Basic arithmetic for residue-class-wise affine mappings

Testing rcwa mappings for equality requires only comparing their coefficient lists, hence is cheap. Rcwa mappings can be multiplied, thus there is a method for `*`. Bijective rcwa mappings can also be inverted, thus there is a method for `Inverse`. The latter method is usually accessed by raising a mapping to a power with negative exponent. Multiplying, inverting and computing powers of tame rcwa mappings is cheap. Computing powers of wild mappings is usually expensive -- runtime and memory requirements normally grow approximately exponentially with the exponent. How expensive multiplying a couple of wild mappings is, varies very much. In any case, the amount of memory required for storing an rcwa mapping is proportional to its modulus. Whether a given mapping is tame or wild can be determined by the operation `IsTame`. There is a method for `Order`, which can not only compute a finite order, but which can also detect infinite order.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);;          # The Collatz mapping.
    gap> a := RcwaMapping([[2,0,3],[4,-1,3],[4,1,3]]);; # Collatz' permutation.
    gap> List([-4..4],k->Modulus(a^k));
    [ 256, 64, 16, 4, 1, 3, 9, 27, 81 ]
    gap> IsTame(T) or IsTame(a);
    false
    gap> IsTame(ClassShift(0,1)) and IsTame(ClassTransposition(0,2,1,2));
    true
    gap> T^2*a*T*a^-3;
    <rcwa mapping of Z with modulus 768>
    gap> (ClassShift(1,3)*ClassReflection(2,7))^1000000;
    <bijective rcwa mapping of Z with modulus 21>

There are methods installed for `IsInjective`, `IsSurjective`, `IsBijective` and `Image`.

    gap> [ IsInjective(T), IsSurjective(T), IsBijective(a) ];
    [ false, true, true ]
    gap> Image(RcwaMapping([[2,0,1]]));
    0(2)

Images of elements, of finite sets of elements and of unions of finitely many residue classes of the source of an rcwa mapping can be computed with `^`, the same symbol as used for exponentiation and conjugation. The same works for partitions of the source into a finite number of residue classes.

    gap> 15^T;
    23
    gap> ResidueClass(1,2)^T;
    2(3)
    gap> List([[0,3],[1,3],[2,3]],ResidueClass)^a;
    [ 0(2), 1(4), 3(4) ]

For computing preimages of elements under rcwa mappings, there are methods for `PreImageElm` and `PreImagesElm`. The preimage of a finite set of ring elements or of a union of finitely many residue classes under an rcwa mapping can be computed by `PreImage`.

    gap> PreImagesElm(T,8);
    [ 5, 16 ]
    gap> PreImage(T,ResidueClass(Integers,3,2));
    Z \ 0(6) U 2(6)
    gap> M := [1];; l := [1];;
    gap> while Length(M) < 5000 do M := PreImage(T,M); Add(l,Length(M)); od; l;
    [ 1, 1, 2, 2, 4, 5, 8, 10, 14, 18, 26, 36, 50, 67, 89, 117, 157, 208,
      277, 367, 488, 649, 869, 1154, 1534, 2039, 2721, 3629, 4843, 6458 ]

There is a method for the operation `Support` for computing the support of an rcwa mapping. A synonym for `Support` is `MovedPoints`. There is also a method for `RestrictedPerm` for computing the restriction of a bijective rcwa mapping to a union of residue classes which it fixes setwise.

    gap> List([a,a^2],Support);
    [ Z \ [ -1, 0, 1 ], Z \ [ -3, -2, -1, 0, 1, 2, 3 ] ]
    gap> RestrictedPerm(ClassShift(0,2)*ClassReflection(1,2),
    >                   ResidueClass(0,2));
    <rcwa mapping of Z with modulus 2>
    gap> last = ClassShift(0,2);
    true

Rcwa mappings can be added and subtracted pointwise. However, please note that the set of rcwa mappings of a ring does not form a ring under `+` and `*`.

    gap> b := ClassShift(0,3) * a;;
    gap> [ Image((a + b)), Image((a - b)) ];
    [ 2(4), [ -2, 0 ] ]

There are operations `Modulus` (abbreviated `Mod`) and `Coefficients` for retrieving the modulus and the coefficient list of an rcwa mapping. The meaning of the return values is as described in Section 2.2.

General documentation for most operations mentioned in this section can be found in the GAP reference manual. For rcwa mappings of rings other than Z, not for all operations applicable methods are available.

As in general a subring relation R_1<R_2 does not give rise to a natural embedding of RCWA(R_1) into RCWA(R_2), there is no coercion between rcwa mappings or rcwa groups over different rings.

#### 2.4 Attributes and properties of residue-class-wise affine mappings

A number of basic attributes and properties of an rcwa mapping are derived immediately from the coefficients of its affine partial mappings. This holds for example for the multiplier and the divisor. These two values are stored as attributes `Multiplier` and `Divisor`, or for short `Mult` and `Div`. The prime set of an rcwa mapping is the set of prime divisors of the product of its modulus and its multiplier. It is stored as an attribute `PrimeSet`. An rcwa mapping is called integral if its divisor equals 1. An rcwa mapping is called balanced if its multiplier and its divisor have the same prime divisors. An integral mapping has the property `IsIntegral` and a balanced mapping has the property `IsBalanced`. An rcwa mapping of the ring of integers or of one of its semilocalizations is called class-wise order-preserving if and only if all coefficients a_r(m) (cf. Section 2.1) in the numerators of the affine partial mappings are positive. The corresponding property is `IsClassWiseOrderPreserving`. An rcwa mapping of Z is called sign-preserving if it does not map nonnegative integers to negative integers or vice versa. The corresponding property is `IsSignPreserving`. All elements of the simple group CT(Z) generated by the set of all class transpositions are sign-preserving.

    gap> u := RcwaMapping([[3,0,5],[9,1,5],[3,-1,5],[9,-2,5],[9,4,5]]);;
    gap> IsBijective(u);; Display(u);

    Bijective rcwa mapping of Z with modulus 5

                  n mod 5               |                n^f
    ------------------------------------+------------------------------------
      0                                 | 3n/5
      1                                 | (9n + 1)/5
      2                                 | (3n - 1)/5
      3                                 | (9n - 2)/5
      4                                 | (9n + 4)/5

    gap> Multiplier(u);
    9
    gap> Divisor(u);
    5
    gap> PrimeSet(u);
    [ 3, 5 ]
    gap> IsIntegral(u) or IsBalanced(u);
    false
    gap> IsClassWiseOrderPreserving(u) and IsSignPreserving(u);
    true

There are a couple of further attributes and operations related to the affine partial mappings of an rcwa mapping:

##### 2.4-1 LargestSourcesOfAffineMappings

`> LargestSourcesOfAffineMappings`( f ) | ( attribute )

Returns: The coarsest partition of `Source(f)` on whose elements the rcwa mapping f is affine.

    gap> LargestSourcesOfAffineMappings(ClassShift(3,7));
    [ Z \ 3(7), 3(7) ]
    gap> LargestSourcesOfAffineMappings(ClassReflection(0,1));
    [ Integers ]
    gap> u := RcwaMapping([[3,0,5],[9,1,5],[3,-1,5],[9,-2,5],[9,4,5]]);;
    gap> List( [ u, u^-1 ], LargestSourcesOfAffineMappings );
    [ [ 0(5), 1(5), 2(5), 3(5), 4(5) ], [ 0(3), 1(3), 2(9), 5(9), 8(9) ] ]
    gap> kappa := ClassTransposition(2,4,3,4) * ClassTransposition(4,6,8,12)
    >           * ClassTransposition(3,4,4,6);
    <bijective rcwa mapping of Z with modulus 12>
    gap> LargestSourcesOfAffineMappings(kappa);
    [ 2(4), 1(4) U 0(12), 3(12) U 7(12), 4(12), 8(12), 11(12) ]

##### 2.4-2 FixedPointsOfAffinePartialMappings

`> FixedPointsOfAffinePartialMappings`( f ) | ( attribute )

Returns: A list of the sets of fixed points of the affine partial mappings of the rcwa mapping f in the quotient field of its source.

The returned list contains entries for the restrictions of f to all residue classes modulo `Mod(f)`. A list entry can either be an empty set, the source of f or a set of cardinality 1. The ordering of the entries corresponds to the ordering of the residues in `AllResidues(Source(f),m)`.

    gap> FixedPointsOfAffinePartialMappings(ClassShift(0,2));
    [ [  ], Rationals ]
    gap> List([1..3],k->FixedPointsOfAffinePartialMappings(T^k));
    [ [ [ 0 ], [ -1 ] ], [ [ 0 ], [ 1 ], [ 2 ], [ -1 ] ],
      [ [ 0 ], [ -7 ], [ 2/5 ], [ -5 ], [ 4/5 ], [ 1/5 ], [ -10 ], [ -1 ] ] ]

##### 2.4-3 Multpk

`> Multpk`( f, p, k ) | ( operation )

Returns: The union of the residue classes r(m) such that p^k||a_r(m) if k >= 0, and the union of the residue classes r(m) such that p^k||c_r(m) if k <= 0. In this context, m denotes the modulus of f, and a_r(m) and c_r(m) denote the coefficients of f as introduced in Section 2.1.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);; # The Collatz mapping.
    gap> [ Multpk(T,2,-1), Multpk(T,3,1) ];
    [ Integers, 1(2) ]
    gap> u := RcwaMapping([[3,0,5],[9,1,5],[3,-1,5],[9,-2,5],[9,4,5]]);;
    gap> [ Multpk(u,3,0), Multpk(u,3,1), Multpk(u,3,2), Multpk(u,5,-1) ];
    [ [  ], 0(5) U 2(5), Z \ 0(5) U 2(5), Integers ]

There are attributes `ClassWiseOrderPreservingOn`, `ClassWiseConstantOn` and `ClassWiseOrderReversingOn` which store the union of the residue classes (mod `Mod(f)`) on which an rcwa mapping f of Z or of a semilocalization thereof is class-wise order-preserving, class-wise constant or class-wise order-reversing, respectively.

    gap> List([ClassTransposition(1,2,0,4),ClassShift(2,3),
    >          ClassReflection(2,5)],ClassWiseOrderPreservingOn);
    [ Integers, Integers, Z \ 2(5) ]

Finally, there are epimorphisms from the subgroup of RCWA(Z) formed by all class-wise order-preserving elements to (Z,+) and from RCWA(Z) itself to the cyclic group of order 2, respectively:

##### 2.4-4 Determinant

`> Determinant`( f ) | ( method )

Returns: The determinant of the rcwa mapping f of Z.

The determinant of an affine mapping n -> (an+b)/c whose source is a residue class r(m) is defined by b/|a|m. This definition is extended additively to determinants of rcwa mappings.

Let f be an rcwa mapping of the integers, and let m denote its modulus. Using the notation f|_r(m): n -> (a_r(m) * n + b_r(m))/c_r(m) for the affine partial mappings, the determinant det(f) of f is given by

The determinant mapping is an epimorphism from the group of all class-wise order-preserving bijective rcwa mappings of Z to (Z,+), see [Koh05], Theorem 2.11.9.

    gap> List([ClassTransposition(0,4,5,12),ClassShift(3,7)],Determinant);
    [ 0, 1 ]
    gap> Determinant(ClassTransposition(0,4,5,12)*ClassShift(3,7)^100);
    100

##### 2.4-5 Sign

`> Sign`( g ) | ( attribute )

Returns: The sign of the bijective rcwa mapping g of Z.

Let sigma be an rcwa permutation of the integers, and let m denote its modulus. Using the notation sigma|_r(m): n -> (a_r(m) * n + b_r(m))/c_r(m) for the affine partial mappings, the sign of sigma is defined by

The sign mapping is an epimorphism from RCWA(Z) to the group Z^x of units of Z, see [Koh05], Theorem 2.12.8. Therefore the kernel of the sign mapping is a normal subgroup of RCWA(Z) of index 2. The simple group CT(Z) is a subgroup of this kernel.

    gap> List([ClassTransposition(3,4,2,6),
    >          ClassShift(0,3),ClassReflection(2,5)],Sign);
    [ 1, -1, -1 ]

#### 2.5 Factoring residue-class-wise affine permutations

Factoring group elements into the members of some "nice" set of generators is often helpful. In this section we describe an operation which attempts to solve this problem for the group RCWA(Z). Elements of finitely generated rcwa groups can be factored into generators "as usual", see `PreImagesRepresentative` (3.2-3).

##### 2.5-1 FactorizationIntoCSCRCT

`> FactorizationIntoCSCRCT`( g ) | ( attribute )

`> Factorization`( g ) | ( method )

Returns: A factorization of the bijective rcwa mapping g of Z into class shifts, class reflections and class transpositions, provided that such a factorization exists and the method finds it.

The method may return `fail`, stop with an error message or run into an infinite loop. If it returns a result, this result is always correct.

The problem of obtaining a factorization as described is algorithmically difficult, and this factorization routine is currently perhaps the most sophisticated part of the RCWA package. Information about the progress of the factorization process can be obtained by setting the info level of the Info class `InfoRCWA` (7.3-1) to 2.

By default, prime switches (-> `PrimeSwitch` (2.5-2)) are taken as one factor. If the option ExpandPrimeSwitches is set, they are each decomposed into the 6 class transpositions given in the definition.

By default, the factoring process begins with splitting off factors from the right. This can be changed by setting the option Direction to `"from the left"`.

By default, a reasonably coarse respected partition of the integral mapping occuring in the final stage of the algorithm is computed. This can be suppressed by setting the option ShortenPartition equal to `false`.

By default, at the end it is checked whether the product of the determined factors indeed equals g. This check can be suppressed by setting the option NC.

    gap> Factorization(Comm(ClassShift(0,3)*ClassReflection(1,2),
    >                       ClassShift(0,2)));
    [ ClassReflection(2,3), ClassShift(2,6)^-1, ClassTransposition(0,6,2,6),
      ClassTransposition(0,6,5,6) ]

For purposes of demonstrating the capabilities of the factorization routine, in Section 5.1 Collatz' permutation is factored. Lothar Collatz has investigated this permutation in 1932. Its cycle structure is unknown so far.

The permutations of the following kind play an important role in factoring rcwa permutations of Z into class shifts, class reflections and class transpositions:

##### 2.5-2 PrimeSwitch

`> PrimeSwitch`( p ) | ( function )

`> PrimeSwitch`( p, k ) | ( function )

Returns: In the one-argument form the prime switch sigma_p := tau_0(8),1(2p) * tau_4(8),-1(2p) * tau_0(4),1(2p) * tau_2(4),-1(2p) * tau_2(2p),1(4p) * tau_4(2p),2p+1(4p), and in the two-argument form the restriction of sigma_p by n -> kn.

For an odd prime p, the prime switch sigma_p is a bijective rcwa mapping of Z with modulus 4p, multiplier p and divisor 2. The key mathematical property of a prime switch is that it is a product of class transpositions, but that its multiplier and its divisor are coprime anyway. Prime switches can be distinguished from other rcwa mappings by their GAP property `IsPrimeSwitch`.

    gap> Display(PrimeSwitch(3));

    Wild bijective rcwa mapping of Z with modulus 12

                  n mod 12              |          n^PrimeSwitch(3)
    ------------------------------------+------------------------------------
       0                                | n/2
       1  7                             | n + 1
       2  6 10                          | (3n + 4)/2
       3  9                             | n
       4                                | n - 3
       5  8 11                          | n - 1

    gap> Factorization(PrimeSwitch(3));
    [ ClassTransposition(1,6,0,8), ClassTransposition(5,6,4,8),
      ClassTransposition(0,4,1,6), ClassTransposition(2,4,5,6),
      ClassTransposition(2,6,1,12), ClassTransposition(4,6,7,12) ]

Obtaining a factorization of a bijective rcwa mapping into class shifts, class reflections and class transpositions is particularly difficult if multiplier and divisor are coprime. A prototype of permutations which have this property has been introduced in a different context in [Kel99]:

##### 2.5-3 mKnot

`> mKnot`( m ) | ( function )

Returns: The permutation g_m as introduced in [Kel99].

The argument m must be an odd integer greater than 1.

    gap> Display(mKnot(5));

    Wild bijective rcwa mapping of Z with modulus 5

                  n mod 5               |             n^mKnot(5)
    ------------------------------------+------------------------------------
      0                                 | 6n/5
      1                                 | (4n + 1)/5
      2                                 | (6n - 2)/5
      3                                 | (4n + 3)/5
      4                                 | (6n - 4)/5

In his article, Timothy P. Keller shows that a permutation of this type cannot have infinitely many cycles of any given finite length.

#### 2.6 Extracting roots of residue-class-wise affine mappings

##### 2.6-1 Root

`> Root`( f, k ) | ( method )

Returns: An rcwa mapping `g` such that `g^k=f`, provided that such a mapping exists and that there is a method available which can determine it.

Currently, extracting roots is implemented for rcwa permutations of finite order.

    gap> Root(ClassTransposition(0,2,1,2),100);
    <bijective rcwa mapping of Z with modulus 8>
    gap> Display(last);

    Bijective rcwa mapping of Z with modulus 8

                  n mod 8               |                n^f
    ------------------------------------+------------------------------------
      0 1 2 3 4 5                       | n + 2
      6                                 | n - 5
      7                                 | n - 7

    gap> last^100 = ClassTransposition(0,2,1,2);
    true

#### 2.7 Special functions for non-bijective mappings

##### 2.7-1 RightInverse

`> RightInverse`( f ) | ( attribute )

Returns: A right inverse of the injective rcwa mapping f, i.e. a mapping g such that fg = 1.

    gap> twice := 2*IdentityRcwaMappingOfZ;
    Rcwa mapping of Z: n -> 2n
    gap> twice * RightInverse(twice);
    IdentityMapping( Integers )

##### 2.7-2 CommonRightInverse

`> CommonRightInverse`( l, r ) | ( operation )

Returns: A mapping d such that ld = rd = 1.

The mappings l and r must be injective, and their images must form a partition of their source.

    gap> twice := 2*IdentityRcwaMappingOfZ; twiceplus1 := twice+1;
    Rcwa mapping of Z: n -> 2n
    Rcwa mapping of Z: n -> 2n + 1
    gap> Display(CommonRightInverse(twice,twiceplus1));

    Rcwa mapping of Z with modulus 2

                  n mod 2               |                n^f
    ------------------------------------+------------------------------------
      0                                 | n/2
      1                                 | (n - 1)/2

##### 2.7-3 ImageDensity

`> ImageDensity`( f ) | ( attribute )

Returns: The image density of the rcwa mapping f.

In the notation introduced in the definition of an rcwa mapping, the image density of an rcwa mapping f is defined by 1/m sum_r(m) in R/mR |R/c_r(m)R|/|R/a_r(m)R|. The image density of an injective rcwa mapping is <= 1, and the image density of a surjective rcwa mapping is >= 1 (this can be seen easily). Thus in particular the image density of a bijective rcwa mapping is 1.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);; # The Collatz mapping.
    gap> List( [ T, ClassShift(0,1), RcwaMapping([[2,0,1]]) ], ImageDensity );
    [ 4/3, 1, 1/2 ]

Given an rcwa mapping `f`, the function `InjectiveAsMappingFrom` returns a set `S` such that the restriction of `f` to `S` is injective, and such that the image of `S` under `f` is the entire image of `f`.

    gap> InjectiveAsMappingFrom(T);
    0(2)

#### 2.8 On trajectories and cycles of residue-class-wise affine mappings

RCWA provides various methods to compute trajectories of rcwa mappings:

##### 2.8-1 Trajectory (methods for rcwa mappings)

`> Trajectory`( f, n, length ) | ( method )

`> Trajectory`( f, n, length, m ) | ( method )

`> Trajectory`( f, n, terminal ) | ( method )

`> Trajectory`( f, n, terminal, m ) | ( method )

Returns: The first length iterates in the trajectory of the rcwa mapping f starting at n, respectively the initial part of the trajectory of the rcwa mapping f starting at n which ends at the first occurence of an iterate in the set terminal. If the argument m is given, the iterates are reduced (mod m).

To save memory when computing long trajectories containing huge iterates, the reduction (mod m) is done each time before storing an iterate. In place of the ring element n, the methods also accept a finite set of ring elements or a union of residue classes.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);; # The Collatz mapping.
    gap> Trajectory(T,27,15); Trajectory(T,27,20,5);
    [ 27, 41, 62, 31, 47, 71, 107, 161, 242, 121, 182, 91, 137, 206, 103 ]
    [ 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 0, 3, 0, 0, 3 ]
    gap> Trajectory(T,15,[1]); Trajectory(T,15,[1],2);
    [ 15, 23, 35, 53, 80, 40, 20, 10, 5, 8, 4, 2, 1 ]
    [ 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1 ]
    gap> Trajectory(T,ResidueClass(Integers,3,0),Integers);
    [ 0(3), 0(3) U 5(9), 0(3) U 5(9) U 7(9) U 8(27),
      <union of 20 residue classes (mod 27)>,
      <union of 73 residue classes (mod 81)>, Z \ 10(81) U 37(81), Integers ]

##### 2.8-2 Trajectory (methods for rcwa mappings -- "accumulated coefficients")

`> Trajectory`( f, n, length, whichcoeffs ) | ( method )

`> Trajectory`( f, n, terminal, whichcoeffs ) | ( method )

Returns: Either the list `c` of triples of coprime coefficients such that for any `k` it holds that `n^(f^(k-1)) = (c[k][1]*n + c[k][2])/c[k][3]` or the last entry of that list, depending on whether whichcoeffs is `"AllCoeffs"` or `"LastCoeffs"`.

The meanings of the arguments length and terminal are the same as in the methods for the operation `Trajectory` described above. In general, computing only the last coefficient triple (whichcoeffs = `"LastCoeffs"`) needs considerably less memory than computing the entire list.

    gap> Trajectory(T,27,[1],"LastCoeffs");
    [ 36472996377170786403, 195820718533800070543, 1180591620717411303424 ]
    gap> (last[1]*27+last[2])/last[3];
    1

When dealing with problems like the 3n+1-Conjecture or when determining the degree of transitivity of the natural action of an rcwa group on its underlying ring, an important task is to determine the residue classes whose elements get larger or smaller when applying a given rcwa mapping:

##### 2.8-3 IncreasingOn & DecreasingOn (for an rcwa mapping)

`> IncreasingOn`( f ) | ( attribute )

`> DecreasingOn`( f ) | ( attribute )

Returns: The union of all residue classes r(m) such that |R/a_r(m)R| > |R/c_r(m)R| or |R/a_r(m)R| < |R/c_r(m)R|, respectively, where R denotes the source, m denotes the modulus and a_r(m), b_r(m) and c_r(m) denote the coefficients of f as introduced in Section 2.1.

    gap> List([1..3],k->IncreasingOn(T^k));
    [ 1(2), 3(4), 3(4) U 1(8) U 6(8) ]
    gap> List([1..3],k->DecreasingOn(T^k));
    [ 0(2), Z \ 3(4), 0(4) U 2(8) U 5(8) ]
    gap> a := RcwaMapping([[2,0,3],[4,-1,3],[4,1,3]]);; # Collatz' permutation
    gap> List([-2..2],k->IncreasingOn(a^k));
    [ Z \ 1(8) U 7(8), 0(2), [  ], Z \ 0(3), 1(9) U 4(9) U 5(9) U 8(9) ]

We assign certain directed graphs to rcwa mappings, which encode the order in which trajectories may traverse the residue classes modulo some modulus:

##### 2.8-4 TransitionGraph

`> TransitionGraph`( f, m ) | ( operation )

Returns: The transition graph of the rcwa mapping f for modulus m.

The transition graph Gamma_f,m of f for modulus m is defined as follows:

1. The vertices are the residue classes (mod m).

2. There is an edge from r_1(m) to r_2(m) if and only if there is some n in r_1(m) such that n^f in r_2(m).

The assignment of the residue classes (mod m) to the vertices of the graph corresponds to the ordering of the residues in `AllResidues(Source(f),m)`. The result is returned in the format used by the package GRAPE [Soi02].

There are a couple of operations and attributes which are based on these graphs:

##### 2.8-5 OrbitsModulo

`> OrbitsModulo`( f, m ) | ( operation )

Returns: The partition of `AllResidues(Source(f),m)` corresponding to the weakly connected components of the transition graph of the rcwa mapping f for modulus m.

    gap> OrbitsModulo(ClassTransposition(0,2,1,4),8);
    [ [ 0, 1, 4 ], [ 2, 5, 6 ], [ 3 ], [ 7 ] ]

##### 2.8-6 FactorizationOnConnectedComponents

`> FactorizationOnConnectedComponents`( f, m ) | ( operation )

Returns: The set of restrictions of the rcwa mapping f to the weakly connected components of its transition graph Gamma_f,m.

The product of the returned mappings is f. They have pairwise disjoint supports, hence any two of them commute.

    gap> sigma := ClassTransposition(1,4,2,4)  * ClassTransposition(1,4,3,4)
    >           * ClassTransposition(3,9,6,18) * ClassTransposition(1,6,3,9);;
    gap> List(FactorizationOnConnectedComponents(sigma,36),Support);
    [ 33(36) U 34(36) U 35(36), 9(36) U 10(36) U 11(36),
      <union of 23 residue classes (mod 36)> \ [ -6, 3 ] ]

##### 2.8-7 TransitionMatrix

`> TransitionMatrix`( f, m ) | ( operation )

Returns: The transition matrix of the rcwa mapping f for modulus m.

Let M be this matrix. Then for any two residue classes r_1(m), r_2(m) in R/mR, the entry M_r_1(m),r_2(m) is defined by

where hatm is the product of m and the square of the modulus of f. The assignment of the residue classes (mod m) to the rows and columns of the matrix corresponds to the ordering of the residues in `AllResidues(Source(f),m)`.

The transition matrix is a weighted adjacency matrix of the corresponding transition graph `TransitionGraph(f,m)`. The sums of the rows of a transition matrix are always equal to 1.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);; # The Collatz mapping.
    gap> Display(TransitionMatrix(T^3,3));
    [ [  1/8,  1/4,  5/8 ],
      [    0,  1/4,  3/4 ],
      [    0,  3/8,  5/8 ] ]

##### 2.8-8 Sources & Sinks (of an rcwa mapping)

`> Sources`( f ) | ( attribute )

`> Sinks`( f ) | ( attribute )

Returns: A list of unions of residue classes modulo the modulus m of the rcwa mapping f, as described below.

The returned list contains an entry for any strongly connected component of the transition graph of f for modulus `Mod(f)` which has only outgoing edges ("source") or which has only ingoing edges ("sink"), respectively. The list entry corresponding to such a component is the union of the vertices belonging to it.

    gap> g := ClassTransposition(0,2,1,2)*ClassTransposition(0,2,1,4);;
    gap> Sources(g); Sinks(g);
    [ 0(4) ]
    [ 1(4) ]

##### 2.8-9 Loops

`> Loops`( f ) | ( attribute )

Returns: If f is bijective, the list of non-isolated vertices of the transition graph of f for modulus `Mod(f)` which carry a loop. In general, the list of vertices of that transition graph which carry a loop, but which f does not fix setwise.

    gap> Loops(ClassTransposition(0,2,1,2)*ClassTransposition(0,2,1,4));
    [ 0(4), 1(4) ]

There is a nice invariant of trajectories of the Collatz mapping:

##### 2.8-10 GluckTaylorInvariant

`> GluckTaylorInvariant`( a ) | ( function )

Returns: The invariant introduced in [GT02]. This is (sum_i=1^l a_i * a_i mod l + 1)/(sum_i=1^l a_i^2), where l denotes the length of a.

The argument a must be a list of integers. In [GT02] it is shown that if a is a trajectory of the `original' Collatz mapping n -> (n/2 if n even, 3n+1 if n odd) starting at an odd integer >= 3 and ending at 1, then the invariant lies in the interval ]9/13,5/7[.

    gap> C := RcwaMapping([[1,0,2],[3,1,1]]);;
    gap> List([3,5..49],n->Float(GluckTaylorInvariant(Trajectory(C,n,[1]))));
    [ 0.701053, 0.696721, 0.708528, 0.707684, 0.706635, 0.695636, 0.711769,
      0.699714, 0.707409, 0.693833, 0.710432, 0.706294, 0.714242, 0.699935,
      0.714242, 0.705383, 0.706591, 0.698198, 0.712222, 0.714242, 0.709048,
      0.69612, 0.714241, 0.701076 ]

Quite often one can make certain "educated guesses" on the overall behaviour of the trajectories of a given rcwa mapping. For example it is reasonably straightforward to make the conjecture that all trajectories of the Collatz mapping eventually enter the finite set -136, -91, -82, -68, -61, -55, -41, -37, -34, -25, -17, -10, -7, -5, -1, 0, 1, 2, or that "on average" the next number in a trajectory of the Collatz mapping is smaller than the preceding one by a factor of sqrt3/2. However it is clear that such guesses can be wrong, and that they therefore cannot be used to prove anything. Nevertheless they can sometimes be useful:

##### 2.8-11 LikelyContractionCentre

`> LikelyContractionCentre`( f, maxn, bound ) | ( operation )

Returns: A list of ring elements (see below).

This operation tries to compute the contraction centre of the rcwa mapping f. Assuming its existence this is the unique finite subset S_0 of the source of f on which f induces a permutation and which intersects nontrivially with any trajectory of f. The mapping f is assumed to be contracting, i.e. to have such a contraction centre. As in general contraction centres are likely not computable, the methods for this operation are probabilistic and may return wrong results. The argument maxn is a bound on the starting value and bound is a bound on the elements of the trajectories to be searched. If the limit bound is exceeded, an Info message on Info level 3 of `InfoRCWA` is given.

    gap> T := RcwaMapping([[1,0,2],[3,1,2]]);; # The Collatz mapping.
    gap> S0 := LikelyContractionCentre(T,100,1000);
    #I  Warning: `LikelyContractionCentre' is highly probabilistic.
    The returned result can only be regarded as a rough guess.
    See ?LikelyContractionCentre for more information.
    [ -136, -91, -82, -68, -61, -55, -41, -37, -34, -25, -17, -10, -7, -5,
      -1, 0, 1, 2 ]

##### 2.8-12 GuessedDivergence

`> GuessedDivergence`( f ) | ( operation )

Returns: A floating point value which is intended to be a rough guess on how fast the trajectories of the rcwa mapping f diverge (return value greater than 1) or converge (return value smaller than 1).

Nothing particular is guaranteed.

    gap> GuessedDivergence(T);
    #I  Warning: GuessedDivergence: no particular return value is guaranteed.
    0.866025

#### 2.9 The categories and families of rcwa mappings

##### 2.9-1 IsRcwaMapping

`> IsRcwaMapping`( f ) | ( filter )

`> IsRcwaMappingOfZ`( f ) | ( filter )

`> IsRcwaMappingOfZ_pi`( f ) | ( filter )

`> IsRcwaMappingOfGFqx`( f ) | ( filter )

Returns: `true` if f is an rcwa mapping, an rcwa mapping of the ring of integers, an rcwa mapping of a semilocalization of the ring of integers or an rcwa mapping of a polynomial ring in one variable over a finite field, respectively, and `false` otherwise.

Often the same methods can be used for rcwa mappings of the ring of integers and of its semilocalizations. For this reason there is a category `IsRcwaMappingOfZOrZ_pi` which is the union of `IsRcwaMappingOfZ` and `IsRcwaMappingOfZ_pi`. The internal representation of rcwa mappings is called `IsRcwaMappingStandardRep`. There are methods available for `ExtRepOfObj` and `ObjByExtRep`.

##### 2.9-2 RcwaMappingsFamily

`> RcwaMappingsFamily`( R ) | ( function )

Returns: The family of rcwa mappings of the ring R.

Top of Book Previous Chapter Next Chapter
Goto Chapter: Top 1 2 3 4 5 6 7 Bib Ind

generated by GAPDoc2HTML