Related papers: Semi-analytical solutions for eigenvalue problems …
We study the problem of approximating the largest root of a real-rooted polynomial of degree $n$ using its top $k$ coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in $k$ that…
We show that for a given set $\Lambda$ of $nk$ distinct real numbers $\lambda_1, \lambda_2, \ldots, \lambda_{nk}$ and $k$ graphs on $n$ nodes, $G_0, G_1,\ldots,G_{k-1}$, there are real symmetric $n\times n$ matrices $A_s$, $s=0,1,\ldots,…
We define the family of symmetric truncated Freud polynomials $P_n(x;z)$, orthogonal with respect to the linear functional $\mathbf{u}$ defined by \begin{equation*} \langle \mathbf{u}, p(x)\rangle = \int_{-z}^z p(x)e^{-x^4}dx, \quad p\in…
We solve an eigenvalue equation that appears in several papers about a wide range of physical problems. The Frobenius method leads to a three-term recurrence relation for the coefficients of the power series that, under suitable truncation,…
Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…
In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…
We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\gamma>0$, we give a $n^{O(\log n)}$ time algorithm that given a…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
We show that for a number of parameterized problems for which only $2^{O(k)} n^{O(1)}$ time algorithms are known on general graphs, subexponential parameterized algorithms with running time $2^{O(k^{1-\frac{1}{1+\delta}} \log^2 k)}…
The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…
We study the asymptotics of recurrence coefficients for monic orthogonal polynomials p_n(z) with the quartic exponential weight exp [-N (1/2 z^2 + t/4 z^4)], where t is complex. Our goals are: A) to describe the regions of different…
Integral formulae for polynomial solutions of the quantum Knizhnik-Zamolodchikov equations associated with the R-matrix of the six-vertex model are considered. It is proved that when the deformation parameter q is equal to e^{+- 2 pi i/3}…
We study two inexact methods for solutions of random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric matrix operator, the methods solve for eigenvalues and…
We study the spatial distribution of the positive, negative and non-real complex roots $z_n $ of the sequence the $(n+1)$th degree polynomial equation $$ z^{n+1}=(1+z)^n,\quad n \in \mathbb{N}.$$ We establish asymptotic approximations to…
We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…
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…
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…
We discuss a quartic eigenvalue problem arising in the context of an optical waveguiding problem involving atomically thick 2D materials. The waveguide configuration we consider consists of a gradient-index (spatially dependent) dielectric…