English

Concept of a veritable osp(1$|$2) super-triangle sum rule with 6-$j^S$ symbols from intrinsic operator techniques: an open problem

Mathematical Physics 2008-11-14 v1 math.MP Quantum Algebra

Abstract

Efficiency of intrinsic operator techniques (using only products and ranks of tensor operators) is first evidenced by condensed proofs of already known \bigtriangledown-triangle sum rules of su(2)/suq_q(2). {\em A new compact} suq_q(2)-{\em expression} is found, using a qq-series Φ\Phi, with Φ(n)q=1=1\Phi(n)_{| q=1}=1. This success comes from an ultimate identification process over monomials like (c0)p(c_0)^p. For osp(1|2), analogous principles of calculation are transposed, involving a second parameter d0d_0. Ultimate identification process then must be done over binomials like (c0+d02)Ωm(d02)m{(c_{0}+{d_{0}}^{2})}^{\Omega -m} ({d_{0}}^{2})^{m}. {\em Unknown} polynomials P{\cal P} are introduced as well as their expansion coefficients, xx, over the binomials. It is clearly shown that a hypothetical super-triangle sum rule requires super-triangles S\bigtriangleup^{S}, instead of \bigtriangledown for su(2)/suq_q(2). Coefficients xx 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 xx, 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