We can also use the assoicated graph to analyze scales other than RI scales; here is the connectivity of the scales having eight steps of size 2 and two steps of size 3 in the 22-et:

c = 6

2222322223

c = 5

2222232223

c = 4

2222223223

c = 3

2222222323 and 2222222233

No surprises here, but there might be other things people think would be worth analyzing.

--- In tuning-math@y..., "genewardsmith" <genewardsmith@j...> wrote:

> We can also use the assoicated graph to analyze scales other than RI scales; here is the connectivity ...

The 7-limit edge-connectivity ...

--- In tuning-math@y..., "genewardsmith" <genewardsmith@j...> wrote:

> We can also use the assoicated graph to analyze scales other than

RI scales; here is the connectivity of the scales having eight steps

of size 2 and two steps of size 3 in the 22-et:

>

> c = 6

>

> 2222322223

>

> c = 5

>

> 2222232223

>

> c = 4

>

> 2222223223

>

> c = 3

>

> 2222222323 and 2222222233

>

> No surprises here, but there might be other things people think >

would be worth analyzing.

Is an MOS (in an ET or linear temperament) always more connected than

any of its permutations? Probably not -- what conditions can we place

on the situations in which it is?