Tootfinder

Equality is Far Weaker than Constant-Cost Communication
Mika G\"o\"os, Nathaniel Harms, Artur Riazanov
https://arxiv.org/abs/2507.11162 https://

Equality is Far Weaker than Constant-Cost Communication
We exhibit an $n$-bit communication problem with a constant-cost randomized protocol but which requires $n^{Ω(1)}$ deterministic (or even non-deterministic) queries to an Equality oracle. Therefore, even constant-cost randomized protocols cannot be efficiently "derandomized" using Equality oracles. This improves on several recent results and answers a question from the survey of Hatami and Hatami (SIGACT News 2024). It also gives a significantly simpler and quantitatively superior proof of the…

A Practical Guide to using Pauli Path Simulators for Utility-Scale Quantum Experiments
Hrant Gharibyan, Siddharth Hariprakash, Mohammed Zuhair Mullath, Vincent P. Su
https://arxiv.org/abs/2507.10771

A Practical Guide to using Pauli Path Simulators for Utility-Scale Quantum Experiments
In this this paper we present an inexpensive protocol to perform runtime and memory estimation for large-scale experiments with Pauli Path simulators (PPS). Additionally, we propose a conceptually simple solution for studying whether PPS can be used as a scientific discovery tool, rather than reproducing existing answers. We start by analyzing the dynamics of the Pauli coefficients tracked in the Heisenberg picture. In addition to surprisingly generic convergence features of the Pauli coefficie…

Bond percolation in distorted square and triangular lattices
Bishnu Bhowmik, Sayantan Mitra, Robert M Ziff, Ankur Sensharma
https://arxiv.org/abs/2509.09999 https://

Bond percolation in distorted square and triangular lattices
This article presents a Monte Carlo study on bond percolation in distorted square and triangular lattices. The distorted lattices are generated by dislocating the sites from their regular positions. The amount and direction of the dislocations are random, but can be tuned by the distortion parameter $α$. Once the sites are dislocated, the bond lengths $δ$ between the nearest neighbors change. A bond can only be occupied if its bond length is less than a threshold value called the connection t…

Selenskyj: Mehr als 20 Tote nach russischem Angriff
Bei einem russischen Angriff in der Region Donezk sind nach Behördenangaben aus Kiew mehr als 20 Zivilisten im Osten der Ukraine ums Leben gekommen. Die Menschen hätten für ihre Rentenzahlung angestanden, als die gelenkte Fliegerbombe eingeschlagen sei, schrieb der ukrainische Präsident Wolodymyr Selenskyj auf Telegram. "Brutaler russischer Luftangriff auf die ländliche Sied…
📑

Ukraine-Liveblog: ++ Selenskyj fordert Reaktion der G20-Staaten ++
Der ukrainische Präsident Selenskyj hat nach dem russischen Luftangriff in der Ostukraine eine Reaktion der G20-Staaten gefordert. Deutschland und Frankreich schlagen in einem Positionspapier neue EU-Sanktionen gegen Russland vor.

from my link log —
Rubik's cube perfect scramble.
https://www.solutionslookingforproblems.com/post/the-rubik-s-cube-perfect-scramble
saved 2025-08-02

The Rubik's Cube Perfect Scramble
The ChallengeI was playing with my son’s Rubik’s Cubes and tried to scramble a cube randomly so that no two squares with the same color were side by side. Here’s one way to do it: But I wanted a scramble that looked like a random scramble. No matter how many different moves I made, I couldn’t do it. Every time I separated two squares with the same color, two other squares of the same color would touch somewhere else.Looking for an easy answer, I went to puzzling.stackexchange.com and fo…

So to summarize this whole adventure:
1. A good 45 minutes was spent to get an answer that we probably could have gotten in 5 minutes in the 2010's, or in maybe 1-2 hours in the 1990's.
2. The time investment wasn't a total waste as we learned a lot along the way that we wouldn't have in the 2010's. Most relevant is the wide range of variation (e.g. a 2x factor depending on fiber intake!).
3. Most of the search engine results were confidently wrong answers that had no relation to reality. We were lucky to get one that had real citations we could start from (but that same article included the bogus 4.91 kcal/gram number). Next time I want to know a random factoid I might just start on Google scholar.
4. At least one page we chased citations through had a note at the top about being frozen due to NIH funding issues. The digital commons is under attack on multiple fronts.
All of this is yet another reason not to support the big LLM companies.
#AI

Por lo visto mi pixel 6a estš afectado por el problema del sobrecalentamiento de la batería, y a partir de julio va a recibir una actualización de software que reduce un poco el rendimiento y la carga de la batería con el fin de evitar dicho sobrecalentamiento.
Lo bueno, por decirlo de alguna manera, que Google me ofrece como compensación (recordemos que el móvil tiene ya 3 años y por lo tanto ya no tiene garantía) 100$ en efectivo o 150$ de descuento en la compra de un pixel nuevo.

A Deterministic Partition Tree and Applications
Haitao Wang
https://arxiv.org/abs/2507.01775 https://arxiv.org/pdf/2507.01775

A Deterministic Partition Tree and Applications
In this paper, we present a deterministic variant of Chan's randomized partition tree [Discret. Comput. Geom., 2012]. This result leads to numerous applications. In particular, for $d$-dimensional simplex range counting (for any constant $d \ge 2$), we construct a data structure using $O(n)$ space and $O(n^{1+ε})$ preprocessing time, such that each query can be answered in $o(n^{1-1/d})$ time (specifically, $O(n^{1-1/d} / \log^{Ω(1)} n)$ time), thereby breaking an $Ω(n^{1-1/d})$ lower bound …

It's time to lower your inhibitions towards just asking a human the answer to your question.
In the early nineties, effectively before the internet, that's how you learned a lot of stuff. Your other option was to look it up in a book. I was a kid then, so I asked my parents a lot of questions.
Then by ~2000 or a little later, it started to feel almost rude to do this, because Google was now a thing, along with Wikipedia. "Let me Google that for you" became a joke website used to satirize the poor fool who would waste someone's time answering a random question. There were some upsides to this, as well as downsides. I'm not here to judge them.
At this point, Google doesn't work any more for answering random questions, let alone more serous ones. That era is over. If you don't believe it, try it yourself. Between Google intentionally making their results worse to show you more ads, the SEO cruft that already existed pre-LLMs, and the massive tsunami of SEO slop enabled by LLMs, trustworthy information is hard to find, and hard to distinguish from the slop. (I posted an example earlier: #AI #LLMs #DigitalCommons #AskAQuestion

Lower Bounds for Linear Operators
Young Kun Ko
https://arxiv.org/abs/2509.02730 https://arxiv.org/pdf/2509.02730 …

Lower Bounds for Linear Operators
We consider a static data structure problem of computing a linear operator under cell-probe model. Given a linear operator $M \in \mathbb{F}_2^{m \times n}$, the goal is to pre-process a vector $X \in \mathbb{F}_2^n$ into a data structure of size $s$ to answer any query $\langle M_i , X \rangle$ in time $t$. We prove that for a random operator $M$, any such data structure requires: $$ t \geq Ω( \min \{ \log (m/s) , n / \log s \} ).$$ This result overcomes the well-known logarithmic barrier i…