Related papers: Matrix approach to hypercomplex Appell polynomials
We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.
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 present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…
Initiated by Mulmuley, Vazirani, and Vazirani (1987), many algebraic algorithms have been developed for matching and related problems. In this paper, we review basic facts and discuss possible improvements with the aid of fast computation…
We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…
One approach to parametric and adaptive model reduction is via the interpolation of orthogonal bases, subspaces or positive definite system matrices. In all these cases, the sampled inputs stem from matrix sets that feature a geometric…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…
This paper presents the non-linear generalization of a previous work on matrix differential models. It focusses on the construction of approximate solutions of first-order matrix differential equations Y'(x)=f(x,Y(x)) using matrix-cubic…
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
The primary goal of this paper is to introduce and investigate generalized incomplete exponential functions with matrix parameters. Integral representation, differential formula, addition formula, multiplication formula, and recurrence…
In this paper, we are interested in matrix valued orthogonal polynomials on the real line with respect to exponential weights. We obtain strong asymptotics as the degree tends to infinity in different regions of the complex plane, as well…
A novel algebra underlying integrable systems is shown to generate and unify a large class of quantum integrable models with given $R$-matrix, through reductions of an ancestor Lax operator and its different realizations. Along with known…
In this paper we study hypercomplex manifolds in four dimensions. Rather than using an approach based on differential forms, we develop a dual approach using vector fields. The condition on these vector fields may then be interpreted as Lax…
Integral Cauchy theorem is used to derive closed-form expressions of the roots of a univariate polynomial of any degree as integrals of elementary functions.
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
A notion of Drinfeld polynomials is introduced for modules of two-parameter quantum affine algebras. Finite dimensional representations are then characterized by sets of $l$-tuples of pairs of Drinfeld polynomials with certain conditions.
In this paper, we derive novel formulas and identities connecting Cauchy numbers and polynomials with both ordinary and generalized Stirling numbers, binomial coefficients, central factorial numbers, Euler polynomials, $r$-Whitney numbers,…