Related papers: Computing the Characteristic Polynomial of Generic…
We consider the moment space $\mathcal{M}^{p}_{2n+1}$ of moments up to the order $2n + 1$ of $p_n\times p_n$ real matrix measures defined on the interval $[0,1]$. The asymptotic properties of the Hankel determinant $\{\log\det…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…
Consider the Laguerre polynomials and deform them by the introduction in the measure of an exponential singularity at zero. In [Chen Y., Its A., J. Approx. Theory 162 (2010), 270-297, arXiv:0808.3590] the authors proved that this…
We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: -- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted…
We use a Monte Carlo method to assemble finite element matrices for polynomial Chaos approximations of elliptic equations with random coefficients. In this approach, all required expectations are approximated by a Monte Carlo method. The…
We present a polynomial space Monte Carlo algorithm that given a directed graph on $n$ vertices and average outdegree $\delta$, detects if the graph has a Hamiltonian cycle in $2^{n-\Omega(\frac{n}{\delta})}$ time. This asymptotic scaling…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…
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…
We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…
We study the monic polynomials orthogonal with respect to a symmetric perturbed Gaussian weight $$ w(x;t):=\mathrm{e}^{-x^2}\left(1+t\: x^2\right)^\lambda,\qquad x\in \mathbb{R}, $$ where $t> 0,\;\lambda\in \mathbb{R}$. This weight is…
The Goeritz matrix is an alternative to the Kauffman bracket and, in addition, makes it possible to calculate the Jones polynomial faster with some minimal choice of a checkerboard surface of a link diagram. We introduce a modification of…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…
The Worldvolume Hybrid Monte Carlo method (WV-HMC method) [arXiv:2012.08468] is a reliable and versatile algorithm towards solving the sign problem. Similarly to the tempered Lefschetz thimble method, this method removes the ergodicity…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We present an algorithm to recover a minimal local apolar scheme to a homogeneous polynomial $F$. The socle degree of the scheme determines whether it is evinced by a Generalized Additive Decomposition (GAD) of $F$ or of an extension. We…
The problem of computing the global minimum of a trigonometric polynomial is computationally hard. We address this problem for the case, where the polynomial is invariant under the exponential action of a finite group. The strategy is to…
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…