Tootfinder

Source: Lambda, which rents access to AI chips and is backed by Nvidia, is in talks to raise $350M led by Mubadala Capital, ahead of an IPO planned for H2 2026 (The Information)
https://www.theinformation.com/articles/nvidia-back…

Nvidia-Backed Cloud Provider Lambda in Talks to Raise $350 Million Ahead of IPO
Lambda, an upstart cloud provider that rents out Nvidia AI chips—and whose biggest customer was recently Nvidia itself—is trying to raise at least $350 million before a potential initial public offering this year, according to a person familiar with the discussions. Mubadala Capital, which ...

AWS Lambda Managed Instances: Serverless, only with servers!
Would like to see some app scenarios with detailed cost breakdown.
https://aws.amazon.com/blogs/aws/introducing-aws-lambda-managed-instances-serverless-si…

Introducing AWS Lambda Managed Instances: Serverless simplicity with EC2 flexibility | Amazon Web Services
Run Lambda functions on EC2 compute while maintaining serverless simplicity—enabling access to specialized hardware and cost optimizations through EC2 pricing models, with AWS handling all infrastructure management.

Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
David Pennock, Daniel Schoepflin, Kangning Wang
https://arxiv.org/abs/2512.05235 https://arxiv.org/pdf/2512.05235 https://arxiv.org/html/2512.05235
arXiv:2512.05235v1 Announce Type: new
Abstract: We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among $n$ teams in a league. Such a mechanism should satisfy the natural properties of monotonicity and Condorcet consistency. Moreover, from the league's perspective, the winner-determination tournament rule should be strategyproof, meaning that no team can do better by losing a game on purpose.
Past work considered settings in which each team is fully selfish, caring only about its own probability of winning, and settings in which each team is fully selfless, caring only about the total winning probability of itself and the team to which it deliberately loses. More recently, researchers considered a mixture of these two settings with a parameter $\lambda$. Intermediate selfishness $\lambda$ means that a team will not lose on purpose unless its pair gains at least $\lambda s$ winning probability, where $s$ is the individual team's sacrifice from its own winning probability. All of the dozens of previously known tournament rules require $\lambda = \Omega(n)$ to be strategyproof, and it has been an open problem to find such a rule with the smallest $\lambda$.
In this work, we make significant progress by designing a tournament rule that is strategyproof with $\lambda = 11$. Along the way, we propose a new notion of multiplicative pairwise non-manipulability that ensures that two teams cannot manipulate the outcome of a game to increase the sum of their winning probabilities by more than a multiplicative factor $\delta$ and provide a rule which is multiplicatively pairwise non-manipulable for $\delta = 3.5$.
toXiv_bot_toot

from my link log —
An adequate left-associated binary numeral system in the lambda calculus.
https://www.brics.dk/RS/95/42/index.html
saved 2026-01-09 https://

Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
https://arxiv.org/abs/2602.08542 https://arxiv.org/pdf/2602.08542 https://arxiv.org/html/2602.08542
arXiv:2602.08542v1 Announce Type: new
Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center. In the dynamic setting, the graph is subject to adversarial edge updates, and the goal is to maintain explicitly an exact $(k, z)$-clustering solution in the induced shortest-path metric.
While efficient dynamic $k$-center approximation algorithms on graphs exist [Cruciani et al. SODA 2024], to the best of our knowledge, no prior work provides similar results for the dynamic $(k,z)$-clustering problem. As the main result of this paper, we develop a randomized incremental $(k, z)$-clustering algorithm that maintains with high probability a constant-factor approximation in a graph undergoing edge insertions with a total update time of $\tilde O(k m^{1 o(1)} k^{1 \frac{1}{\lambda}} m)$, where $\lambda \geq 1$ is an arbitrary fixed constant. Our incremental algorithm consists of two stages. In the first stage, we maintain a constant-factor bicriteria approximate solution of size $\tilde{O}(k)$ with a total update time of $m^{1 o(1)}$ over all adversarial edge insertions. This first stage is an intricate adaptation of the bicriteria approximation algorithm by Mettu and Plaxton [Machine Learning 2004] to incremental graphs. One of our key technical results is that the radii in their algorithm can be assumed to be non-decreasing while the approximation ratio remains constant, a property that may be of independent interest.
In the second stage, we maintain a constant-factor approximate $(k,z)$-clustering solution on a dynamic weighted instance induced by the bicriteria approximate solution. For this subproblem, we employ a dynamic spanner algorithm together with a static $(k,z)$-clustering algorithm.
toXiv_bot_toot

SCExAO/CHARIS and Gaia Direct Imaging and Astrometric Discovery of a Superjovian Planet 3-4 lambda/D from the Accelerating Star HIP 54515 / OASIS Survey Direct Imaging and Astrometric Discovery of HIP 71618 B - A Substellar Companion Suitable for the Roman Coronagraph Technology Demonstration: #Subaru Telescope Program: https://www.nao.ac.jp/en/news/science/2025/20251204-subaru.html

Representative of the Lambda Theta Phi social fraternity
#photo

Microwave electrometry with quantum-limited resolutions in a Rydberg atom array
Yao-Wen Zhang, De-Sheng Xiang, Ren Liao, Hao-Xiang Liu, Biao Xu, Peng Zhou, Yijia Zhou, Kuan Zhang, Lin Li
https://arxiv.org/abs/2512.05413 https://arxiv.org/pdf/2512.05413 https://arxiv.org/html/2512.05413
arXiv:2512.05413v1 Announce Type: new
Abstract: Microwave (MW) field sensing is foundational to modern technology, yet its evolution, reliant on classical antennas, is constrained by fundamental physical limits on field, temporal, and spatial resolutions. Here, we demonstrate an MW electrometry that simultaneously surpasses these constraints by using individual Rydberg atoms in an optical tweezer array as coherent sensors. This approach achieves a field sensitivity within 13% of the standard quantum limit, a response time that exceeds the Chu limit by more than 11 orders of magnitude, and in-situ near-field mapping with {\lambda}/3000 spatial resolution. This work establishes Rydberg-atom arrays as a powerful platform that unites quantum-limited sensitivity, nanosecond-scale response time, and sub-micrometer resolution, opening new avenues in quantum metrology and precision electromagnetic field imaging.
toXiv_bot_toot

00
=
@@
\(\Sigma\lambda\)
#meme

A $5$-Approximation Analysis for the Cover Small Cuts Problem
Miles Simmons, Ishan Bansal, Joe Cheriyan
https://arxiv.org/abs/2602.01462 https://arxiv.org/pdf/2602.01462 https://arxiv.org/html/2602.01462
arXiv:2602.01462v1 Announce Type: new
Abstract: In the Cover Small Cuts problem, we are given a capacitated (undirected) graph $G=(V,E,u)$ and a threshold value $\lambda$, as well as a set of links $L$ with end-nodes in $V$ and a non-negative cost for each link $\ell\in L$; the goal is to find a minimum-cost set of links such that each non-trivial cut of capacity less than $\lambda$ is covered by a link. Bansal, Cheriyan, Grout, and Ibrahimpur (arXiv:2209.11209, Algorithmica 2024) showed that the WGMV primal-dual algorithm, due to Williamson, Goemans, Mihail, and Vazirani (Combinatorica, 1995), achieves approximation ratio $16$ for the Cover Small Cuts problem; their analysis uses the notion of a pliable family of sets that satisfies a combinatorial property. Later, Bansal (arXiv:2308.15714v2, IPCO 2025) and then Nutov (arXiv:2504.03910, MFCS 2025) proved that the same algorithm achieves approximation ratio $6$. We show that the same algorithm achieves approximation ratio $5$, by using a stronger notion, namely, a pliable family of sets that satisfies symmetry and structural submodularity.
toXiv_bot_toot

$\Lambda$-Enhanced Gray Molasses Cooling of $^{85}$Rb Atoms in Tweezers Using the D$_2$ Line
Deon Janse van Rensburg, Rogier Venderbosch, Yuri van der Werf, Jesus del Pozo Mellado, Marijn Venderbosch, Rianne Lous, Edgar Vredenbregt, Servaas Kokkelmans
https://arxiv.org/abs/2512.17653

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Constraints on the Variation of the QCD Interaction Scale $\Lambda_{\text{QCD}}$
V. V. Flambaum, A. J. Mansour