Related papers: Asymptotics of Clebsch-Gordan Coefficients

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

We show how to determine the asymptotics of a certain Selberg-type integral by means of tools available in the theory of (generalised) hypergeometric series. This provides an alternative derivation of a result of Carr\'e, Deneufch\^atel,…

We develop a simple computational tool for $SU(3)$ analogous to Bargmann's calculus for $SU(2)$. Crucial new inputs are, (i) explicit representation of the Gelfand-Zetlin basis in terms of polynomials in four variables and positive or…

This paper presents an investigation into the high-order asymptotic expansion for 2D and 3D cubic nonlinear Klein-Gordon equations in the non-relativistic limit regime. There are extensive numerical and analytic results concerning that the…

Asymptotics are given for the number of rational points in the domain of a morphism of weighted projective stacks whose images have bounded height and satisfy a (possibly infinite) set of local conditions. As a consequence we obtain results…

We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect…

The Clebsch-Gordan decomposition is calculated for direct products of the irreducible representations of the cubic space group. These results are used to identify multiparticle states which appear in the hadron spectrum on the lattice.…

We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of P\'olya and Szeg\"o, so the error incurred in truncating the series is of the same sign as the next…

This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…

In this paper, we are concerned with a non-asymptotic analysis of sampling algorithms used in nonconvex optimization. In particular, we obtain non-asymptotic estimates in Wasserstein-1 and Wasserstein-2 distances for a popular class of…

We obtain asymptotic results on the average numbers of Goldbach representations of an interger as the sum of two primes in different arithmetic progressions. We also prove an omega-result showing that the asymptotic result is essentially…

We obtain an asymptotic formula for the mean value of L-functions associated to cubic characters over F_q[t]. We solve this problem in the non-Kummer setting when q=2 (mod 3) and in the Kummer case when q=1 (mod 3). The proofs rely on…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

The Clebsch-Gordan and Racah-Wigner coefficients for the positive (or negative) discrete series of irreducible representations for the noncompact form $U_q(SU(1,1))$ of the algebra $U_q(sl(2))$ are computed.

The aim of this article is to analyze the asymptotic properties of the C-metric, using a general method specified in work of Tafel and coworkers, [1], [2], [3]. By finding an appropriate conformal factor $\Omega$, it allows the…

In this paper we prove a sharpened asymptotic for the growth of analytic torsion of congruence quotients of $\SL(n,\R)/\SO(n)$ in terms of the volume. The result is based on bounds on the trace of the heat kernel, allowing control of the…

Near-Gaussian probability densities are common in many important physical applications. Here we develop an asymptotic expansion methodology for computing entropic functionals for such densities. The expansion proposed is a close relative of…

We derived an asymptotic bound the accuracy of the estimation when we use the quantum correlation in the measuring apparatus. It is also proved that this bound can be achieved in any model in the quantum two-level system. Moreover, we show…

Pascal routines are provided that generate representations of the group $SU(3)$ and tabulate the Clebsch-Gordan coefficients in the products of representations.

In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…