Tootfinder

How do you know you are using #ai too often?
In your email client, you are constantly pressing Ctrl/Shift Enter to get a newline 😂 🙈 😭

Connecting Cores and Black Hole Dynamics Across Scales: From Globular Clusters to Massive Ellipticals
Kyle Kremer, Newlin C. Weatherford, Philip F. Hopkins, Nicholas Z. Rui, Claire S. Ye
https://arxiv.org/abs/2510.11787

Connecting Cores and Black Hole Dynamics Across Scales: From Globular Clusters to Massive Ellipticals
The centers of massive elliptical galaxies exhibit a wide range in density profiles, from central cusps to resolved cores with order kiloparsec sizes. The cored ellipticals have been linked to the presence of supermassive black hole binaries that excavate their hosts' central stellar populations through three-body encounters. This connection between cores and black holes similarly operates in globular clusters, which also exhibit a bimodality in cored and core-collapsed architectures, respectiv…

Gravis Robotics, which adds cameras, sensors, and AI to heavyweight construction machines so they can operate autonomously, raised $23M led by IQ and Zacua (Beatrice Nolan/Fortune)
https://fortune.com/2025/11/28/gravis-robotic…

Exclusive: Gravis Robotics raises $23M to tackle construction’s labor shortage with AI-powered machines
The Swiss startup is aiming to automate construction equipment as the industry faces a severe shortage of skilled operators and surging demand.

En la construcción junto a nuestra casa estšn usando un taladro y por como suena me siento como en una película de Christopher Nolan

Public-Key Encryption from the MinRank Problem
Rohit Chatterjee, Changrui Mu, Prashant Nalini Vasudevan
https://arxiv.org/abs/2510.03752 https://arxiv.org/…

Public-Key Encryption from the MinRank Problem
We construct a public-key encryption scheme from the hardness of the (planted) MinRank problem over uniformly random instances. This corresponds to the hardness of decoding random linear rank-metric codes. Existing constructions of public-key encryption from such problems require hardness for structured instances arising from the masking of efficiently decodable codes. Central to our construction is the development of a new notion of duality for rank-metric codes.

Geometric Construction of Quiver Tensor Products
Daigo Ito, John S. Nolan
https://arxiv.org/abs/2510.05277 https://arxiv.org/pdf/2510.05277

Geometric Construction of Quiver Tensor Products
By a classic theorem of Beilinson, the perfect derived category $\operatorname{Perf}(\mathbb{P}^n)$ of projective space is equivalent to the category of derived representations of a certain quiver with relations. The vertex-wise tensor product of quiver representations corresponds to a symmetric monoidal structure $\otimes_{\mathsf{Q}}$ on $\operatorname{Perf}(\mathbb{P}^n)$. We prove that, for a certain choice of equivalence, the symmetric monoidal structure $\otimes_{\mathsf{Q}}$ may be descr…

Crosslisted article(s) found for math.CT. https://arxiv.org/list/math.CT/new
[1/1]:
- Geometric Construction of Quiver Tensor Products
Daigo Ito, John S. Nolan
…

Tempological Control of Network Dynamics
Yuanzhao Zhang, Sean P. Cornelius
https://arxiv.org/abs/2510.10926 https://arxiv.org/pdf/2510.10926

Tempological Control of Network Dynamics
Feedback control is an effective strategy for stabilizing a desired state and has been widely adopted in maintaining the stability of systems such as flying birds and power grids. By default, this framework requires continuous control input to offset deviations from the desired state, which can be invasive and cost a considerable amount of energy. Here, we introduce tempological (temporal + topological) control -- a novel, noninvasive strategy that harnesses the inherent flexibility of time-var…

Family Matters: Language Transfer and Merging for Adapting Small LLMs to Faroese
Jenny Kunz, Iben Nyholm Debess, Annika Simonsen
https://arxiv.org/abs/2510.00810 https://…

Family Matters: Language Transfer and Merging for Adapting Small LLMs to Faroese
We investigate how to adapt small, efficient LLMs to Faroese, a low-resource North Germanic language. Starting from English models, we continue pre-training on related Scandinavian languages, either individually or combined via merging, before fine-tuning on Faroese. We compare full fine-tuning with parameter-efficient tuning using LoRA, evaluating their impact on both linguistic accuracy and text comprehension. Due to the lack of existing Faroese evaluation data, we construct two new minimal-p…

Improved Search-to-Decision Reduction for Random Local Functions
Kel Zin Tan, Prashant Nalini Vasudevan
https://arxiv.org/abs/2510.02944 https://arxiv.org/…

Improved Search-to-Decision Reduction for Random Local Functions
A random local function defined by a $d$-ary predicate $P$ is one where each output bit is computed by applying $P$ to $d$ randomly chosen bits of its input. These represent natural distributions of instances for constraint satisfaction problems. They were put forward by Goldreich as candidates for low-complexity one-way functions, and have subsequently been widely studied also as potential pseudo-random generators. We present a new search-to-decision reduction for random local functions defi…