HoriAsso - Progress Log

June 2

• Rewritten the constructors for the class Words, which will be documented in the Documentation page of this project.

• Written the java code to generate all Lyndon words from length 1 to length N, with k generators. This will be posted in the repository and documented in Documentation].

June 5

• Imported the Source code and the executables for the classes Word, Words, and LyndonWords into the repository from a MAC Os.
• Tried to set up a subversion client on AIX Unix.

August 16

• Written the Java Free Lie Algebra package and documented it in Documentation.

• The trivial but time-consuming part was to try to optimize the add/simplify function. I wrote binary search/sort functions that used the basis of the Free Lie Algebra, but realize afterwards that it would be better to just binary sort the $i^{th}$ term (assuming the summands are already reduced to a linear combination of the basis)into the 1 to $i-1^{th}$ terms because the generated basis takes up a lot of memory and limits the maximum length at which any calculation can be done just because the basis for that length is too big. The latter option is also as efficient as the first. Depending on if we will need to generate the basis anyways for our calculation, the add/simplify method will be changed.

Sept 19

• Written algorithm to reduce any Lie Tree of generators in the form $t_{i,j}$ for any i,j pair to a Lie Tree with generators of the same reach only, where $reach(t_{i,j})=max\{i,j\}$

• I now need to decide how to restructure all the java classes. For instance, should I modify the LieTree class so that any LieTree object involves generators of a generic generator class and make a child class which uses the specific generators $t_{i,j}$ or is $t_{i,j}$ practically the most general form already?