English
Related papers

Related papers: Sharp estimates for large N Weingarten functions

200 papers

The Kruithof iterative scaling process, which adjusts matrices to meet target row and column sums, is a longstanding problem that lacks a general closed form for its limit. While Nathanson derived the closed form for the Sinkhorn limit of…

General Mathematics · Mathematics 2025-06-18 Max Chicky Fang

Continuous Time Markov Chains, Hawkes processes and many other interesting processes can be described as solution of stochastic differential equations driven by Poisson measures. Previous works, using the Stein's method, give the…

Probability · Mathematics 2026-04-02 Eustache Besançon , Laure Coutin , Laurent Decreusefond , Pascal Moyal

By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $\Sigma^{1/2}\mathbf{Z}$, then the sequence of random variables…

Probability · Mathematics 2020-03-18 Robert E. Gaunt

In this work the matrix exponential function is solved analytically for the special orthogonal groups $SO(n)$ up to $n=9$. The number of occurring $k$-th matrix powers gets limited to $0\leq k \leq n-1$ by exploiting the Cayley-Hamilton…

Mathematical Physics · Physics 2023-08-29 Norbert Kaiser

We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…

Probability · Mathematics 2022-09-23 Xiucai Ding , Thomas Trogdon

The large $N$ limit of SU($N$) gauge theories is well understood in perturbation theory. Also non-perturbative lattice studies have yielded important positive evidence that 't Hooft's predictions are valid. We go far beyond the statistical…

High Energy Physics - Lattice · Physics 2019-02-20 Miguel García Vera , Rainer Sommer

We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm…

High Energy Physics - Lattice · Physics 2016-02-02 P. Butera , M. Pernici

We evaluate partition functions of matrix models which are given by topologically twisted and dimensionally reduced actions of d=4 N=1 super Yang-Mills theories with classical (semi-)simple gauge groups, SO(2N), SO(2N+1) and USp(2N). The…

High Energy Physics - Theory · Physics 2008-11-26 H. Itoyama , H. Kihara , R. Yoshioka

On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…

Group Theory · Mathematics 2018-11-22 A. Yu Olshanskii

The superconformal index of $\mathcal N=4$ super-Yang Mills theory with $U(N)$ gauge group can be written as a matrix integral over the gauge group. Recently, Murthy demonstrated that this integral can be reexpressed as a sum of terms…

High Energy Physics - Theory · Physics 2023-05-10 James T. Liu , Neville Joshua Rajappa

Veestraeten [1] recently derived inverse Laplace transforms for Laplace transforms that contain products of two parabolic cylinder functions by exploiting the link between the parabolic cylinder function and the transition density and…

Mathematical Physics · Physics 2015-12-29 Dirk Veestraeten

We develop techniques to study the correlation functions of "large operators" whose bare dimension grows parametrically with N, in SO(N) gauge theory. We build the operators from a single complex matrix. For these operators, the large N…

High Energy Physics - Theory · Physics 2015-06-12 Pawel Caputa , Robert de Mello Koch , Pablo Diaz

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Group Theory · Mathematics 2009-02-10 R. I. Grigorchuk , S. V. Ivanov

The article concerns low-rank approximation of matrices generated by sampling a smooth function of two $m$-dimensional variables. We identify several misconceptions surrounding a claim that, for a specific class of analytic functions, such…

Numerical Analysis · Mathematics 2025-09-09 Stanislav Budzinskiy

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Computational Complexity · Computer Science 2017-10-10 Pranjal Dutta , Nitin Saxena , Amit Sinhababu

Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process in which the coefficients are regularly varying and innovations are independent and identically distributed and belong to the domain of attraction of an $\alpha$-stable law…

Probability · Mathematics 2023-09-22 Hui Liu , Yudan Xiong , Fangjun Xu

The integral formulae pertaining to the unitary group $\mathsf{U}(d)$ have been comprehensively reviewed, yielding fresh results and innovative proofs. Central to the derivation of these formulae lies the employment of Schur-Weyl duality, a…

Quantum Physics · Physics 2024-10-31 Lin Zhang

A discussion of discrete Wigner functions in phase space related to mutually unbiased bases is presented. This approach requires mathematical assumptions which limits it to systems with density matrices defined on complex Hilbert spaces of…

Quantum Physics · Physics 2009-11-11 Arthur O. Pittenger , Morton H. Rubin

This paper investigates the strong limiting behavior of the eigenvalues of the class of matrices $\frac1N(D_n\circ X_n)(D_n\circ X_n)^*$, studied in Girko 2001. Here, $X_n=(x_{ij})$ is an $n\times N$ random matrix consisting of independent…

Probability · Mathematics 2021-12-10 Jack W. Silverstein

We study the problem of differentially private continual counting in the unbounded setting where the input size $n$ is not known in advance. Current state-of-the-art algorithms based on optimal instantiations of the matrix mechanism cannot…

Cryptography and Security · Computer Science 2025-12-02 Ben Jacobsen , Kassem Fawaz