Tootfinder

I just saw https://nebula.tv/videos/not-just-bikes-i-am-not-a-cyclist-and-most-dutch-people-aren-t-either/
When chatting with English native speakers, e.g. at

Not Just Bikes — I am not a "Cyclist" (and most Dutch people aren't either)
I am not a "cyclist", but I do ride a bicycle almost every day ... along with hundreds of other people who are also not "cyclists".

alright im going through my old files again and rediscovered a shitty unfinished sci-fi epic poem thing i was writing sometime when i was 14/15/idfk. all i remember about it is that it was gonna keep doing this countdown and changing structure accordingly for a really long time, i was thinking of depicting the character finding love in an ethereal sorta way for the ending, and it was gonna incorporate a enochian number square for some reason.

Premier Tech a réalisé que leur nom était maintenant associé avec un état genocidaire et que ce n’était pas bon pour leur marque. Eh bin. https://www.lapresse.ca/sports/cyclisme/2025-11-07/equipe-israel-premier-tech/premier-tech-se-retire.ph…

From The Conversation
Cyclists may be right to run stop signs and red lights. Here’s why

Cyclists may be right to run stop signs and red lights. Here’s why
Should cyclists be allowed to treat stop signs as yield signs? This rule from Idaho is divisive, but the scientific data is surprising.

Mixing cycles on triods
Sourav Bhattacharya
https://arxiv.org/abs/2510.04155 https://arxiv.org/pdf/2510.04155

Mixing cycles on triods
The goal of this paper is to study cycles on \emph{triods} whose dynamics emulate those of a \emph{mixing map}, referred to as \emph{mixing cycles}. We establish a necessary and sufficient condition for a cycle on a \emph{triod} $Y$ to be \emph{mixing}. We further show that the rule governing the co-existence of periods of \emph{mixing} cycles of a map on a \emph{triod} induces a linear ordering of the natural numbers, which remains stable under small perturbations of the map. Finally, we demon…

Closing paths to cycles in symmetric graphs
Martin Milani\v{c}, {\DJ}or{\dj}e Mitrovi\'c
https://arxiv.org/abs/2510.05404 https://arxiv.org/pdf/2510.05…

Closing paths to cycles in symmetric graphs
It was shown by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in edge-transitive graphs, where the cycle can be assumed to be induced if the path is induced. Motivated by these results, we consider the following problem: For a given class of graphs, determine all integers $\ell\geq 0$ such that for every graph in the class, e…

The case for letting cyclists treat stop signs as yield signs.:
https://theconversation.com/cyclists-may-be-right-to-run-stop-signs-and-red-lights-heres-why-268724

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
Fontaines D.C.:
🎵 Boys in the Better Land
#FontainesDC
https://fontainesdc.bandcamp.com/album/chequeless-reckless-boys-in-the-better-land
https://open.spotify.com/track/7cucVWdmNeaPJuo7WkxaZ8

Cyclicity of Smooth Multipliers on the Unit Ball of $\mathbb{C}^n$: A Corona-Based Approach
Pouriya Torkinejad Ziarati
https://arxiv.org/abs/2508.05189 https://

Cyclicity of Smooth Multipliers on the Unit Ball of $\mathbb{C}^n$: A Corona-Based Approach
We study the cyclicity of smooth multipliers in Dirichlet-type spaces $D_α(\mathbb{B}_n)$. Specifically, we show that a smooth multiplier $f$ on the unit ball, whose zero set on the unit sphere is a compact, smooth, complex tangential submanifold of real dimension $m \leq n - 1$, is cyclic in $D_α(\mathbb{B}_n)$ if and only if $α\leq \frac{2n - m}{2}$, where $m$ is the real dimension of the zero set of $f$ on the boundary. Our approach combines classical results on peak sets in $A^\infty(Ω)…

The high order spectral radius of graphs without long cycles or paths
Yuntian Wang, Lizhu Sun, Changjiang Bu
https://arxiv.org/abs/2510.04461 https://arxiv…

The high order spectral radius of graphs without long cycles or paths
In 1959, Erdős and Gallai established two classic theorems, which determine the maximum number of edges in an $n$-vertex graph with no cycles of length at least $k$, and in an $n$-vertex graph with no paths on $k$ vertices, respectively. Subsequently, generalized and spectral versions of the Erdős-Gallai theorems have been investigated. A concept of a high order spectral radius for graphs was introduced in 2023, defined as the spectral radius of a tensor and termed the $t$-clique spectral rad…