Tootfinder

This thread is a goldmine of technical arcana. Andiamo would never mislead… https://mastodon.social/@mcc/114622441513185735

This https://arxiv.org/abs/2505.12139 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On the logarithmic Hodge-de Rham spectral sequence for curves on K3 surfaces
We show that if $X$ is a supersingular K3 surface then there exists a curve $D$ on $X$ such that the logarithmic Hodge-de Rham spectral sequence for $(X,D)$ is nondegenerate.

📰 Seit Jahren betreibe ich Websites mit kostenlosen Informationen zu vielen Themen – und ich bezahle die #Rechnungen. Dazu benutze ich u. a. Amazon-Partnerlinks. Ich würde diese #Finanzierung gern loswerden, aber dazu benötige ich Eure Hilfe!
Bitte unterstütze meine Arbeit mit einer St…

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

"What birds can teach us about repurposing waste"
#Birds #Animals
https://phys.org/news/2025-06-birds-r…

What birds can teach us about repurposing waste
Modern cities are evolution engines. Urban snails in the Netherlands and lizards in Los Angeles have developed lighter shells and larger scales to cope with the heat island effect, where temperatures can be several degrees above the surrounding area.

Süddeutsche, was machst du? Offensichtlich kriegt auch die respektable Presse immer wieder ADAC-Syndrom.
#verkehrsgewalt ist kein Kavalliersdelikt. Blitzer retten leben.

Ravens to extend Lamar Jackson? GM says team has had 'introductory' contract talks with two-time NFL MVP

https://www.cbssports.com/nfl/news/…

The Hashed Fractal Key Recovery (HFKR) Problem: From Symbolic Path Inversion to Post-Quantum Cryptographic Keys
Mohamed Aly Bouke
https://arxiv.org/abs/2506.04383

The Hashed Fractal Key Recovery (HFKR) Problem: From Symbolic Path Inversion to Post-Quantum Cryptographic Keys
Classical cryptographic systems rely heavily on structured algebraic problems, such as factorization, discrete logarithms, or lattice-based assumptions, which are increasingly vulnerable to quantum attacks and structural cryptanalysis. In response, this work introduces the Hashed Fractal Key Recovery (HFKR) problem, a non-algebraic cryptographic construction grounded in symbolic dynamics and chaotic perturbations. HFKR builds on the Symbolic Path Inversion Problem (SPIP), leveraging symbolic tr…

This https://arxiv.org/abs/2505.03447 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Asymptotic formula for the sum of a prime and a square-full number in intervals shorter than $X^{1/2}$
Let $R(N)$ be the number of representations of $N$ as a sum of a prime and a square-full number weighted with logarithmic function. In $2024$, the author and Y. Suzuki obtained an asymptotic formula for the sum of $R(N)$ over positive integers $N$ in a short interval ($X$, $X+H$] for $X^{\frac{1}{2}+\varepsilon} \le H < X^{1-\varepsilon}$. In this article, we improve the range of $H$, that is, we prove the same asymptotic formula for $X^{\frac{32-4\sqrt{15}}{49}+\varepsilon} \le H \le X^{1- \va…

This https://arxiv.org/abs/2410.13737 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Global Optimization Algorithm through High-Resolution Sampling
We present an optimization algorithm that can identify a global minimum of a potentially nonconvex smooth function with high probability, assuming the Gibbs measure of the potential satisfies a logarithmic Sobolev inequality. Our contribution is twofold: on the one hand we propose a global optimization method, which is built on an oracle sampling algorithm producing arbitrarily accurate samples from a given Gibbs measure. On the other hand, we propose a new sampling algorithm, drawing inspirati…

This https://arxiv.org/abs/2309.01754 has been replaced.
link: https://scholar.google.com/scholar?q=a

On the success probability of the quantum algorithm for the short DLP
Ekerå and Håstad have introduced a variation of Shor's algorithm for the discrete logarithm problem (DLP). Unlike Shor's original algorithm, Ekerå-Håstad's algorithm solves the short DLP in groups of unknown order. In this work, we prove a lower bound on the probability of Ekerå-Håstad's algorithm recovering the short logarithm $d$ in a single run. By our bound, the success probability can easily be pushed as high as $1 - 10^{-10}$ for any short $d$. A key to achieving such a high success…