相关论文: Using Hook Schur Functions to Compute Matrix Cocha…

Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems as smooth unconstrained problems over the set of symmetric matrices which are then solved via the cubic-regularized Newton method. A…

A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…

This article is the second of a series of three presenting an alternative method to compute the one-loop scalar integrals. It extends the results of the first article to general complex masses. Let us remind the main features enjoyed by…

We show some of the mathematics that is being developed for the computation of deep inelastic structure functions to three loops. These include harmonic sums, harmonic polylogarithms and a class of difference equations that can be solved…

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…

We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…

We discuss the shuffle product of the Schur multiple zeta values, which are the special values of Schur multiple zeta functions. We first define $2$-labeled Schur posets to generalize Yamamoto's integral expression of the multiple zeta…

We compute the characteristic polynomials of affine Cartan, adjacency matrices and Coxeter polynomials of the associated Coxeter system using Chebyshev polynomials. We give explicit factorization of these polynomials as products of…

In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…

Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, folding of address octets using the exclusive-or operation and…

For a tensor product of algebras twisted by a bicharacter, we completely describe its Hochschild cohomology, as a Gerstenhaber algebra, in terms of the Hochschild cohomology of its component parts. This description generalizes a result of…

We survey a number of different methods for computing $L(\chi,1-k)$ for a Dirichlet character $\chi$, with particular emphasis on quadratic characters. The main conclusion is that when $k$ is not too large (for instance $k\le100$) the best…

We compute the Selberg trace formula for Hecke operators (also called the trace formula for modular correspondences) in the context of cocompact Kleinian groups with finite-dimentional unitary representations. We give some applications to…

We compute the Hodge filtration on cohomology groups of complements of complex coordinate subspace arrangements. By means of this result we construct integral representations of holomorphic functions such that kernels of these…

This paper is concerned with two improved variants of the Hutch++ algorithm for estimating the trace of a square matrix, implicitly given through matrix-vector products. Hutch++ combines randomized low-rank approximation in a first phase…

Given a vector bundle $E$, we give an explicit formula to compute Chern classes of Schur bundles $\operatorname{S}^\alpha E$ in terms of those of $E$.

Formulas for matrix determinants, algebraic adjunctions, characteristic polynomial coefficients, components of eigenvectors are obtained in the form of signless sums of matrix elements products taking by special graphs. Signless formulas…

Coded computation is a method to mitigate "stragglers" in distributed computing systems through the use of error correction coding that has lately received significant attention. First used in vector-matrix multiplication, the range of…

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

We define various height functions for motives over number fields. We compare these height functions with classical height functions on algebraic varieties, and also with analogous height functions for variations of Hodge structures on…