ترغب بنشر مسار تعليمي؟ اضغط هنا

Monomial integrals on the classical groups

612   0   0.0 ( 0 )
 نشر من قبل Thomas Gorin
 تاريخ النشر 2007
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

This paper presents a powerfull method to integrate general monomials on the classical groups with respect to their invariant (Haar) measure. The method has first been applied to the orthogonal group in [J. Math. Phys. 43, 3342 (2002)], and is here used to obtain similar integration formulas for the unitary and the unitary symplectic group. The integration formulas turn out to be of similar form. They are all recursive, where the recursion parameter is the number of column (row) vectors from which the elements in the monomial are taken. This is an important difference to other integration methods. The integration formulas are easily implemented in a computer algebra environment, which allows to obtain analytical expressions very efficiently. Those expressions contain the matrix dimension as a free parameter.



قيم البحث

اقرأ أيضاً

195 - Da Xu , Palle Jorgensen 2010
This paper is concerned with integrals which integrands are the monomials of matrix elements of irreducible representations of classical groups. Based on analysis on Young tableaux, we discuss some related duality theorems and compute the asymptotics of the group integrals when the signatures of the irreducible representations are fixed, as the rank of the classical groups go to infinity. These group integrals have physical origins in quantum mechanics, quantum information theory, and lattice Gauge theory.
We consider random stochastic matrices $M$ with elements given by $M_{ij}=|U_{ij}|^2$, with $U$ being uniformly distributed on one of the classical compact Lie groups or associated symmetric spaces. We observe numerically that, for large dimensions, the spectral statistics of $M$, discarding the Perron-Frobenius eigenvalue $1$, are similar to those of the Gaussian Orthogonal ensemble for symmetric matrices and to those of the real Ginibre ensemble for non-symmetric matrices. Using Weingarten functions, we compute some spectral statistics that corroborate this universality. We also establish connections with some difficult enumerative problems involving permutations.
The problem of electron scattering on the one-dimensional complexes is considered. We propose a novel theoretical approach to solution of the transport problem for a quantum graph. In the frame of the developed approach the solution of the transport problem is equivalent to the solution of a linear system of equations for the emph{vertex amplitudes} $mathbf{Psi}$. All major properties, such as transmission and reflection amplitudes, wave function on the graph, probability current, are expressed in terms of one $mathbf{Gamma}$-matrix that determines the transport through the graph. The transmission resonances are analyzed in detail and comparative analysis with known results is carried out.
begin{abstract} We show that if the initial profile $qleft( xright) $ for the Korteweg-de Vries (KdV) equation is essentially semibounded from below and $int^{infty }x^{5/2}leftvert qleft( xright) rightvert dx<infty,$ (no decay at $-infty$ is require d) then the KdV has a unique global classical solution given by a determinant formula. This result is best known to date. end{abstract}
359 - B. M. McCoy , J-M. Maillard 2016
We present the reduction of the correlation functions of the Ising model on the anisotropic square lattice to complete elliptic integrals of the first, second and third kind, the extension of Kramers-Wannier duality to anisotropic correlation functio ns, and the linear differential equations for these anisotropic correlations. More precisely, we show that the anisotropic correlation functions are homogeneous polynomials of the complete elliptic integrals of the first, second and third kind. We give the exact dual transformation matching the correlation functions and the dual correlation functions. We show that the linear differential operators annihilating the general two-point correlation functions are factorised in a very simple way, in operators of decreasing orders.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا