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

TL;DR
This paper explores intrinsic operator techniques to derive sum rules for osp(1|2) superalgebra, introduces new polynomial structures, and discusses the challenges in establishing a super-triangle sum rule due to complex analytical issues.
Contribution
It extends intrinsic operator techniques to osp(1|2), introduces new polynomial expansions, and highlights the difficulties in formulating a super-triangle sum rule.
Findings
New compact su_q(2) expression using q-series.
Introduction of unknown polynomials and their coefficients.
Proved two tensor operator theorems that are zero by construction.
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 …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Numerical Methods and Algorithms · Matrix Theory and Algorithms
