Tootfinder

STM32MP2 update: slowly working on getting stm32-cpp ported over. It's now failing to build because I haven't implemented any of the RCC code paths to turn on I2C, timer, or GPIO blocks, so that at least should be straightforward.
All of the peripherals are close to STM32H7, but with some extensions and new features in most cases (all of them have an IP identifier and version ID which is handy and I wish they had put this on their older parts too).

A Meat-Summer Night's Dream: A Tangible Design Fiction Exploration of Eating Biohybrid Flying Robots
Ziming Wang, Yiqian Wu, Qingxiao Zheng, Shihan Zhang, Ned Barker, Morten Fjeld
https://arxiv.org/abs/2510.06507

A Meat-Summer Night's Dream: A Tangible Design Fiction Exploration of Eating Biohybrid Flying Robots
What if future dining involved eating robots? We explore this question through a playful and poetic experiential dinner theater: a tangible design fiction staged as a 2052 Paris restaurant where diners consume a biohybrid flying robot in place of the banned delicacy of ortolan bunting. Moving beyond textual or visual speculation, our ``dinner-in-the-drama'' combined performance, ritual, and multisensory immersion to provoke reflection on sustainability, ethics, and cultural identity. Six partic…

Hi, it’s the team at EDF Action Votes.
Trump’s administration just ordered NASA to shut down two crucial satellites
that track carbon emissions and monitor vegetation health worldwide.
One would even be destroyed, burning up in Earth’s atmosphere — erasing decades of critical climate data.
This is deliberate sabotage of science,
and it puts every American at risk.
Without these satellites, we’ll be flying blind in the fight against climate change.

I just gave to EDF Action Votes!
EDF Action votes is doing everything they can to elect environmental champions who will take climate action.

"""
In melancholy, the spirits are carried away by an agitation, but a weak agitation that lacks power or violence, a sort of impotent upset that follows neither a particular path nor the aperta opercula [open ways], but traverses the cerebral matter constantly creating new pores. Yet the spirits do not wander far on the new paths they create, and their agitation dies down rapidly, as their strength is quickly spent and motion comes to a halt: ‘non longe perveniunt’ [they do not reach far]. A trouble of this nature, common to all delirium, does not have the power to produce on the surface of the body the violent movements or the cries to be observed in mania and frenzy. Melancholy never attains frenzy; it is a madness always at the limits of its own impotence. That paradox is explained by the secret alterations in the spirits. Ordinarily, they travel with the speed and instantaneous transparency of rays of light, but in melancholy they become weighed down with night, becoming ‘obscure, thick and dark’, and the images of things that they bring before consciousness are ‘in a shadow, or covered with darkness’. As a result they move more slowly, and are more like a dark, chemical vapour than pure light. This chemical vapour is acid in nature, rather than sulphurous or alcoholic, for in acid vapours the particles are mobile and incapable of repose, but their activity is weak and without consequence. When they are distilled, all that remains in the still is a kind of insipid phlegm. Acid vapours, therefore, are taken to have the same properties as melancholy, whereas alcoholic vapours, which are always ready to burst into flames, are more related to frenzy, and sulphurous vapours bring on mania, as they are agitated by continuous, violent movement. If the ‘formal reason and causes’ of melancholy were to be sought, it made sense to look for them in the vapours that rose up from the blood to the head, and which had degenerated into ‘an acetous or sharp distillation’. A cursory glance seems to indicate that a melancholy of spirits and a whole chemistry of humours lies behind Willis’ analyses, but in fact his guiding principle mostly reflects the immediate qualities of the melancholic illness: an impotent disorder, and the shadow that comes over the spirit with an acrid acidity that slowly corrodes the heart and the mind. The chemistry of acids is not an explanation of the symptoms, but a qualitative option: a whole phenomenology of melancholic experience.
"""
(Michel Foucault, History of Madness)

One of #California's coastal jewel cities, home to a seaside amusement park, outdoor shopping promenades, private airports and expensive hotels and dining spots favored by celebrities has gone belly up...
Officials are filing a declaration of a #FiscalEmergency ...

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…

A combinatorial approach to Ramana's exact dual for semidefinite programming
Gabor Pataki
https://arxiv.org/abs/2510.07271 https://arxiv.org/pdf/2510.0…

A combinatorial approach to Ramana's exact dual for semidefinite programming
Thirty years ago, in a seminal paper Ramana derived an exact dual for Semidefinite Programming (SDP). Ramana's dual has the following remarkable features: i) it is an explicit, polynomial size semidefinite program ii) it does not assume that the primal is strictly feasible, nor does it make any other regularity assumptions iii) yet, it has strong duality with the primal. The complexity implications of Ramana's dual are fundamental, and to date still the best known. The most important of these i…

Just found this image on Wikipedia[1] and added some arrows to point to the locations where I took the following photos, on two sides/valleys/countries of the same ice field...
#1 Gepatschferner (Austria)
https://mastodon.thi.ng/@toxi/115508735940502202
#2 Langtauferer…

Obstructions for normally spanned sets of vertices
Nicola Lorenz, Max Pitz
https://arxiv.org/abs/2510.04367 https://arxiv.org/pdf/2510.04367

Obstructions for normally spanned sets of vertices
Halin conjectured that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. This has recently been proven by the second author. In this paper, we strengthen this result by establishing the following local version of it: Given a prescribed set of vertices $U$ in a connected graph $G$, there is a normal tree in $G$ that includes $U$ if and only if every $U$-rooted minor of $G$ (i.e. a minor every branch set of which meets $U$) has countable colouri…

Immersions and Albertson's conjecture
Jacob Fox, Janos Pach, Andrew Suk
https://arxiv.org/abs/2510.05893 https://arxiv.org/pdf/2510.05893

Immersions and Albertson's conjecture
A graph is said to contain $K_k$ (a clique of size $k$) as a weak immersion if it has $k$ vertices, pairwise connected by edge-disjoint paths. In 1989, Lescure and Meyniel made the following conjecture related to Hadwiger's conjecture: Every graph of chromatic number $k$ contains $K_k$ as a weak immersion. We prove this conjecture for graphs with at most $(1.64-o(1))k$ vertices. As an application, we make some progress on Albertson's conjecture, according to which every graph $G$ with chromatic…