[EDIT - I added "... is it special" to the title. If you are using some rotated Euclid in your patterns - how did you choose the rotation? Or, why did you choose to not rotate?]
I was looking into properties of Euclidean patterns, and possible alternate implementations
( euclidOff \neq euclidOffBool )
The important property is "even-ness", and this is defined, and unique, only up to rotation. My question is - what rotation do we actually want? And what rotation is produced by Bjorklund's algorithm?
The papers I find (e.g., Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, and David R. Wood: The Distance Geometry of Music) are silent on this.
Example: all rotations for bjorklund (5, 13)
are (in lexicographically decreasing order)
([1,0,1,0,0,1,0,1,0,0,1,0,0],-5,False)
([1,0,1,0,0,1,0,0,1,0,1,0,0],-4,False)
([1,0,0,1,0,1,0,0,1,0,1,0,0],-3,True)
([1,0,0,1,0,1,0,0,1,0,0,1,0],-2,False)
([1,0,0,1,0,0,1,0,1,0,0,1,0],-1,False)
the second component is also the start value of a simple algorithm that produces the sequence, and the third component says True
to indicate the sequence returned by tidal's actual implementation. That index goes all over the place, e.g.,
([1,1,0,1,0,1,1,0,1,0,1,0],-7,False)
([1,1,0,1,0,1,0,1,1,0,1,0],-6,False)
([1,0,1,1,0,1,0,1,1,0,1,0],-5,True)
([1,0,1,1,0,1,0,1,0,1,1,0],-4,False)
([1,0,1,0,1,1,0,1,0,1,1,0],-3,False)
([1,0,1,0,1,1,0,1,0,1,0,1],-2,False)
([1,0,1,0,1,0,1,1,0,1,0,1],-1,False)
([1,0,0,1,0,0,0,1,0,0,0],-3,False)
([1,0,0,0,1,0,0,1,0,0,0],-2,False)
([1,0,0,0,1,0,0,0,1,0,0],-1,True)
([1,0,1,0,1,0,1,0,1,0,0],-5,True)
([1,0,1,0,1,0,1,0,0,1,0],-4,False)
([1,0,1,0,1,0,0,1,0,1,0],-3,False)
([1,0,1,0,0,1,0,1,0,1,0],-2,False)
([1,0,0,1,0,1,0,1,0,1,0],-1,False)
we could also discuss the "proper" definition of "even-ness" but that's easier since several are equivalent (see cited paper). The definition I like best is that the sets of factors (of equal length) are balanced (cf. lothaire chapter 3 - Sturmian words, p. 42)