Tootfinder

Goodness, does this mean we can expect a strongly-worded letter next? https://mastodon.social/@EndIsraeliApartheid/114675920702558762

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…

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.

Contributions to conjectures in planar graphs: Induced Substructures, Treewidth, and Dominating Sets
Kengo Enami, Naoki Matsumoto, Takamasa Yashima
https://arxiv.org/abs/2506.10471

Contributions to conjectures in planar graphs: Induced Substructures, Treewidth, and Dominating Sets
Two of the most prominent unresolved conjectures in graph theory, the Albertson-Berman conjecture and the Matheson-Tarjan conjecture, have been extensively studied by many researchers. (AB) Every planar graph of order $n$ has an induced forest of order at least $\frac{n}{2}$. (MT) Every plane triangulation of sufficiently large order $n$ has a dominating set of cardinality at most $\frac{n}{4}$. Although partial results and weaker bounds than those originally conjectured have been obtaine…

Bias-Switchable Row-Column Array Imaging using Fast Orthogonal Row-Column Electronic Scanning (FORCES) Compared with Conventional Row-Column Array Imaging
Randy Palamar, Mohammad Rahim Sobhani, Darren Dahunsi, Negar Majidi, Afshin Kashani Ilkhechi, Joy Wang, Jeremy Brown, Roger Zemp
https://arxiv.org/abs/2506.10958

Bias-Switchable Row-Column Array Imaging using Fast Orthogonal Row-Column Electronic Scanning (FORCES) Compared with Conventional Row-Column Array Imaging
Row-Column Arrays (RCAs) offer an attractive alternative to fully wired 2D-arrays for 3D-ultrasound, due to their greatly simplified wiring. However, conventional RCAs face challenges related to their long elements. These include an inability to image beyond the shadow of the aperture and an inability to focus in both transmit and receive for desired scan planes. To address these limitations, we recently developed bias-switchable RCAs, also known as Top Orthogonal to Bottom Electrode (TOBE) arr…

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…