What is known about orbifolding ordered groups and sets? Who has been involved? Links to Lee metrics? - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-22T16:11:41Z http://mathoverflow.net/feeds/question/75325 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/75325/what-is-known-about-orbifolding-ordered-groups-and-sets-who-has-been-involved-l What is known about orbifolding ordered groups and sets? Who has been involved? Links to Lee metrics? Tobias Schlemmer 2011-09-13T15:48:33Z 2011-09-14T15:59:51Z <p>In mathematical music theory several ordered groups are considered. Some examples contain the frequency space or Tonnetzes. Other groups (commutative and non-commutative ones) are discussed by Dawid Lewin (<em>Generalized Interval Systems and Transformations</em>), Rudolf Wille (discussed also by Jan Thomas Winkler: <em>Algebraische Modellierung von Tonsystemen</em>), Wilfried Neumaier (<em>Was ist ein Tonsystem?</em>) or Marek Žabka.</p> <p>Musicians are usually trained to distinguish complementary intervals such as fourth and fifth, music theorists usually treat them as the same. I'd like to investigate how the different points of view interact with each other. Mathematically this can be modelled as follows:</p> <p>We consider a po-group $(\mathbb G,\leq)$, its linear order extensions and the quotient group $\mathbb G/N$ for a given normal subgroup $N\triangleleft \mathbb G$. As the musical application doesn't honour the order relation it's not sufficient to consider convex normal subgroups of $(\mathbb G,\leq)$. Another approach relational orbifolds has been discussed by Monika Zickwolf (Contr. Gen. Alg. 7) and <a href="http://dx.doi.org/10.1007/978-3-642-01815-2_2" rel="nofollow">Daniel Borchmann &amp; Bernhard Ganter</a>. Unfortunately both articles are interested in finite ordered sets and omit the case that is interesting for my work.</p> <p>To illustrate the problem consider the set of integers $(\mathbb Z,\leq)$. A simple way of orbifolding leads to the binary relation $\{([a],[b]) \mid a,b \in \mathbb Z, a\leq b\} = \mathbb Z_{12}\times\mathbb Z_{12}$ (written as set of ordered pairs). On the other hand the same construction using the predecessor relation $\prec$ instead of the partial order $\leq$ leads to the binary relation $\{([a],[b])\mid a,b\in \mathbb Z, a= b-1\} = \{(x,y) \mid x,y\in\mathbb Z_{12}, y = x+1\}$, which again is a predecessor relation. But such a relation can not always be deduced.</p> <p>As this example suggests the problem seems to be related to cyclic orderings, though the result might not necessarily be a cyclically ordered set. A counterexample can be constructed using the group $\mathbb G=\mathbb Z\times \mathbb Z$ and $N= \langle (0,4), (5,0)\rangle$ as the generated subgroup. </p> <blockquote> <p>Which descriptions of such orbifolds exist in the language of relational structures?</p> </blockquote> <p>I'm shure there exist descriptions both for automorphisms of ordered sets as well as using properties of ordered groups. But so far I'm lacking an elegant language.</p> <p>Considering ordered groups one can try to separate in certain cases in $\mathbb G/N$ both a positive and a negative part, as well as some “intermixed” ones using nicely chosen transversal. </p> <blockquote> <p>How can such a transversal be described?</p> </blockquote> <p>Using these parts it seems to be possible to define a gerneralized Lee metric (C. Lee; IEEE Trans. Inform. Theory Vol. 4, pp. 77–82, Jun 1958). </p> <blockquote> <p>Has someone discussed such metrics?</p> </blockquote> <p><strong>Edit</strong>: The correct definitions of the used term “orbifold” can be found in the paper by Borchmann and Ganter. I'll try to summarize it in short:</p> <p>Here, an orbifold of a relational structure $(X,R)$ is a labelled relational structure $(X',R',\Lambda)$ such that $X'$ is a transversal of orbits of $X$ under the action of a subgroup $U$ of the automorphism group of $(X,R)$. $R'$ is a set of relations representing the relations of $R$ on $X'$ such that each tuple $(x_1,\ldots ,x_n)$ of a relation in R is mapped to the tuple $(x'_1,\ldots,x'_n)$ of the corresonding representatives in $X'$. The labelling $\Lambda$ assigns a labelling function to each of the relations, which maps each tuple to the set of automorphisms that must be used to reconstruct $(X,R)$ from $(X',R',\Lambda)$. Such a reconstruction is possible up to isomorphisms. Unfortunately folding ordered groups leads to many redundant loops and edges in the resultant graph, which blurr the interpretation in my case. In case of a po-group considering $(X',\leq')$ as a simple directed graph leads to the full graph on $X'$.</p>