Tootfinder

The stability of independence polynomials of complete bipartite graphs
Guo Chen, Bo Ning, Jianhua Tu
https://arxiv.org/abs/2505.24381 https://

The stability of independence polynomials of complete bipartite graphs
The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane $\{z \in \mathbb{C} : \mathrm{Re}(z) \leq 0\}$, and the graph itself is also referred to as stable. Brown and Cameron (Electron. J. Combin. 25(1) (2018) \#P1.46) proved that the complete bipartite graph $K_{1,n}$ is stable and posed the question: \textbf{Are all complete bipartite graphs stable?} We answer this question by establishing the following results: \begin{itemize} \i…

To the genocide-loving German from mastodon.social who reported @… for being antisemitic:
Fuck you, you genocide-loving piece of shit, opposing genocide isn’t antisemitism. What you’re doing – conflating being anti-genocide with being antisemitic – is the greatest antisemitism as you’re de facto stating that all Jews are pro-genocide.

Molecular Tools for Non-Planar Surface Chemistry
Taleana Huff, Brandon Blue, Terry McCallum, Mathieu Morin, Damian G. Allis, Rafik Addou, Jeremy Barton, Adam Bottomley, Doreen Cheng, Nina M. \'Culum, Michael Drew, Tyler Enright, Alan T. K. Godfrey, Ryan Groome, Aru J. Hill, Alex Inayeh, Matthew R. Kennedy, Robert J. Kirby, Mykhaylo Krykunov, Sam Lilak, Hadiya Ma, Cameron J. Mackie, Oliver MacLean, Jonathan Myall, Ryan Plumadore, Adam Powell, Henry Rodriguez, Luis Sandoval, Marc Sav…

Molecular Tools for Non-Planar Surface Chemistry
Scanning probe microscopy (SPM) investigations of on-surface chemistry on passivated silicon have only shown in-plane chemical reactions, and studies on bare silicon are limited in facilitating additional reactions post-molecular-attachment. Here, we enable subsequent reactions on Si(100) through selectively adsorbing 3D, silicon-specific "molecular tools". Following an activation step, the molecules present an out-of-plane radical that can function both to donate or accept molecular fragments,…

On Gy\'arf\'as' Path-Colour Problem
Ben Cameron, Alexander Clow
https://arxiv.org/abs/2506.19100 https://arxiv.org/pdf/25…

On Gyárfás' Path-Colour Problem
In their 1997 paper titled ``Fruit Salad", Gyárfás posed the following conjecture: there exists a constant $k$ such that if each path of a graph spans a $3$-colourable subgraph, then the graph is $k$-colourable. It is noted that $k=4$ might suffice. Let $r(G)$ be the maximum chromatic number of any subgraph $H$ of $G$ where $H$ is spanned by a path. The only progress on this conjecture comes from Randerath and Schiermeyer in 2002, who proved that if $G$ is an $n$ vertex graph, then $χ(G) \le…

Interesting idea. I would just like to be able to mine my BlueSky followings to see if they are bridgyfed so I can follow them on Mastodon which is my preferred experience rather than moving though.
https://werd.io/2025/bounce-lets-you-move-your-f…

Multi-messenger dynamic imaging of laser-driven shocks in water using a plasma wakefield accelerator
Mario D. Balcazar, Hai-En Tsai, Tobias Ostermayr, Paul T. Campbell, Qiang Chen, Cary Colgan, Gillis M. Dyer, Zachary Eisentraut, Eric Esarey, Cameron G. R. Geddes, Benjamin Greenwood, Anthony Gonsalves, Sahel Hakimi, Robert Jacob, Brendan Kettle, Paul King, Karl Krushelnick, Nuno Lemos, Eva Los, Yong Ma, Stuart P. D. Mangles, John Nees, Isabella M. Pagano, Carl Schroeder, Raspberry Simp…

Multi-messenger dynamic imaging of laser-driven shocks in water using a plasma wakefield accelerator
Understanding dense matter hydrodynamics is critical for predicting plasma behavior in environments relevant to laser-driven inertial confinement fusion. Traditional diagnostic sources face limitations in brightness, spatiotemporal resolution, and inability to detect relevant electromagnetic fields. In this work, we present a dual-probe, multi-messenger laser wakefield accelerator platform combining ultrafast X-rays and relativistic electron beams at 1 Hz, to interrogate a free-flowing water ta…

Reduced Efficiency in the Right Fronto-Parietal Attentional Network During Distractor Suppression in Mild Cognitive Impairment
Jatupong Oboun, Piyanon Charoenpoonpanich, Anna Raksapatcharawong, Chaipat Chunharas, Itthi Chatnuntawech, Chainarong Amornbunchornvej, Sirawaj Itthipuripat
https://arxiv.org/abs/2507.01433

Reduced Efficiency in the Right Fronto-Parietal Attentional Network During Distractor Suppression in Mild Cognitive Impairment
Mild Cognitive Impairment (MCI) is a critical transitional stage between normal cognitive aging and dementia, making its early detection essential. This study investigates the neural mechanisms of distractor suppression in MCI patients using EEG and behavioral data during an attention-cueing Eriksen flanker task. A cohort of 56 MCIs and 26 healthy controls (HCs) performed tasks with congruent and incongruent stimuli of varying saliency levels. During these tasks, EEG data were analyzed for alph…

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Thomas R. Cameron, Jonad Pulaj
https://arxiv.org/abs/2508.07293 https://arxiv.…

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero forcing number of a graph was shown to be an upper bound on its maximum nullity. In addition, the combinatorial optimization problem for the zero forcing number was shown to be NP-hard. Since then, the study of zero forcing and its related parameters has received considerable attention. In 2018, the forts of a graph were…