Tootfinder

Generation and Evaluation in the Human Invention Process through the Lens of Game Design
Katherine M. Collins, Graham Todd, Cedegao E. Zhang, Adrian Weller, Julian Togelius, Junyi Chu, Lionel Wong, Thomas L. Griffiths, Joshua B. Tenenbaum
https://arxiv.org/abs/2508.10914

Generation and Evaluation in the Human Invention Process through the Lens of Game Design
The human ability to learn rules and solve problems has been a central concern of cognitive science research since the field's earliest days. But we do not just follow rules and solve problems given to us by others: we modify those rules, create new problems, and set new goals and tasks for ourselves and others. Arguably, even more than rule following and problem solving, human intelligence is about creatively breaking and stretching the rules, changing the game, and inventing new problems wort…

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
https://arxiv.org/abs/2509.15080

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
The minimum sum coloring problem with bundles was introduced by Darbouy and Friggstad (SWAT 2024) as a common generalization of the minimum coloring problem and the minimum sum coloring problem. During their presentation, the following open problem was raised: whether the minimum sum coloring problem with bundles could be solved in polynomial time for trees. We answer their question in the negative by proving that the minimum sum coloring problem with bundles is NP-hard even for paths. We compl…

Model Predictive Path-Following Control for a Quadrotor
David Leprich, Mario Rosenfelder, Mario Hermle, Jingshan Chen, Peter Eberhard
https://arxiv.org/abs/2506.15447

Model Predictive Path-Following Control for a Quadrotor
Automating drone-assisted processes is a complex task. Many solutions rely on trajectory generation and tracking, whereas in contrast, path-following control is a particularly promising approach, offering an intuitive and natural approach to automate tasks for drones and other vehicles. While different solutions to the path-following problem have been proposed, most of them lack the capability to explicitly handle state and input constraints, are formulated in a conservative two-stage approach,…

The spectral Tur\'{a}n problem: Characterizing spectral-consistent graphs
Longfei Fang, Huiqiu Lin, Mingqing Zhai
https://arxiv.org/abs/2508.12070 https://

The spectral Turán problem: Characterizing spectral-consistent graphs
Let ${\rm EX}(n,H)$ and ${\rm SPEX}(n,H)$ denote the families of $n$-vertex $H$-free graphs with the maximum size and the maximum spectral radius, respectively. A graph $H$ is said to be spectral-consistent if ${\rm SPEX}(n,H)\subseteq {\rm EX}(n,H)$ for sufficiently large $n$. A fundamental problem in spectral extremal graph theory is to determine which graphs are spectral-consistent. Cioabă, Desai and Tait [European J. Combin. 99 (2022) 103420] proposed the following conjecture: Let $H$ be…

Federation problems is just something we have to live with in the Fediverse.
Federating has its pros and cons.
I'm Swiss. We know these things.
#switzerland #fediverse #justswissthings

An early morning alone on the banks of the (still young) Isar river some weeks ago... Really more "flow" rather than #WaterfallWednesday, but I just absolutely cherish places and moments like this & feeling so privileged being able to experience these after decades of living in large cities... (each time also a reminder how much we stand to lose...)

⏱️ Researchers discover how the human brain organizes its visual memories through precise neural timing
https://medicalxpress.com/news/2025-07-human-brain-visual-memories-precise.html

Researchers discover how the human brain organizes its visual memories through precise neural timing
Researchers at the University of Southern California have made a significant breakthrough in understanding how the human brain forms, stores and recalls visual memories. A new study, published in Advanced Science, harnesses human patient brain recordings and a powerful machine learning model to shed new light on the brain's internal code that sorts memories of objects into categories—think of it as the brain's filing cabinet of imagery.

#Blakes7 Series C, Episode 06 - City at the Edge of the World
AVON: What the hell is that? [to Dayna, who enters] What happened?
DAYNA: Bayban got away from me.
TARRANT: He'll be making for his ship.
NORL: No! Let him go. He has no men left.

I just received a beautiful piece of cat art by @… through @… from #why2025 .
Thank you very much! 😍

Beyond the MaxCut problem in $H$-free graphs
Zhihan Jin, Aleksa Milojevi\'c, Istv\'an Tomon
https://arxiv.org/abs/2507.13298 https://

Beyond the MaxCut problem in $H$-free graphs
In a recent breakthrough, Zhang proves that if $G$ is an $H$-free graph with $m$ edges, then $G$ has a cut of size at least $m/2+c_Hm^{0.5001}$, making a significant step towards a well known conjecture of Alon, Bollobás, Krivelevich and Sudakov. We show that the methods of Zhang can be further boosted, and prove the following strengthening. If $G$ is a graph with $m$ edges and no clique of size $m^{1/2-δ}$, then $G$ has a cut of size at least $m/2+m^{1/2+\varepsilon}$ for some $\varepsilon=\…