To be or not to be Yutsis: algorithms for the decision problem

DOI10.1016/j.cpc.2005.07.008zbMath1196.81041OpenAlexW2102108013WikidataQ59411497 ScholiaQ59411497MaRDI QIDQ709830

Dries Van Dyck, Veerle Fack, Gunnar Brinkmann, Brendan D. McKay

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2005.07.008

zbMATH Keywords

angular momentumheuristicNP-completedecision problemdual Hamiltonian graphgeneralized recoupling coefficientYutsis graph

Mathematics Subject Classification ID

Connections of hypergeometric functions with groups and algebras, and related topics (33C80) Software, source code, etc. for problems pertaining to quantum theory (81-04) Finite-dimensional groups and algebras motivated by physics and their representations (81R05)

Related Items (3)

On the reduction of Yutsis graphs ⋮ ON THE VOLUME CONJECTURE FOR CLASSICAL SPIN NETWORKS ⋮ Graph structural properties of non-Yutsis graphs allowing fast recognition

Uses Software

• NEWGRAPH
• NJGRAF
• RACAH
• plantri
• GYutsis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the reduction of Yutsis graphs
• Calculation of general recoupling coefficients using graphical methods
• A program for deriving recoupling coefficients formulae
• To be or not to be Yutsis
• Fast generation of cubic graphs
• Maple procedures for the coupling of angular momenta. V: Recoupling coefficients

This page was built for publication: To be or not to be Yutsis: algorithms for the decision problem