Generator gronut/Mathematics: Difference between revisions

From Xenharmonic Reference
 
(10 intermediate revisions by the same user not shown)
Line 3: Line 3:
(Under construction)
(Under construction)


== Definition ==
== Grylinder ==
Let <math>m > 1</math> and <math>n > m, \gcd(n, m) = 1</math> be integer edos and fix a generator <math>g, 2 \leq g \leq m - 2</math> with <math>\gcd(g, m) = 1.</math> Let <math>h</math> be the modular inverse of <math>g</math> modulo <math>m.</math>
Let <math>m > 1</math> and <math>n > m, \gcd(n, m) = 1</math> be integer edos and fix a generator <math>g, 2 \leq g \leq m - 2</math> with <math>\gcd(g, m) = 1.</math> Let <math>h</math> be the modular inverse of <math>g</math> modulo <math>m.</math>


Line 11: Line 11:
# Take <math>n</math> equally spaced points on said circle. For sake of canonicality one of the <math>n</math> points is taken to be a "glue point".
# Take <math>n</math> equally spaced points on said circle. For sake of canonicality one of the <math>n</math> points is taken to be a "glue point".
# Unglue the line segments and put them back at their original positions.
# Unglue the line segments and put them back at their original positions.
The resulting embedding of <math>\mathbb{Z}/n</math> into <math>C</math> is called the <math>(n, g\backslash m)</math>-'''gronut'''.
The resulting sequence of embeddings <math>\mathbb{Z}/n \to S^1\to C</math> is called the <math>(n, g\backslash m)</math>-'''grylinder'''.


== Straddle generator structure ==
== Gronut ==
Take the grylinder. For each vertex, corresponding to a note of n-edo, draw an edge corresponding to 1\n and two edges for the two nearest intervals in n-edo to g\m, which straddle g\m. The resulting graph is called the '''gronut graph''' or the '''gronut'''; every vertex of the gronut has degree 6, and the graph forms a triangulation of the torus.

Latest revision as of 13:54, 20 October 2026

This is a technical or mathematical page. While the subject may be of some relevance to music, the page treats the subject in technical language.

(Under construction)

Grylinder

Let m>1 and n>m,gcd⁡(n,m)=1 be integer edos and fix a generator g,2≤g≤m−2 with gcd⁡(g,m)=1. Let h be the modular inverse of g modulo m.

Consider the "cylinder" C=ℤ/m×[0,1) with coordinates (x,y) = (along "longitude", along "meridian"). Follow the following procedure:

  1. Glue copies of the real interval ("line segment") [0,1) end to end, making a (continuous) circle of circumference m. For every copy of [0,1) the next copy is the one that is h steps away along the longitude.
  2. Take n equally spaced points on said circle. For sake of canonicality one of the n points is taken to be a "glue point".
  3. Unglue the line segments and put them back at their original positions.

The resulting sequence of embeddings ℤ/n→S1→C is called the (n,g∖m)-grylinder.

Gronut

Take the grylinder. For each vertex, corresponding to a note of n-edo, draw an edge corresponding to 1\n and two edges for the two nearest intervals in n-edo to g\m, which straddle g\m. The resulting graph is called the gronut graph or the gronut; every vertex of the gronut has degree 6, and the graph forms a triangulation of the torus.