| personal webpage | https://homepages.cwi.nl/~ducas/ |
| github | https://github.com/lducas/ |
Even better, they even provide an easy-to-run #algorithm (#Matlab code)! Let's look at Cauchy—Schwarz in the pictures below. This is a very simple example, but it can do much more. This should tell you enough to make you want to try it!
Code (and paper proving its correctness) available on Greg Valiant's page: https://theory.stanford.edu/~valiant/pap_link.html
[I am working with a student to convert it to other languages and improve the interface]
2/2
Reposting here, as this could be of interest to the #mathematics community: the automatic inequality prover of Greg and Paul Valiant, which lets you to automatically check and (dis)prove a whole bunch of inequalities.
Basically any inequality that's a combination of Hölder and ℓp-monotonicity-type #math #maths #tools
You give a candidate inequality in that form, and the output will be either a #proof that it doesn't hold, or a message saying that it does& how to prove it!
1/2
@hellman @bruteforce Nice ! I think I'll implement the non recursive version with k^3/2 though... My k's are not that large ;)
But thanks all for the lively discussion !
. having saved the central square you are left with two similar triangle of half the size. So in the case the calls follow a perfect diagonal m+n= cste, by induction this should take you down to k log k. The general online case might be more tricky...Think of a grid. I know how to move to the right, and to the bottom from any previously visited point.
I want visit a list of points that are not given in advance. All I know is that list of point moves in the left-bottom direction.
Greedy strategy can lead you to have visiting the whole triangle, hence k^2 / 2.
Clément Canonne
Nils Weisensee
nsi_xyz