Related papers: La Budde's Method for Computing Characteristic Pol…
In this paper, we give a reduced formula of the characteristic polynomial of $k$-uniform hypergraphs with a pendant edge. And the explicit characteristic polynomial and all distinct eigenvalues of $k$-uniform hyperpath are given.
A straightforward algorithm for the symbolic computation of higher-order symmetries of nonlinear evolution equations and lattice equations is presented. The scaling properties of the evolution or lattice equations are used to determine the…
We study the graded polynomial identities with a homogeneous involution on the algebra of upper triangular matrices endowed with a fine group grading. We compute their polynomial identities and a basis of the relatively free algebra,…
We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed according to the Haar measure over the orthogonal or unitary group. Our technique samples directly a factorization of the Hessenberg form of such…
The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…
Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…
In this paper, we investigate characteristic polynomials of matrices in min-plus algebra. Eigenvalues of min-plus matrices are known to be the minimum roots of the characteristic polynomials based on tropical determinants which are designed…
Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as…
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…
Multiple orthogonal polynomials (MOP) are a non-definite version of matrix orthogonal polynomials. They are described by a Riemann-Hilbert matrix Y consisting of four blocks Y_{1,1}, Y_{1,2}, Y_{2,1} and Y_{2,2}. In this paper, we show that…
Ensembles of complex symmetric, and complex self dual random matrices are known to exhibit local statistical properties distinct from those of the non-Hermitian Ginibre ensembles. On the other hand, in distinction to the latter, the joint…
In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given…