
On Solving Linear Systems in Sublinear Time
We study sublinear algorithms that solve linear systems locally. In the ...
read it

Shifted Lanczos method for quadratic forms with Hermitian matrix resolvents
Quadratic forms of Hermitian matrix resolvents involve the solutions of ...
read it

An explicit vector algorithm for highgirth MaxCut
We give an approximation algorithm for MaxCut and provide guarantees on ...
read it

On the sensitivity of singular and illConditioned linear systems
Solving a singular linear system for an individual vector solution is an...
read it

A Residual Bootstrap for HighDimensional Regression with Near LowRank Designs
We study the residual bootstrap (RB) method in the context of highdimen...
read it

Longest Increasing Subsequence under Persistent Comparison Errors
We study the problem of computing a longest increasing subsequence in a ...
read it

A topological dynamical system with two different positive sofic entropies
A sofic approximation to a countable group is a sequence of partial acti...
read it
Solving for best linear approximates
Our goal is to finally settle a persistent problem in Diophantine Approximation, that of finding best inhomogeneous linear approximates. Classical results from the theory of continued fractions solve the special homogeneous case in the form of a complete sequence of normal approximates. Real expansions that allow the notion of normality to percolate into the inhomogeneous setting will provide us with the general solution.
READ FULL TEXT
Comments
There are no comments yet.