Gauss Congruence

In mathematics, Gauss congruence is a property held by certain sequences of integers, including the Lucas numbers and the divisor sum sequence. Sequences satisfying this property are also known as Dold sequences, Fermat sequences, Newton sequences, and realizable sequences. The property is named after Carl Friedrich Gauss (1777–1855), although Gauss never defined the property explicitly.

Sequences satisfying Gauss congruence naturally occur in the study of topological dynamics, algebraic number theory and combinatorics.

Definition

A sequence of integers $(a_1,a_2,\dots)$ satisfies Gauss congruence if
: $\sum_\mu(d)a_\equiv 0\pmod$
for every $n\geq 1$, where $\mu$ is the Möbius function. By Möbius inversion, this condition is equivalent to the existence of a sequence of integers $(b_1,b_2,\dots)$ such that
: $a_n=\sum_b_dd$
for every $n\geq 1$. Furthermore, this is equivalent to the existence of a sequence of integers $(c_1,c_2,\dots)$ such that
: $a_n=c_1a_+c_2a_+\cdots+c_a_1+nc_n$
for every $n\geq 1$. If the values $c_n$ are eventually zero, then the sequence $(a_1,a_2,\dots)$ satisfies a linear recurrence.

A direct relationship between the sequences $(b_1,b_2,\dots)$ and $(c_1,c_2,\dots)$ is given by the equality of generating functions
: $\sum_c_nx^n=1-\prod_(1-x^n)^$.

Examples

Below are examples of sequences $(a_n)_$ known to satisfy Gauss congruence.

* $(a^n)$ for any integer $a$, with $c_1=a$ and $c_n=0$ for $n>1$.
* $(A^n)$ for any square matrix $A$ with integer entries.
* The divisor-sum sequence $(1,3,4,7,6,12,\dots)$, with $b_n=1$ for every $n\geq 1$.
* The Lucas numbers $(1,3,4,7,11,18\dots)$, with $c_1=c_2=1$ and $c_n=0$ for every $n>2$.

In dynamical systems

Consider a discrete-time dynamical system, consisting of a set $X$ and a map $T:X\to X$. We write $T^n$ for the $n$^th iteration of the map, and say an element $x$ in $X$ has ''period'' $n$ if $T^nx=x$.

Suppose the number of points in $X$ with period $n$ is finite for every $n\geq 1$. If $a_n$ denotes the number of such points, then the sequence $(a_n)_$ satisfies Gauss congruence, and the associated sequence $(b_n)_$ counts orbits of size $n$.

For example, fix a positive integer $\alpha$. If $X$ is the set of aperiodic necklaces with beads of $\alpha$ colors and $T$ acts by rotating each necklace clockwise by a bead, then $a_n=\alpha^n$ and $b_n$ counts Lyndon words of length $n$ in an alphabet of $\alpha$ letters.

In algebraic number theory

Gauss congruence can be extended to sequences of rational numbers, where such a sequence $(a_n)_$ satisfies Gauss congruence ''at a prime'' $p$ if
: $\sum_\mu(d)a_\equiv 0\pmod$
for every $n=p^r$ with $r\geq 1$, or equivalently, if $a_\equiv a_\textp^r$ for every $r\geq 1$.

A sequence of rational numbers $(a_n)_$ defined by a linear recurrence satisfies Gauss congruence at all but finitely many primes if and only if
: $a_n=\sum_^r q_i_(\theta_i^n)$,
where $\mathbb$ is an algebraic number field with $\theta_1,\dots,\theta_r\in\mathbb$, and $q_1,\dots,q_r\in\mathbb$.

See also

* Necklace polynomial
* Necklace ring

References

{{reflist

Integer sequences
Mathematical theorems