Approximation of the Lagrange and Markov spectra

08/10/2019
by   Vincent Delecroix, et al.
0

The (classical) Lagrange spectrum is a closed subset of the positive real numbers defined in terms of diophantine approximation. Its structure is quite involved. This article describes a polynomial time algorithm to approximate it in Hausdorff distance. It also extends to approximate the Markov spectrum related to infimum of binary quadratic forms.

READ FULL TEXT
research
03/14/2023

Algorithms for Length Spectra of Combinatorial Tori

Consider a weighted, undirected graph cellularly embedded on a topologic...
research
01/30/2022

Polynomial-Time Approximation of Zero-Free Partition Functions

Zero-free based algorithm is a major technique for deterministic approxi...
research
04/25/2022

A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games

Since the celebrated PPAD-completeness result for Nash equilibria in bim...
research
10/27/2016

Explicit equivalence of quadratic forms over F_q(t)

We propose a randomized polynomial time algorithm for computing nontrivi...
research
09/03/2019

Inverse problems for symmetric doubly stochastic matrices whose Suleĭmanova spectra are to be bounded below by 1/2

A new sufficient condition for a list of real numbers to be the spectrum...
research
02/05/2022

Weisfeiler-Lehman meets Gromov-Wasserstein

The Weisfeiler-Lehman (WL) test is a classical procedure for graph isomo...
research
06/09/2022

An approximation algorithm for random generation of capacities

Capacities on a finite set are sets functions vanishing on the empty set...

Please sign up or login with your details

Forgot password? Click here to reset