# THE MATHEMATICS OF PER NØRGÅRD ’ S RHYTHMIC INFINITY SYSTEM

@inproceedings{Shallit2002THEMO, title={THE MATHEMATICS OF PER N{\O}RG{\AA}RD ’ S RHYTHMIC INFINITY SYSTEM}, author={Jeffrey Shallit}, year={2002} }

The Danish composer Per Nørg̊ard (1932–) invented a procedure for generating rhythms which was described by Erling Kullberg [5]. Reworded in mathematical notation, this procedure is as follows: Let the Fibonacci numbers (Fn)n≥0 be defined as usual by F0 = 0, F1 = 1, and Fn = Fn−1 + Fn−2. Starting with the pair (c0, c1) = (F2n, F2n+1), perform the following operation n− 2 times: • If a number Fi appears in an even-indexed position, replace it with (Fi−2, Fi−1) • If a number Fi appears in an odd… Expand

No Paper Link Available

#### 5 Citations

THE FIBONACCI QUARTERLY

- 2010

By Zeckendorf’s theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be… Expand

Volume Index

- Annals of Mathematics and Artificial Intelligence
- 2004

ALLADI, KRISHNASWAMI. "A Farey Sequence of Fibonacci Numbers," Vol. 13, No. 1, pp. 1-10. "A Rapid Method to Form Farey Fibonacci Fractions," Vol. 13, No. 1,p. 31. "Generalized Fibonacci Tiling," Vol.… Expand

The ring of k-regular sequences, II

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2003

This paper proves some new results, gives many new examples from the literature, and state some open problems in the study of k-regular sequences. Expand

N T ] 8 J un 2 02 0 On three conjectures of

- 2020

We prove three conjectures, related to the paperfolding sequence, in a recent paper of P. Barry.

On some conjectures of P. Barry

- Mathematics
- 2020

We prove a number of conjectures [arXiv:2005.04066] recently stated by P. Barry, related to the paperfolding sequence and the Rueppel sequence.

#### References

SHOWING 1-7 OF 7 REFERENCES

A Note on Gray Code and Odd-Even Merge

- Mathematics, Computer Science
- SIAM J. Comput.
- 1980

It is shown that Delange's method for computing the sum of all of the digits used when the first n nonnegative integers are expressed in base $q \geqq 2$ can be adapted to unusual number systems such as Gray code and balanced ternary and can also been adapted to count the occurrences of each digit separately. Expand

The Ring of k-Regular Sequences

- Computer Science
- Theor. Comput. Sci.
- 1990

The automatic sequence is the central concept at the intersection of formal language theory and number theory, and has been extensively studied by Christol, Kamae, Mendes France and Rauzy, and other writers. Expand

Finite automata and morphisms in assisted musical composition

- Computer Science
- 1995

It is shown how finite automata (or more generally locally catenative formulas) underlie the structure of the Formulas for String Quartet of Tom Johnson. Expand

Beyond infinity: On the Infinity Series — the DNA of Hierarchical Music.

- The Music of Per Nørg̊ard: Fourteen Interpretive Essays,
- 1996

Beyond infinity: On the Infinity Series — the DNA of Hierarchical Music The Music of Per Nørgård: Fourteen Interpretive Essays

- Beyond infinity: On the Infinity Series — the DNA of Hierarchical Music The Music of Per Nørgård: Fourteen Interpretive Essays
- 1996

Narayana's Cows and Delayed Morphisms

- Cahiers du GREYC,Troisì emes Journées d'Informatique Musicale (JIM 96)
- 1996

AMS Classification Numbers: 11B39, 68Q45

- AMS Classification Numbers: 11B39, 68Q45