Tootfinder

Graph neural networks for learning liquid simulations in dynamic scenes containing kinematic objects
Niteesh Midlagajni, Constantin A. Rothkopf
https://arxiv.org/abs/2509.03446 …

Graph neural networks for learning liquid simulations in dynamic scenes containing kinematic objects
Simulating particle dynamics with high fidelity is crucial for solving real-world interaction and control tasks involving liquids in design, graphics, and robotics. Recently, data-driven approaches, particularly those based on graph neural networks (GNNs), have shown progress in tackling such problems. However, these approaches are often limited to learning fluid behavior in static free-fall environments or simple manipulation settings involving primitive objects, often overlooking complex inte…

Quaternionic MUBs in H^2 and their reflection symmetries
Zachary Buckley, Shayne Waldron
https://arxiv.org/abs/2509.01859 https://arxiv.org/pdf/2509.01859

Quaternionic MUBs in H^2 and their reflection symmetries
We consider the primitive quaternionic reflection groups of type P for H^2 that are obtained from Blichfeldt's collineation groups for C^4.These are seen to be intimately related to the maximal set of five quaternionic mutually unbiased bases (MUBs) in H2 , for which they are symmetries. From these groups, we construct other interesting sets of lines that they fix, including a new quaternionic spherical 3-design of 16 lines in H^2 with angles {1/5,3/5}, which meets the special bound. Some inter…

Improved Approximation for Broadcasting in k-cycle Graphs
Jeffrey Bringolf, Anne-Laure Ehresmann, Hovhannes A. Harutyunyan
https://arxiv.org/abs/2509.26426 https://

Improved Approximation for Broadcasting in k-cycle Graphs
Broadcasting is an information dissemination primitive where a message originates at a node (called the originator) and is passed to all other nodes in the network. Broadcasting research is motivated by efficient network design and determining the broadcast times of standard network topologies. Verifying the broadcast time of a node $v$ in an arbitrary network $G$ is known to be NP-hard. Additionally, recent findings show that the broadcast time problem is also NP-complete in general cactus gra…

On primitivity and reduction for half-flag-transitive block designs
Xiaoqin Zhan
https://arxiv.org/abs/2509.21781 https://arxiv.org/pdf/2509.21781

On primitivity and reduction for half-flag-transitive block designs
Let $\mathcal{D} = (\mathcal{P}, \mathcal{B})$ be a $2$-$(v, k, λ)$ design, and let $G$ be a half-flag-transitive automorphism group of ${\cal D}$. In this article, we first establish three sufficient conditions for $G$ to be point-primitive: (i) $λ\geq (r, 2λ)^2$, (ii) $r > 4λ(k-2)$, (iii) $(v-1,2k-2)\le2$. Next, we prove that for $λ\geq (r, 2λ)^2$, the group $G$ is either of affine type, almost simple type, or product type. Finally, we analyze the case where $G$ is of almost simple type…

#Blakes7 B12 - The Keeper
JENNA: I've told you, we mean him no harm.
GOLA: You come from a spaceship. My guards capture you, or else by now you would have killed us. [holding up teleport bracelets] What are these? You - fool! What are these?
http…

{\mu}Fork: Supporting POSIX fork Within a Single-Address-Space OS
John Alistair Kressel, Hugo Lefeuvre, Pierre Olivier
https://arxiv.org/abs/2509.09439 https://

μFork: Supporting POSIX fork Within a Single-Address-Space OS
Single-address-space operating systems have well-known lightweightness benefits that result from their central design idea: the kernel and applications share a unique address space. This model makes these operating systems (OSes) incompatible by design with a large class of software: multiprocess POSIX applications. Indeed, the semantics of the primitive used to create POSIX processes, fork, are inextricably tied to the existence of multiple address spaces. Prior approaches addressing this is…