Tootfinder

Madre fire in rural San Luis Obispo County grows to nearly 80,000 acres
The bulk of the fire is threatening the
Carrizo Plain National Monument,
which is home to several endangered and threatened wildlife and plant species
https://www.

Madre fire in rural San Luis Obispo County grows to nearly 80,000 acres
The bulk of the fire is threatening the Carrizo Plain National Monument, which is home to several endangered and threatened wildlife and plant species.

A monument to COVID19. Why not.

It has been suggested that during FFOTUS dictatorial parade that on the south side of the National Mall, perhaps near the Lincoln Monument, that a number of well known rock stars (such as Taylor Swift, Beyonce, etc) put on an impromptu free show to pull the people away from watching the tanks roll by.

Good article how reinforcement learning improved current AI models. Also illustrates that LLMs today are not just imitating.
https://arstechnica.com/ai/2025/07/how

How a big shift in training LLMs led to a capability explosion
Reinforcement learning, explained with a minimum of math and jargon.

Voting Republican means voting for lower wages. I mean, why pay America's workers when you can enrich billionaires, amirite? 🙄
From: @…
https://www.

The Intellectualist (@the_intellectualist_official) on Threads
In 2025, 21 states—mostly Democrat-led—raised their minimum wage, while 20 Republican-led states kept the $7.25 federal rate. Washington leads at $16.66, followed by California ($16.50) and Connecticut ($15.69), highlighting sharp political and regional divides.

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

Connectivity-Preserving Minimum Separator in AT-free Graphs
Let $A$ and $B$ be disjoint, non-adjacent vertex-sets in an undirected, connected graph $G$, whose vertices are associated with positive weights. We address the problem of identifying a minimum-weight subset of vertices $S\subseteq V(G)$ that, when removed, disconnects $A$ from $B$ while preserving the internal connectivity of both $A$ and $B$. We call such a subset of vertices a connectivity-preserving, or safe minimum $A,B$-separator. Deciding whether a safe $A,B$-separator exists is NP-hard …

This German Town Carefully Reconstructed a 5,500-Year-Old Monument Lifting 13 Tons of Stone https://www.goodnewsnetwork.org/this-german-town-carefully-reconstructed-a-5500-year-old-monument-lifting-13-tons-of-st…

This German Town Carefully Reconstructed a 5,500-Year-Old Monument Lifting 13 Tons of Stone
Archaeological work in the forests has identified ten settlements from the time, which may explain the monumentality of Küsterberg.

Recommended Usage: Countertops, monuments, mosaic

Generalizing blocking semiovals in finite projective planes
Marilena Crupi, Antonino Ficarra
https://arxiv.org/abs/2507.05037 https://

Generalizing blocking semiovals in finite projective planes
Blocking semiovals and the determination of their (minimum) sizes constitute one of the central research topics in finite projective geometry. In this article we introduce the concept of blocking set with the $r_\infty$-property in a finite projective plane $\text{PG}(2,q)$, with $r_\infty$ a line of $\text{PG}(2,q)$ and $q$ a prime power. This notion greatly generalizes that of blocking semioval. We address the question of determining those integers $k$ for which there exists a blocking set of…

On Modular Edge Colourings of Graphs
Ga\'etan Berthe, Marthe Bonamy, F\'abio Botler, Gaia Carenini, Lucas Colucci, Arthur Dumas, Fatemeh Ghasemi, Pedro Mariano Viana Neto
https://arxiv.org/abs/2507.04254

On Modular Edge Colourings of Graphs
Given a graph $G$ and an integer $k\geq 2$, let $χ'_k(G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in each colour class, the subgraph induced by the edges of that colour has all non-zero degrees congruent to $1$ modulo $k$. In 1992, Pyber proved that $χ'_2(G) \leq 4$ for every graph $G$, and posed the question of whether $χ'_k(G)$ can be bounded solely in terms of $k$ for every $k\geq 3$. This question was answered in 1997 by Scott, who showed that …