Breaking news in the algorithmic/arithmetic world!
Integer multiplication in time O(n · log n). 
It means you can multiply two n-bits integer using roughly n log n operations. It's a *very* important problem because a lot of mathematical software rely on efficient integer multiplication.
It breaks the last best known algorithm  (Schönhage–Strassen), that was in O(n · log n · log log n)
The curse of the Euclidean metric: http://corner.mimuw.edu.pl/?p=1073
Krzysztof Fleszar posts about a big difficulty with algorithms for problems like Euclidean shortest paths where the answer is a sum of distances: we don't know how to compare two solutions efficiently.
Krzysztof's SODA 2019 paper on approximate TSP of hyperplanes (find a short tour that touches each given hyperplane) is https://epubs.siam.org/doi/10.1137/1.9781611975482.67 — fortunately in this case it's possible to use approximate numerical comparisons.
Today's classical algorithm for your perusal: The Schorr-Waite graph traversal algorithm.
US Politics, American Jewish Culture, Zionism Show more
An amazing interview with Eli Valley about the inherent conflicts that American Jewish Culture is attempting to digest. Related to McCain's ridiculous statements last week.
The amount i want is $100 each in five (7)pieces so that will make it a total of $700 I’ll be reimbursing back to you.When you get them,just scratch it and take a picture of them and attach it to the email then send it to me here ok.
And don’t forget to keep the hard copies for me . Thanks.
Boost if you think I should do it 😉
Just wanna put it out there, this paper on the fundamentals of distributed consensus is a really big deal.
Mathematicians: *look up in a daze, the shores of impossible lands glinting in their eyes and the language of madness upon their tongues* four people on earth can understand my research and i have no greater living enemies than they
"ETS Isn't TLS and You Shouldn't Use It" #EFF
ETS ("Extra-Terrible Security") is a banking-industry proposal to replace #TLS13. ETS intentionally disables forward secrecy by using a static value for all handshakes rather than per-handshake random values.
@johnathan012 this is true of all hard drives unfortunately, due to historical decisions in boot sequence design. if you know any way around this let me know, it is also a problem for me!
math puzzle, hint 2 Show more
Still no attempts. Last hint unless someone expresses interest in this puzzle. Next puzzle will be easier.
Choose a translation randomly.
This paper on a malloc() replacement that DOES COMPACTION even on C/C++ is making the rounds: https://arxiv.org/pdf/1902.04738.pdf
math puzzle, hint 1 Show more
No attempts yet, so I will give the first hint:
The critical property of the Smith-Volterra-Cantor set is that it has measure 1/2.
math puzzle Show more
(note: this puzzle is an original creation, so apologies in advance if I made some mistake devising it.)
math puzzle Show more
These were popular last time so I will try and post puzzles more regularly. Please spoiler-cw your solutions.
Let \(S\) be the [Smith-Volterra-Cantor set] repeated on the whole real line. (That is, the union of all integer translations of the Smith-Volterra-Cantor set.) Prove that for any 2 points on the real line, there exists some translation of \(S\) containing both points.
they/them. undergrad - type theory, software verification, category theory, cryptography, topology.
A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.
\) for inline LaTeX, and
\] for display mode.