Tootfinder

ToPolyAgent: AI Agents for Coarse-Grained Topological Polymer Simulations
Lijie Ding, Jan-Michael Carrillo, Changwoo Do
https://arxiv.org/abs/2510.12091 https://

ToPolyAgent: AI Agents for Coarse-Grained Topological Polymer Simulations
We introduce ToPolyAgent, a multi-agent AI framework for performing coarse-grained molecular dynamics (MD) simulations of topological polymers through natural language instructions. By integrating large language models (LLMs) with domain-specific computational tools, ToPolyAgent supports both interactive and autonomous simulation workflows across diverse polymer architectures, including linear, ring, brush, and star polymers, as well as dendrimers. The system consists of four LLM-powered agents…

Following the "Geo-Erlebnis-Tag" during the weekend, preceding the Geo4Göttingen conference, the Geo4Change | Earth, Life, Climate, Resources, Materials | main program will start with plenary sessions for registered conference participants today.
https://geo4goettingen2025.de/
The full pro…

Eindrücke von jungen Frauen in der Kommunalpolitik
https://www.kn-online.de/lokales/ploen/junge-frauen-im-ploener-kreistag-der-ton-wird-immer-respektloser-XHU4LK4OIVH4RBUVPBGERUKQAY.html

Junge Kommunalpolitikerinnen: „Der Ton wird immer respektloser“
Kommunalpolitik hat ein verstaubtes Image. Zwei junge Kreistagsabgeordnete erzählen, warum die Kommunalpolitik ein toller Ort ist, um etwas zu bewegen – berichten aber auch von Hürden und sogar Morddrohungen.

US bank Erebor, founded by Palmer Luckey, Joe Lonsdale, and others, wins conditional OCC approval to offer services to emerging tech companies in crypto and AI (David Pan/Bloomberg)
https://www.bloomberg.com/news/articles/20

Die Aussage zum #Stadtbild ist ein konservativer Standard (Palmer: "welche Gesellschaft soll hier dargestellt werden?") und relativ ehrlich. Es ist eine Absolutsetzung eigener persönlicher Präferenzen, so wie man 1965 eben Männer "mit langen Haaren" oder "Frauen mit Hosen" nicht im Stadtbild sehen wollte.
Man drückt damit nicht nur seine Irrationalität expl…

Projective Planar Cartesian Products of Graphs
Nicholas Abell, Elizabeth McDermott, Christian Millichap
https://arxiv.org/abs/2509.10261 https://arxiv.org/…

Projective Planar Cartesian Products of Graphs
In this paper, we provide a complete classification of Cartesian products of graphs that embed in the projective plane. Our work requires us to determine minimal Cartesian products that are nonprojective planar, organize their essential properties to be used as constraints for projective planar embeddings, and explicitly construct projective planar embeddings for Cartesian products that satisfy these constraints. A corollary of our work shows that only six of the 35 forbidden minors for the pro…

A Task-Efficient Reinforcement Learning Task-Motion Planner for Safe Human-Robot Cooperation
Gaoyuan Liu, Joris de Winter, Kelly Merckaert, Denis Steckelmacher, Ann Nowe, Bram Vanderborght
https://arxiv.org/abs/2510.12477

A Task-Efficient Reinforcement Learning Task-Motion Planner for Safe Human-Robot Cooperation
In a Human-Robot Cooperation (HRC) environment, safety and efficiency are the two core properties to evaluate robot performance. However, safety mechanisms usually hinder task efficiency since human intervention will cause backup motions and goal failures of the robot. Frequent motion replanning will increase the computational load and the chance of failure. In this paper, we present a hybrid Reinforcement Learning (RL) planning framework which is comprised of an interactive motion planner and …

Lower bounds for planar Arithmetic Circuits
C. Ramya, Pratik Shastri
https://arxiv.org/abs/2509.11322 https://arxiv.org/pdf/2509.11322

Lower bounds for planar Arithmetic Circuits
Arithmetic circuits are a natural well-studied model for computing multivariate polynomials over a field. In this paper, we study planar arithmetic circuits. These are circuits whose underlying graph is planar. In particular, we prove an $Ω(n\log n)$ lower bound on the size of planar arithmetic circuits computing explicit bilinear forms on $2n$ variables. As a consequence, we get an $Ω(n\log n)$ lower bound on the size of arithmetic formulas and planar algebraic branching programs computing e…

2-Distance Coloring of Planar Graphs with Maximum Degree at Least 6
Sara Al Hajjar
https://arxiv.org/abs/2509.10861 https://arxiv.org/pdf/2509.10861…

2-Distance Coloring of Planar Graphs with Maximum Degree at Least 6
A k-distance r-coloring of a graph is a coloring of the vertices of the graph such that if the distance between 2 vertices x and y is less or equal to k, then x and y must have distinct colors. A planar graph is a graph that can be drawn with no edge crossing. We will study the 2-distance coloring of planar graphs with maximum degree at least 6.

Anduril plans to make 100 units of its AI-powered EagleEye helmet and eyewear for the US Army by Q2 2026, replacing Microsoft's IVAS; Meta provided some tech (Brandi Vincent/DefenseScoop)
https://defensescoop.com/2025/10/13/palmer-luckey-anduril-…

Palmer Luckey previews Anduril’s new, AI-powered EagleEye headwear ahead of AUSA reveal
Anduril is set to deliver roughly 100 units of its new AI-powered EagleEye headwear to the Army next year.