Related papers: La Budde's Method for Computing Characteristic Pol…

Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…

We calculate joint moments of the characteristic polynomial of a random unitary matrix from the circular unitary ensemble and its derivative in the case that the power in the moments is an odd positive integer. The calculations are carried…

We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

This paper investigates the asymptotics of the number of prime values taken by a polynomial in several variables with integer coefficients. Based on probabilistic heuristics and the multidimensional Bateman Horn conjecture, the expected…

We prove an explicit formula for the Poincar\'e polynomials of parabolic character varieties of Riemann surfaces with semisimple local monodromies, which was conjectured by Hausel, Letellier and Rodriguez-Villegas. Using an approach of…

This paper proposes a harmonic Lanczos bidiagonalization method for computing some interior singular triplets of large matrices. It is shown that the approximate singular triplets are convergent if a certain Rayleigh quotient matrix is…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of…

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…

Hamiltonian matrices appear in a variety or problems in physics and engineering, mostly related to the time evolution of linear dynamical systems as for instance in ion beam optics. The time evolution is given by symplectic transfer…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chv\'atal and Hammer, as well as by Henderson and Zalcstein in 1977. A threshold graph is obtained from a…

The problem of polynomial regression in which the usual monomial basis is replaced by the Bernstein basis is considered. The coefficient matrix A of the overdetermined system to be solved in the least squares sense is then a rectangular…

It is well known that objects can oscillate around the Lagrangian point L4. In this manuscript we compute the period of these oscillations by computing the exact expression of the characteristic polynomial of the matrix that determined the…

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to…