Skip to main content
Rollback to Revision 3
Source Link
Carlo Beenakker
  • 188.1k
  • 18
  • 448
  • 651

You should probably delete this question Chains of numbers generated by 2 involutions

You should probably delete$\DeclareMathOperator\GF{GF}$Consider the finite field $\GF(p)$ for prime $p$.

Consider the pair of involutions $f(x) = 1-x$ , $g(x) = 1/x$, and the chain of numbers generated by these 2 involutions in the following way: $$\cdots f(g(f(x))) \leftarrow g(f(x)) \leftarrow f(x) \to x \to g(x) \to f(g(x) \to g(f(g(x)) \cdots$$

Apparently the maximal length of this questionchain for specific $x$ is equal to 6.

Could you please explain if this construction has some special name in mathematics, or was studied in the theory of finite fields?

For example for $\GF(31)$ we have:

\begin{gather*} 12 \leftarrow 20 \leftarrow 14 \to 18 \to 19 \to 13 \to 12 \\ 12, 13, 14, 18, 19, 20. \end{gather*}

You should probably delete this question

You should probably delete this question

Chains of numbers generated by 2 involutions

$\DeclareMathOperator\GF{GF}$Consider the finite field $\GF(p)$ for prime $p$.

Consider the pair of involutions $f(x) = 1-x$ , $g(x) = 1/x$, and the chain of numbers generated by these 2 involutions in the following way: $$\cdots f(g(f(x))) \leftarrow g(f(x)) \leftarrow f(x) \to x \to g(x) \to f(g(x) \to g(f(g(x)) \cdots$$

Apparently the maximal length of this chain for specific $x$ is equal to 6.

Could you please explain if this construction has some special name in mathematics, or was studied in the theory of finite fields?

For example for $\GF(31)$ we have:

\begin{gather*} 12 \leftarrow 20 \leftarrow 14 \to 18 \to 19 \to 13 \to 12 \\ 12, 13, 14, 18, 19, 20. \end{gather*}

deleted 667 characters in body
Source Link
Alexander
  • 33
  • 1
  • 1
  • 6

Chains of numbers generated by 2 involutions You should probably delete this question

$\DeclareMathOperator\GF{GF}$Consider the finite field $\GF(p)$ for prime $p$.

Consider the pair of involutions $f(x) = 1-x$ , $g(x) = 1/x$, and the chain of numbers generated by these 2 involutions in the following way: $$\cdots f(g(f(x))) \leftarrow g(f(x)) \leftarrow f(x) \to x \to g(x) \to f(g(x) \to g(f(g(x)) \cdots$$

Apparently the maximal length of this chain for specific $x$ is equal to 6.

Could you please explain if You should probably delete this construction has some special name in mathematics, or was studied in the theory of finite fields?

For example for $\GF(31)$ we have:

\begin{gather*} 12 \leftarrow 20 \leftarrow 14 \to 18 \to 19 \to 13 \to 12 \\ 12, 13, 14, 18, 19, 20. \end{gather*}question

Chains of numbers generated by 2 involutions

$\DeclareMathOperator\GF{GF}$Consider the finite field $\GF(p)$ for prime $p$.

Consider the pair of involutions $f(x) = 1-x$ , $g(x) = 1/x$, and the chain of numbers generated by these 2 involutions in the following way: $$\cdots f(g(f(x))) \leftarrow g(f(x)) \leftarrow f(x) \to x \to g(x) \to f(g(x) \to g(f(g(x)) \cdots$$

Apparently the maximal length of this chain for specific $x$ is equal to 6.

Could you please explain if this construction has some special name in mathematics, or was studied in the theory of finite fields?

For example for $\GF(31)$ we have:

\begin{gather*} 12 \leftarrow 20 \leftarrow 14 \to 18 \to 19 \to 13 \to 12 \\ 12, 13, 14, 18, 19, 20. \end{gather*}

You should probably delete this question

You should probably delete this question

edited tags
Link
YCor
  • 63.9k
  • 5
  • 187
  • 286
Proofreading
Source Link
LSpice
  • 12.9k
  • 4
  • 45
  • 69
Loading
Source Link
Alexander
  • 33
  • 1
  • 1
  • 6
Loading