CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Approximating the Largest Root and Applications to Interlacing Families
Authors
Nima Anari
Shayan Oveis Gharan
Amin Saberi
Nikhil Srivastava
Publication date
12 April 2017
Publisher
Doi
Cite
View
on
arXiv
Abstract
We study the problem of approximating the largest root of a real-rooted polynomial of degree
n
n
n
using its top
k
k
k
coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in
k
k
k
that use the top
k
k
k
coefficients to approximate the maximum root within a factor of
n
1
/
k
n^{1/k}
n
1/
k
and
1
+
O
(
log
β‘
n
k
)
2
1+O(\tfrac{\log n}{k})^2
1
+
O
(
k
l
o
g
n
β
)
2
when
k
β€
log
β‘
n
k\leq \log n
k
β€
lo
g
n
and
k
>
log
β‘
n
k>\log n
k
>
lo
g
n
respectively. We also prove corresponding information-theoretic lower bounds of
n
Ξ©
(
1
/
k
)
n^{\Omega(1/k)}
n
Ξ©
(
1/
k
)
and
1
+
Ξ©
(
log
β‘
2
n
k
k
)
2
1+\Omega\left(\frac{\log \frac{2n}{k}}{k}\right)^2
1
+
Ξ©
(
k
l
o
g
k
2
n
β
β
)
2
, and show strong lower bounds for noisy version of the problem in which one is given access to approximate coefficients. This problem has applications in the context of the method of interlacing families of polynomials, which was used for proving the existence of Ramanujan graphs of all degrees, the solution of the Kadison-Singer problem, and bounding the integrality gap of the asymmetric traveling salesman problem. All of these involve computing the maximum root of certain real-rooted polynomials for which the top few coefficients are accessible in subexponential time. Our results yield an algorithm with the running time of
2
O
~
(
n
3
)
2^{\tilde O(\sqrt[3]n)}
2
O
~
(
3
n
β
)
for all of them
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1137%2F1.978161197...
Last time updated on 06/08/2021