The GYutsis applet generates a summation formula over products of 6-j
coefficients for a general angular momenta recoupling coefficient (or
3`n`-j coefficients). For problems upto 15 j's, corresponding
with 6 initial angular momenta, the generated formulas are confirmed
to be optimal.

In this applet the generated formula, and thus the number of Wigner 6j-symbols and summations over dummy variables, is only shown when the graph is completely reduced, i.e. equal to a triangular delta.

When the applet initially starts, a problem is already presented in the input field, but not entered yet so that the user can edit or delete it in order to define his own problem. In the examples menu, one can select some special cases, which are filled in but not entered yet, allowing the user to edit them. The cases are the following:

- W9j: the definition of the Wigner 6-j symbol.
- Cb6: smallest problem for which the heavier heuristics perform better than the Edge Cost Heuristic.
- C8: problem delivering a cubic cage of girth 8.
- C9,7: problem for which the Cycle Count Heuristic performs best.
- C9,12: problem for which the More Smaller/Less Bigger Heuristic performs 3 6-j symbols better than the Cycle Count Heuristic.

All features described above can also be selected from the menus.

- Edge Cost Heuristic
- this is the most simple and fastest heuristic: a cost is associated with each edge, equal to the difference in length of the two smallest cycles in which the edge participates. The cost of a cycle is defined as the minimum cost of its edges. This heuristic will interchange the edge with minimum cost out of the cycle with minimum cost. When two cycles have the same cost, the cycle for which the minimum edge cost is most reached is preferred, and if this is equal, the cycle with minimum total cost is choosen.
- More Smaller/Less Bigger Heuristic
- this is the default heuristic and for most cases the best choice.
This heuristic considers all possible interchanges making a girth
cycle smaller. An interchange is preferred over an other if it makes
more cycles of length
`l`smaller, or if equal, makes less bigger. This criterium is repeatedly used for rising`l`starting at the girth until a difference found. - Cycle Count Heuristic
- this heuristic also considers all possible interchanges making
a girth cycle smaller, but prefers an interchange over an other if
it it results in a graph with more cycles of length
`l`. Again this criterium is used for rising`l`, starting at the girth minus 1, until a difference is found.

For small problems (upto 22 j's) this heuristic suffices, for higher problems the heavier heuristics provide shorter formulae.

This heuristic yields shorter formulae than the Edge Cost Heuristic. For some cases it also performs better than the More Smaller/Less Bigger Heuristic, but these cases are rare.

- Generic
- a compact, human readable format. This is the default.
- LaTeX
- for the popular typesetting system LaTeX. By default a macro is used to represent the Wigner 6-j symbol. This can be turned of by clicking on the "Use macros" checkbox under the Output-menu. Afterwards the formula will be outputted in plain LaTeX.
- Maple
- for the popular computer algebra package Maple. Macros are used to represent the Kronecker delta symbol, the triangular symbol and the Wigner 6-j symbol (they are in fact Maple functions).
- Racah
- for the Maple package Racah (package especially for Racah algebra).

`<((j1,j2)j5,(j3,j4)j6)j7|((j1,j3)j8,(j2,j4)j9)j7>`

is the most known format for general recoupling coefficients.

It is not needed to specify the intermediate angular momenta:

```
<((j1,j2),(j3,j4))j|((j1,j3),(j2,j4))j><EOF>
```

is also accepted. In addition the root label can be dropped too:

```
<((j1,j2),(j3,j4))|((j1,j3),(j2,j4))><EOF>
```

The intermediate angular momenta/root will get labels of the form
`t<number>`

, with <number> starting at 1.
Note that in this case it is forbidden to use labels of this form.

- execute the algorithm step by step,
- monitor the applied rules and how they alter the graph,
- print the graph in its current state,
- print the girth cycles of the graph,
- print the cycle that will be chosen in the next step.

`http://caagt.rug.ac.be/yutsis/GYutsisAdvanced.caagt`