SearcharxivSearch

arXiv · 2510.21186

Weingarten Calculus with Virtual Isometries

Abstract

In this paper, we develop a novel approach to the Weingarten calculus by employing the notion of virtual isometries. Traditionally, Weingarten calculus provides explicit formulas for integrating polynomial functions over compact matrix groups with respect to the Haar measure, yet it faces limitations when evaluating high-degree integrals due to the non-invertibility of the associated matrices. We revisit these classical computations from a new perspective: by constructing Haar-distributed matrices as products of sequences of complex reflections, we derive new recursive structures for the Weingarten functions across different dimensions. This framework leads to two main results: (1) an explicit Weingarten calculus for complex reflections, yielding systematic moment computations for associated rank-one matrices, and (2) a novel convolution formula that connects Weingarten functions in dimension $n$ to those in dimension $n-1$, through the introduction of ascension functions in the symmetric group algebra. Our approach not only provides a unified treatment for unitary groups, but also sheds light on the algebraic and probabilistic aspects of high-degree integral computations. We present several examples and applications.

Explore related subjects

Keep this discovery

BibTeXRIS

Benoît Collins, Sho Matsumoto. 2025-10-24. Weingarten Calculus with Virtual Isometries. https://doi.org/10.3842/sigma.2026.077

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR