Tootfinder

Sources: Palmer Luckey's stablecoin startup Atticus raised ~$250M at a $2.25B valuation, and will merge into Erebor, formed by Luckey to get a banking license (Axios)
https://www.axios.com/pro/fintech-deals/2025/06/13/palmer-luckey-er…

Scoop: New details on Palmer Luckey's crypto unicorn
Atticus will merge into Erebor, recently formed by Luckey with plans to get a banking license.

Wow: Boris Palmer kommentiert in der #bild: AfD-Verbot „wäre ein Entmündigungs-Experiment“
https://m.bild.de/…

Choreographic Quick Changes: First-Class Location (Set) Polymorphism
Ashley Samuelson, Andrew K. Hirsch, Ethan Cecchetti
https://arxiv.org/abs/2506.10913 h…

Choreographic Quick Changes: First-Class Location (Set) Polymorphism
Choreographic programming is a promising new paradigm for programming concurrent systems where a developer writes a single centralized program that compiles to individual programs for each node. Existing choreographic languages, however, lack critical features integral to modern systems, like the ability of one node to dynamically compute who should perform a computation and send that decision to others. This work addresses this gap with $λ_{QC}$, the first typed choreographic language with \e…

Counting Small Cycle Double Covers
Jorik Jooken, Ben Seamone, Carol T. Zamfirescu
https://arxiv.org/abs/2506.10604 https://arxiv.org/…

Counting Small Cycle Double Covers
A theorem due to Seyffarth states that every planar $4$-connected $n$-vertex graph has a cycle double cover (CDC) containing at most $n-1$ cycles (a "small" CDC). We extend this theorem by proving that, in fact, such a graph must contain linearly many small CDCs (in terms of $n$), and provide stronger results in the case of planar $4$-connected triangulations. We complement this result with constructions of planar $4$-connected graphs which contain at most polynomially many small CDCs. Thereaft…

Fluoroscopic Shape and Pose Tracking of Catheters with Custom Radiopaque Markers
Jared Lawson, Rohan Chitale, Nabil Simaan
https://arxiv.org/abs/2506.09934

Fluoroscopic Shape and Pose Tracking of Catheters with Custom Radiopaque Markers
Safe navigation of steerable and robotic catheters in the cerebral vasculature requires awareness of the catheters shape and pose. Currently, a significant perception burden is placed on interventionalists to mentally reconstruct and predict catheter motions from biplane fluoroscopy images. Efforts to track these catheters are limited to planar segmentation or bulky sensing instrumentation, which are incompatible with microcatheters used in neurointervention. In this work, a catheter is equippe…

Structural Parameterizations of $k$-Planarity
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada
https://arxiv.org/abs/2506.10717 https://ar…

Structural Parameterizations of $k$-Planarity
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the minimum integer $k$ such that it is $k$-planar. The problem of determining whether an input graph is $1$-planar is known to be NP-complete even for near-planar graphs [Cabello and Mohar, SIAM J. Comput. 2013], that is, the graphs obtained from planar graphs by…

A heads-up for #Interrail in Denmark: The Rail Planner app seems to have some incorrect data at the moment. The ICL train I just took between Kolding and Copenhagen is missing from the app. As always, trust bahn.de or the DB Navigator app more.

Irreducible modules over the universal central extension of the planar Galilean conformal algebra
Dongfang Gao
https://arxiv.org/abs/2506.10196 https://

Irreducible modules over the universal central extension of the planar Galilean conformal algebra
In this paper, we study the representation theory of the universal central extension $\mathcal{G}$ of the infinite-dimensional Galilean conformal algebra, introduced by Bagchi-Gopakumar, in $(2+1)$ dimensional space-time, which was named the planar Galilean conformal algebra by Aizawa. More precisely, we construct a family of Whittaker modules $W_{ψ_{m,n}}$ over $\mathcal{G}$ while the necessary and sufficient conditions for these modules to be irreducible are given when $m\in\mathbb{Z}_+, n\i…

Quantifying Data Requirements for EEG Independent Component Analysis Using AMICA
Gwenevere Frank, Seyed Yahya Shirazi, Jason Palmer, Gert Cauwenberghs, Scott Makeig, Arnaud Delorme
https://arxiv.org/abs/2506.10156

Quantifying Data Requirements for EEG Independent Component Analysis Using AMICA
Independent Component Analysis (ICA) is an important step in EEG processing for a wide-ranging set of applications. However, ICA requires well-designed studies and data collection practices to yield optimal results. Past studies have focused on quantitative evaluation of the differences in quality produced by different ICA algorithms as well as different configurations of parameters for AMICA, a multimodal ICA algorithm that is considered the benchmark against which other algorithms are measure…

On a conjecture of Faudree and Schelp
Jan Goedgebeur, Jorik Jooken, Michiel Provoost, Carol T. Zamfirescu
https://arxiv.org/abs/2506.09667 https://

On a conjecture of Faudree and Schelp
In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on $n$ vertices, any two distinct vertices are connected by a path of length $k$ for every $k \ge n/2$. In 1978 Thomassen constructed a (non-cubic and non-planar) family of counterexamples, showing that there exist hamiltonian-connected $n$-vertex graphs containing two vertices with no path of length $n-2$ between them. We complement this result by describing cubic planar counterexamples on $6p+16$ vertices, each conta…