Riffs and Rotes, Finite Partial Functions • Overview

Riffs and Rotes are two species of graph-theoretic structure in a mathematical framework which establishes a bijective Gödel numbering between the positive integers (\mathbb{N}^{+}) and finite partial functions mapping \mathbb{N}^{+} to \mathbb{N}^{+}.  This framework strips away the standard arithmetic properties of numbers to reveal their “purely combinatorial” structure through doubly recursive prime factorization.

The Core Concept: From Primes to Functions

Every positive integer has a unique factorization as a product of primes (The Fundamental Theorem of Arithmetic).  Because every prime number has a unique index, e.g. p_1 = 2, p_2 = 3, p_3 = 5, we can recursively decompose both the bases and the exponents of any number into their respective prime indices.

By mapping these recursive index structures, a natural number is transformed into a set of ordered pairs — effectively a finite partial function (\mathbb{N}^+ \to \mathbb{N}^+).

Riffs vs. Rotes

The finite partial functions may be visualized using two distinct graph-theoretic structures:

  • Riffs (Rooted Index-Functional Forests):  Represented as directed graphs (digraphs) where nodes reflect the exact recursive assignment of a prime index to its exponent.
  • Rotes (Rooted Odd Trees with only Exponent Symmetries):  Represented as undirected, rooted trees that embed the same structural information but map it into a simplified graphic form.

How the Mapping Works (Examples)

Using the basic rule where a prime factor p_{n}^{k} translates to the functional assignment of input n to output k, expressed as the ordered pair \langle n, k \rangle, numbers map directly to finite partial functions:

\begin{array}{rcccc} \text{Positive Integer} & & \text{Primes Factorization} & & \text{Finite Partial Function} \\ \hline 1 & = & \text{(empty product)}~ \varnothing & = & \text{(empty function)}~ \varnothing \\ 2 & = & p_1^1 & = & \{\langle 1, 1 \rangle\} \\ 3 & = & p_2^1 & = & \{\langle 2, 1 \rangle\} \\ 4 & = & p_1^2 & = & \{\langle 1, 2 \rangle\} \\ 5 & = & p_3^1 & = & \{\langle 3, 1 \rangle\} \\ 6 & = & {p_1^1}{p_2^1} & = & \{\langle 1, 1 \rangle, \langle 2, 1 \rangle\} \\ 7 & = & p_4^1 & = & \{\langle 4, 1 \rangle\} \\ 8 & = & p_1^3 & = & \{\langle 1, 3 \rangle\} \\ 9 & = & p_2^2 & = & \{\langle 2, 2 \rangle\} \\ 10 & = & {p_1^1}{p_3^1} & = & \{\langle 1, 1 \rangle, \langle 3, 1 \rangle\} \end{array}

Because this construction is a strict bijection, every single positive integer maps to exactly one unique finite partial function, and every finite partial function has a unique integer address (Gödel number).  Detailed combinatorial properties and sequence data for these graphs are documented on the OEIS Wiki “Riffs and Rotes” page.

Reference

  • The above text is adapted from the Google AI Overview for “Riffs and Rotes” “Finite Partial Functions” (Nov 8, 2026).

Resource

cc: Academia.edu • Cybernetics • Laws of Form • Mathstodon • SeqFan
cc: Research Gate • Structural Modeling • Systems Science • Syscoi