Related papers: A note on trigonometric identities involving non-c…
We introduce and study the Weingarten calculus for centered random permutation matrices in the symmetric group S_N. After presenting a formulation of the Weingarten calculus on the symmetric group, we derive a formula in the centered case,…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
Nonlinear statistics (i.e. statistics of permanents) on the eigenvalues of invariant random matrix models are considered for the three Dyson's symmetry classes $\beta=1,2,4$. General formulas in terms of hyperdeterminants are found for…
We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap…
This PhD thesis aims at describing the applications of noncommutative geometry to particle physics and quantum field theory. It includes a brief survey of the basic principles and definitions of noncommutative geometry such as spectral…
Most finite element methods for solving time-harmonic wave-propagation problems lead to a linear system with a non-normal coefficient matrix. The non-normality is due to boundary conditions and losses. One way to solve these systems is to…
For a linear equality constrained convex optimization problem involving two objective functions with a ``nonsmooth" + ``nonsmooth" composite structure, we study two algorithms derived from a mixed-order dynamical system which incorporates…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice,…
We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature…
In this paper, we give several matrix representations for the Horadam quaternions. We derive several identities related to these quaternions by using the matrix method. Since quaternion multiplication is not commutative, some of our results…
We describe a novel algorithm for solving general parametric (nonlinear) eigenvalue problems. Our method has two steps: first, high-accuracy solutions of non-parametric versions of the problem are gathered at some values of the parameters;…
In this paper we develop algorithms for orthogonal similarity transformations of skew-symmetric matrices to simpler forms. The first algorithm is similar to the algorithm for the block antitriangular factorization of symmetric matrices, but…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The…
Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…
Tensor networks (TNs) have been gaining interest as multiway data analysis tools owing to their ability to tackle the curse of dimensionality and to represent tensors as smaller-scale interconnections of their intrinsic features. However,…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…