Lesson plan
Word equation
A word equation is a formal equality E := u \overset{\cdot}{=} v between a pair of words u and v , each over an alphabet \Sigma \cup \Xi comprising both constants (cf. \Sigma ) and unknowns (cf. \Xi ). An assignment h of constant words to the unknowns of E is said to solve E if it maps both sides of E to identical words. Word equations are a central object in combinatorics on words; they play an analogous role in this area as do Diophantine equations in number theory. One stark difference is that Diophantine equations have an undecidable solubility problem, whereas the analogous problem for word equations is decidable. A classical example of a word equation is the commutation equation xw\overset{\cdot}{=}wx , in which x is an unknown and w is a primitive terminal word. It is well-known that the solutions of the commutation equation are exactly those assignments mapping x to some power of w . Another example is the conjugacy equation xz\overset{\cdot}{=}zy , in which x, y, and z are all unknowns. The solutions of this equation are precisely those assignments h sending x and y to conjugate words, with the image h(z) being filled in as appropriate. Many subclasses of word equations have been introduced, some of which include: * constant-free equations, which are those u\overset{\cdot}{=}v such that u,v comprise unknowns only.…
Article summary
A word equation is a formal equality E := u \overset{\cdot}{=} v between a pair of words u and v , each over an alphabet \Sigma \cup \Xi comprising both constants (cf. \Sigma ) and unknowns (cf. \Xi ). An assignment h of constant words to the unknowns of E is said to solve E if it maps both sides of E to identical words. Word equations are a central object in combinatorics on words; they play an analogous role in this area as do Diophantine equations in number theory. One stark difference is that Diophantine equations have an undecidable solubility problem, whereas the analogous problem for word equations is decidable. A classical example of a word equation is the commutation equation xw\overset{\cdot}{=}wx , in which x is an unknown and w is a primitive terminal word. It is well-known that the solutions of the commutation equation are exactly those assignments mapping x to some power of w . Another example is the conjugacy equation xz\overset{\cdot}{=}zy , in which x, y, and z are all unknowns. The solutions of this equation are precisely those assignments h sending x and y to conjugate words, with the image h(z) being filled in as appropriate. Many subclasses of word equations have been introduced, some of which include: * constant-free equations, which are those u\overset{\cdot}{=}v such that u,v comprise unknowns only.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.