Tootfinder

In case you haven't seen it yet, check out the analysis of the devastating state of [mostly] modern #OpenSSL by members of haproxy at https://www.haproxy.com/blog/state-of-ssl-stacks

A short way of counting maps to hypersurfaces in Grassmannians
Alina Marian, Shubham Sinha
https://arxiv.org/abs/2506.10593 https://a…

A short way of counting maps to hypersurfaces in Grassmannians
Using a Quot scheme compactification, we calculate the virtual count of maps of degree $d$ from a smooth projective curve of genus $g$ to a hypersurface in a Grassmannian, sending specified points of the curve to special Schubert subvarieties restricted to the hypersurface. We study the question of whether this virtual count is in fact enumerative under suitable conditions on the hypersurface, in the regime when the map degree $d$ is large.

Solving Package Management via Hypergraph Dependency Resolution
Ryan Gibb, Patrick Ferris, David Allsopp, Michael Winston Dales, Mark Elvers, Thomas Gazagnaire, Sadiq Jaffer, Thomas Leonard, Jon Ludlam, Anil Madhavapeddy
https://arxiv.org/abs/2506.10803

Solving Package Management via Hypergraph Dependency Resolution
Package managers are everywhere, with seemingly every language and operating system implementing their own solution. The lack of interoperability between these systems means that multi-lingual projects are unable to express precise dependencies across language ecosystems, and external system and hardware dependencies are typically implicit and unversioned. We define HyperRes, a formal system for describing versioned dependency resolution using a hypergraph that is expressive enough to model man…

The Greedy Hubris Of A Repulsive Creep (Brian Beutler/Off Message)
https://www.offmessage.net/p/the-greedy-hubris-of-a-repulsive
http://www.memeorandum.com/250612/p150#a250612p150

A White House memo says David Sacks and Craft Ventures are divesting holdings in AI companies and hyperscalers like xAI and Meta (Dan Primack/Axios)
https://www.axios.com/2025/06/13/david-sacks-xai-meta-ai

David Sacks selling stakes in xAI, Meta and other AI companies
Sacks entered the Trump administration with a slew of investments that could have created conflicts of interest.

Extremal Zagreb indices of bicyclic hypergraphs
Hong Zhou, Changjiang Bu
https://arxiv.org/abs/2506.08875 https://arxiv.org/pdf/2506.…

Extremal Zagreb indices of bicyclic hypergraphs
The Zagreb index of a hypergraph is defined as the sum of the squares of the degrees of its vertices. A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called bicyclic if $n=m(k-1)-1$. In this paper, we determine the hypergraphs with the maximum and minimum Zagreb indices among all linear bicyclic uniform hypergraphs.

Dynamic Less-Than-Truckload Transportation Planning in Hyperconnected Hub Networks with Multi-Carrier Operations
Tiankuo Zhang, Jingze Li, Benoit Montreuil
https://arxiv.org/abs/2506.10290

Dynamic Less-Than-Truckload Transportation Planning in Hyperconnected Hub Networks with Multi-Carrier Operations
Less-than-truckload (LTL) shipment is vital in modern freight transportation yet is in dire need of more efficient usage of resources, higher service responsiveness and velocity, lower overall shipping cost across all parties, and better quality of life for the drivers. The industry is currently highly fragmented, with numerous small to medium-sized LTL carriers typically operating within dedicated regions or corridors, mostly disconnected from each other. This paper investigates the large-scal…

Christian Klein, SAP-Chef, warnt: Mit US-Hyperscalern wie AWS, Azure und Google Cloud zu konkurrieren, indem Europa zig Rechenzentren baut, ist „völlig verrückt“. Die Lösung? Nicht Infrastruktur, sondern intelligente KI-Anwendungen machen Europa stark! Die Zukunft liegt in smarter KI, nicht in digitalen Kraftmeiereien gegen US-Riesen. #Golem

SAP-Chef: "Mit US-Hyperscalern zu konkurrieren, ist völlig verrückt" - Golem.de
In Frankreich und anderswo in Europa viele neue Rechenzentren zu bauen, sei eine völlig falsch umgesetzte Souveränität. SAP-Chef Christian Klein schlägt etwas anderes vor.

Uniform \v{S}olt\'es' hypergraphs and \v{S}olt\'es' weighted graphs
Stijn Cambie, Ajay Tiwari
https://arxiv.org/abs/2506.07511 https://

Uniform Šoltés' hypergraphs and Šoltés' weighted graphs
A Šoltés' hypergraph is a hypergraph for which the removal of any of its vertices does not change its total distance. We prove that every uniform Šoltés' hypergraph has order at least $10$, there exist uniform Šoltés' hypergraphs for almost every order or uniformity, and there exist a non-regular uniform Šoltés' hypergraph. By also providing infinitely many weighted Šoltés' graphs, we conclude that Šoltés' problem can be answered positively for the most natural generalisations of gr…

Minimal hypergraph non-jumps
Benedict Randall Shaw
https://arxiv.org/abs/2506.09620 https://arxiv.org/pdf/2506.09620

Minimal hypergraph non-jumps
An $r$-uniform hypergraph, or $r$-graph, has density $|E(G)|/|V(G)^{(r)}|$. We say $α$ is a jump for $r$-graphs if there is some constant $δ=δ(α)$ such that, for each $\varepsilon>0$ and $n\geq r$, any sufficiently large $r$-graph of density at least $\varepsilon$ has a subgraph of order $n$ and density at least $α+δ$. For $r=2$, all $α$ are jumps. For $r\geq 3$, Erdős showed all $[0,\frac{r!}{r^r})$ are jumps, and conjectured all $[0,1)$ are jumps. Since then, a var…