Survey of Riffs and Rotes • 1

There’s a study called generalized primes which investigates in a more general way the relationship between arbitrary elements called primes and the composites which can be formed from them according to specified rules of composition.  Comparisons can be made among a variety of numerical systems or any orders of combinatorial species one might imagine.  I seem to recall at least one old monograph by Rademacher on the subject.

My fascination with questions like that led me many years ago to the Riff and Rote trick, a special case of the Make A Picture trick.  There’s a bit on that in the first article below.

Wiki Hub

Blog Dialogs

Blog Series

Excursions

Expositions

Explorations

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

#algebra, #arithmetic, #combinatorics, #computation, #graph-theory, #group-theory, #logic, #mathematics, #number-theory, #recursion, #representation, #riffs-and-rotes, #semiotics, #visualization

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_{k}^{n} translates to the functional assignment of input k to output n, expressed as the ordered pair \langle k, n \rangle, numbers map directly to finite partial functions.  The first ten cases are shown in the following Table.

Integer, Factorization, Finite Partial Function

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 (1) (2) • SeqFan
cc: Research Gate • Structural Modeling • Systems Science • Syscoi

#algebra, #arithmetic, #combinatorics, #computation, #graph-theory, #group-theory, #logic, #mathematics, #number-theory, #recursion, #representation, #riffs-and-rotes, #semiotics, #visualization

Riffs and Rotes • Overview

Riffs and Rotes are two species of graph-theoretic structure giving visual representation to the primes factorizations of integers, specifically looking at “doubly recursive factorizations”.

The Core Concept

When a number is broken down into its prime factors, those primes can themselves be broken down based on their index (e.g., the 2nd prime, the 3rd prime, etc.).  By recursively expanding these prime indices, an integer can be completely represented as a nested tree or string of prime structural indicators.

These mathematical structures may be mapped into two types of visual diagrams:

  • Riffs: A family of directed graphs (digraphs) that map out the recursive step-by-step structural relationships.
  • Rotes: A corresponding family of undirected graphs that visualize the overall underlying network.

Example: The Number 2025

An example will serve to demonstrate how numbers translate to these forms:

  1. 2025 is factored traditionally as 81 \times 25 = 3^4 \times 5^2.
  2. Because 3 is the 2^{\text{nd}} prime (p_2) and 5 is the 3^{\text{rd}} prime (p_3), this is rewritten using prime indices as {p_2}^4 \times {p_3}^2.
  3. The indices 2 and 3 are then recursively broken down into their own prime structures: 2 = p_1 and 3 = p_2 = p_{p_1}.
  4. By dropping terminal 1s, the number collapses into a pure, loss‑less recursive form:

    DRF 2025

This exact string configuration generates a completely unique geometry — its corresponding Riff and Rote — giving every positive integer its own complex, visual “fingerprint”.

Reference

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

Resources

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

#algebra, #arithmetic, #combinatorics, #computation, #graph-theory, #group-theory, #logic, #mathematics, #number-theory, #recursion, #representation, #riffs-and-rotes, #semiotics, #visualization

Riffs and Rotes • Happy New Year 2026

\text{Let} ~ p_n = \text{the} ~ n^\text{th} ~ \text{prime}.

\begin{array}{llcl}  \text{Then} & 2026 & = & 2 \cdot 1013  \\  && = & p_1 p_{170}  \\  && = & p_1 p_{2 \cdot 5 \cdot 17}  \\  && = & p_1 p_{p_1 p_3 p_7}  \\  && = & p_1 p_{p_1 p_{p_2} p_{p_4}}  \\  && = & p_1 p_{p_1 p_{p_{p_1}} p_{p_{{p_1}^{p_1}}}}  \end{array}

No information is lost by dropping the terminal 1s.  Thus we may write the following form.

2026 = p p_{p p_{p_p} p_{p_{p^p}}}

The article linked below tells how forms of that order correspond to a family of digraphs called riffs and a family of graphs called rotes.  The riff and rote for 2026 are shown in the next two Figures.

Riff 2026

Riff 2026

Rote 2026

Rote 2026

Reference

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

#algebra, #arithmetic, #combinatorics, #computation, #graph-theory, #group-theory, #logic, #mathematics, #number-theory, #recursion, #representation, #riffs-and-rotes, #semiotics, #visualization

Survey of Relation Theory • 9

In the present Survey of blog and wiki resources for Relation Theory, relations are viewed from the perspective of combinatorics, in other words, as a topic in discrete mathematics, with special attention to finite structures and concrete set‑theoretic constructions, many of which arise quite naturally in applications.  This approach to relation theory is distinct from, though closely related to, its study from the perspectives of abstract algebra on the one hand and formal logic on the other.

Elements

Relational Concepts

Relation Composition Relation Construction Relation Reduction
Relative Term Sign Relation Triadic Relation
Logic of Relatives Hypostatic Abstraction Continuous Predicate

Illustrations

Information‑Theoretic Perspective

  • Mathematical Demonstration and the Doctrine of Individuals • (1) • (2)

Blog Series

Peirce’s 1870 “Logic of Relatives”

Peirce’s 1880 “Algebra of Logic” Chapter 3

Peirce’s 1885 “Algebra of Logic”

  • C.S. Peirce • Algebra of Logic ∫ Philosophy of Notation • (1) • (2)
  • C.S. Peirce • Algebra of Logic 1885 • Selections • (1) • (2) • (3) • (4)

Resources

cc: FB | Relation Theory • Laws of Form • Mathstodon • Ontolog • Academia.edu
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science

#algebra, #algebra-of-logic, #c-s-peirce, #category-theory, #combinatorics, #discrete-mathematics, #duality, #dyadic-relations, #formal-languages, #foundations-of-mathematics, #graph-theory, #group-theory, #logic, #logic-of-relatives, #logical-graphs, #mathematics, #model-theory, #relation-theory, #semiotics, #set-theory, #sign-relational-manifolds, #sign-relations, #triadic-relations, #type-theory