Related papers: La Budde's Method for Computing Characteristic Pol…
In a preceding paper the theory of nonsymmetric Macdonald polynomials taking values in modules of the Hecke algebra of type $A$ (Dunkl and Luque SLC 2012) was applied to such modules consisting of polynomials in anti-commuting variables, to…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
This paper explores the Harmonic matrix $MH(G)$ associated with a simple graph $ G $, where each entry corresponds to $ \frac{2}{d_i + d_j} $ for adjacent vertices $ v_i $ and $ v_j $. We investigate the spectral properties of this matrix,…
Burchnall and Chaundy showed that if two ODOs $P$, $Q$ with analytic coefficients commute there exists a polynomial $f(\lambda ,\mu)$ with complex coefficients such that $f(P,Q)=0$, called the BC-polynomial. This polynomial can be computed…
We present an effective harmonic density interpolation method for the numerical evaluation of singular and nearly singular Laplace boundary integral operators and layer potentials in two and three spatial dimensions. The method relies on…
This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of…
In this work, we present a new way to compute the Taylor polynomial of the matrix exponential which reduces the number of matrix multiplications in comparison with the de-facto standard Patterson-Stockmeyer method. This reduction is…
Given a finite simplicial complex L and a collection of pairs of spaces indexed by its vertex set, one can define their polyhedral product. We record a simple formula for its Euler characteristic. In special cases the formula simplifies…
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be…
We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $\pm1$. Many properties remain after these specializations, some of…
Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
This note presents some equalities in law for $Z_N:=\det(\Id-G)$, where $G$ is an element of a subgroup of the set of unitary matrices of size $N$, endowed with its unique probability Haar measure. Indeed, under some general conditions,…
Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…
In this paper, we consider the family of hyperbolic quadratic polynomials parametrised by a complex constant; namely $P_{c}(z) = z^{2} + c$ with $|c| < 1$ and the family of hyperbolic cubic polynomials parametrised by two complex constants;…
We study a unitary analog to Redheffer's matrix. It is first proved that the determinant of this matrix is the unitary analogue to that of Redheffer's matrix. We also show that the coefficients of the characteristic polynomial may be…
We study the specialization of the type A nonsymmetric Macdonald polynomials at $t=0$ based on the combinatorial formula of Haglund, Haiman, and Loehr. We prove that this specialization expands nonnegatively into the fundamental slide…