Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Partition Formalism and New Entropic-Information Inequalities for Real Numbers on an Example of Clebsch-Gordan Coefficients
61
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We discuss the procedure of different partitions in the finite set of $N$ integer numbers and construct generic formulas for a bijective map of real numbers $s_y$, where $y=1,2,ldots,N$, $N=prod limits_{k=1}^{n} X_k$, and $X_k$ are positive integers, onto the set of numbers $s(y(x_1,x_2,ldots,x_n))$. We give the functions used to present the bijective map, namely, $y(x_1,x_2,...,x_n)$ and $x_k(y)$ in an explicit form and call them the functions detecting the hidden correlations in the system. The idea to introduce and employ the notion of hidden gates for a single qudit is proposed. We obtain the entropic-information inequalities for an arbitrary finite set of real numbers and consider the inequalities for arbitrary Clebsch--Gordan coefficients as an example of the found relations for real numbers.
rate research
Read More
The Clebsch-Gordan coefficients of the group SU(2) are shown to satisfy new inequalities. They are obtained using the properties of Shannon and Tsallis entropies. The inequalities associated with the Wigner 3-j symbols are obtained using the relation of Clebsch-Gordan coefficients with probability distributions interpreted either as distributions for composite systems or distributions for noncomposite systems. The new inequalities were found for Hahn polynomials and hypergeometric functions
Generating functions for Clebsch-Gordan coefficients of osp(1|2) are derived. These coefficients are expressed as q goes to - 1 limits of the dual q-Hahn polynomials. The generating functions are obtained using two different approaches respectively based on the coherent-state representation and the position representation of osp(1j2).
We express each Clebsch-Gordan (CG) coefficient of a discrete group as a product of a CG coefficient of its subgroup and a factor, which we call an embedding factor. With an appropriate definition, such factors are fixed up to phase ambiguities. Particularly, they are invariant under basis transformations of irreducible representations of both the group and its subgroup. We then impose on the embedding factors constraints, which relate them to their counterparts under complex conjugate and therefore restrict the phases of embedding factors. In some cases, the phase ambiguities are reduced to sign ambiguities. We describe the procedure of obtaining embedding factors and then calculate CG coefficients of the group mathcal{PSL}_{2}left(7right) in terms of embedding factors of its subgroups S_{4} and mathcal{T}_{7}.
We report in this article three- and four-term recursion relations for Clebsch-Gordan coefficients of the quantum algebras $U_q(su_2)$ and $U_q(su_{1,1})$. These relations were obtained by exploiting the complementarity of three quantum algebras in a $q$-deformation of $sp(8, gr)$.
We present an algorithm for the explicit numerical calculation of SU(N) and SL(N,C) Clebsch-Gordan coefficients, based on the Gelfand-Tsetlin pattern calculus. Our algorithm is well-suited for numerical implementation; we include a computer code in an appendix. Our exposition presumes only familiarity with the representation theory of SU(2).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
