On the reduction of Yutsis graphs. General angular momentum recoupling coefficients can be expressed as a summation formula over products of $6-j$ coefficients. Yutsis, Levinson and Vanagas developed graphical techniques for representing the general recoupling coefficient as a cubic graph and they describe a set of reduction rules allowing a stepwise generation of the corresponding summation formula. This paper gives an overview of the state-of-the-art heuristic algorithms, used in the latest version of our GYutsis program, for calculating general recoupling coefficients. By means of an experimental setup we show that, in particular for problems of higher order, this approach yields summation formulae which are at least as good, but are often more concise than those obtained by previous algorithms. We also give a counter-example showing that the widespread convention of reducing girth cycles first does not always lead to a shortest reduction.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Aldred, Robert E. L.; van Dyck, Dries; Brinkmann, Gunnar; Fack, Veerle; McKay, Brendan D.: Graph structural properties of non-Yutsis graphs allowing fast recognition (2009)
- Van Dyck, D.; Fack, V.: On the reduction of Yutsis graphs (2007)
- Van Dyck, D.; Brinkmann, G.; Fack, V.; Mckay, B. D.: To be or not to be Yutsis: algorithms for the decision problem (2005)
- Van Dyck, D.; Fack, V.: To be or not to be Yutsis (2004)
Further publications can be found at: http://caagt.ugent.be/yutsis/yutsis-references.shtml