Concept of a veritable osp(1$|$2) super-triangle sum rule with 6-$j^S$ symbols from intrinsic operator techniques: an open problem
Abstract
Efficiency of intrinsic operator techniques (using only products and ranks of tensor operators) is first evidenced by condensed proofs of already known -triangle sum rules of su(2)/su(2). {\em A new compact} su(2)-{\em expression} is found, using a -series , with . This success comes from an ultimate identification process over monomials like . For osp(12), analogous principles of calculation are transposed, involving a second parameter . Ultimate identification process then must be done over binomials like . {\em Unknown} polynomials are introduced as well as their expansion coefficients, , over the binomials. It is clearly shown that a hypothetical super-triangle sum rule requires super-triangles , instead of for su(2)/su(2). Coefficients are integers ({\em conjecture 1}). Massive unknown advances are done for intermediate steps of calculation. Among other, are proved {\em two theorems} on tensor operators, "zero" by construction. However, the ultimate identification seems to lead to a dead end, due to analytical apparent complexities. Up today, except for a few of coefficients , no general formula is really available.
Cite
@article{arxiv.0811.2175,
title = {Concept of a veritable osp(1$|$2) super-triangle sum rule with 6-$j^S$ symbols from intrinsic operator techniques: an open problem},
author = {Lionel Bréhamet},
journal= {arXiv preprint arXiv:0811.2175},
year = {2008}
}
Comments
39 pages