12,154
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday November 25, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Riffs and Rotes (view source)
Revision as of 04:22, 10 February 2010
, 04:22, 10 February 2010→Idea
|}
|}
Applying the same procedure to any positive integer <math>n\!</math> produces an expression called the ''doubly recursive factorization'' of <math>n.\!</math> Let <math>\mathbb{M}</math> be the set of positive integers and let <math>\mathcal{L}</math> be the set of doubly recursive factorization expressions. Then the procedure just described defines a mapping <math>\operatorname{drf} : \mathbb{M} \to \mathcal{L}</math> that allows the doubly recursive factorization of <math>n\!</math> to be denoted <math>\operatorname{drf}(n).\!</math>
Applying the same procedure to any positive integer <math>n\!</math> produces an expression called the ''doubly recursive factorization'' of <math>n.\!</math> If <math>\mathbb{M}</math> is the set of positive integers, <math>\mathcal{L}</math> is the set of doubly recursive factorization expressions, and the mapping defined by the factorization process is denoted <math>\operatorname{drf} : \mathbb{M} \to \mathcal{L},</math> then the doubly recursive factorization of <math>n\!</math> is denoted <math>\operatorname{drf}(n).\!</math>
The forms of DRF expressions can be mapped into either one of two classes of graph-theoretical structures, called ''riffs'' and ''rotes'', respectively.
The forms of DRF expressions can be mapped into either one of two classes of graph-theoretical structures, called ''riffs'' and ''rotes'', respectively.
