Tootfinder

And 2026 isn’t looking all that promising either.

»Write Code That Runs in the Browser, or Write Code the Browser Runs«
— by @…
🧑‍💻 https://blog.jim-nielsen.com/2025/more-control-e…

Write Code That Runs in the Browser, or Write Code the Browser Runs
Writing about the big beautiful mess that is making things for the world wide web.

hey can someone who follows me and is on TC39 please add `Array.equals` and `TypedArray.equals` thanks
the fact that you need IndexedDB to compare two arrays is a disgrace

Is there an attack going on with Card One Money, bank accounts run by Equals Money UK Ltd?
There's a banner on the Business web site saying "Card One Money Accounts are closing. The best way to get in touch to discuss this is via our Live Chat Service."
The Chat Service is saying it's out of hours.
The Business site says the phone service is down.
Now I've been told that it's Personal Accounts which are being closed, mine is a Business Accou…

Quahogs are VERY long-lived clams. This wise one was born 100 before Shakespeare. Cherish them. If you eat them, venerate their little clam bodies, first.
From "New Scientist", Tom Gauld comic.
#AncientWisdom equals #GoodEating

Improved Bounds for the Index Conjecture in Zero-Sum Theory
Andrew Pendleton
https://arxiv.org/abs/2510.11976 https://arxiv.org/pdf/2510.11976

Improved Bounds for the Index Conjecture in Zero-Sum Theory
The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the last 30 years, it is only recently that the conjecture has been proven for $n>10^{20}$. In this paper, we prove that said upper bound can be reduced to $4.6\cdot10^{13}$, and lower under certain coprimality conditions. Further, we verify the conjecture for $n<1.…

The Graded Betti Numbers of the Skeletons of Simplicial Complexes
Mohammed Rafiq Namiq
https://arxiv.org/abs/2510.09969 https://arxiv.org/pdf/2510.09969

The Graded Betti Numbers of the Skeletons of Simplicial Complexes
In this paper, we study a class $C$ of squarefree monomial ideals $I$ in a polynomial ring $R=K[x_1,\dots,x_n]$ over a filed $K$ where $\dim R/I$ equals the maximum degree of the minimal generators of $I$ minus one. We show that the Stanley-Reisner ideal of any $i$-skeleton of a simplicial complex $Δ$ in the class $C$ for $-1\le i<\dimΔ$. Then, we introduce the notion of a degree resolution and prove that every ideal in the class $C$ possesses this property. Finally, we provides a formula to …

A geometrical approach to neutrino oscillation parameters
Mohammad Ful Hossain Seikh
https://arxiv.org/abs/2510.06526 https://arxiv.org/pdf/2510.06526

A geometrical approach to neutrino oscillation parameters
We propose a geometric hypothesis for neutrino mixing: twice the sum of the three mixing angles equals $180^\circ$, forming a Euclidean triangle. This condition leads to a predictive relation among the mixing angles and, through trigonometric constraints, enables reconstruction of the mass-squared splittings. The hypothesis offers a phenomenological resolution to the $θ_{23}$ octant ambiguity, reproduces the known mass hierarchy patterns, and suggests a normalized geometric structure underlyin…

Volume growth and asymptotic cones of manifolds with nonnegative Ricci curvature
Zhu Ye
https://arxiv.org/abs/2510.06765 https://arxiv.org/pdf/2510.06765…

Volume growth and asymptotic cones of manifolds with nonnegative Ricci curvature
Let $M$ be an open (i.e. complete and noncompact) manifold with nonnegative Ricci curvature. In this paper, we study whether the volume growth order of $M$ is always greater than or equal to the dimension of some (or every) asymptotic cone of $M$. Our first main result asserts that, under the conic at infinity condition, if the infimum of the volume growth order of $M$ equals $k$, then there exists an asymptotic cone of $M$ whose upper box dimension is at most $k$. In particular, this yields …