Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Wednesday 9 September

Number Theory

A New Sparse Algorithm for Polynomial GCD over Integers

We describe a new greatest common divisor (GCD) algorithm for polynomials with integer coefficients. The bit complexity of the new algorithm is polynomial in the input and output sizes and the individual degree bounds.Our algorithm follows the standard approach by reducing multivariate polynomial GCD to univariate polynomial GCD. Our algorithm reduces a multivariate polynomial GCD to a single univariate polynomial GCD. The main idea of our algorithm is a new variable substitution which reduces a multivariate polynomial to a separated one, that is, the coefficients in a main variable are all monomials. The explicit bit complexity is analyzed and we have implemented our algorithm in Maple. It is shown that our algorithm is efficient for polynomials with high degree, large number of variables, but small number of terms in GCD.
Read the full abstract

Combinatorics

The 2-Adic Valuation of the Order of the All-Ones Class in the Sandpile Group of a Square

Place one grain at every nonsink vertex of the wired $n\times n$ square, and let $L(n)$ be the order of this operation in the sandpile group. Thus $L(n)$ is the least positive $q$ for which $q$ uniform grain layers form an integral combination of toppling moves. We prove that, for every $n\ge1$, \[ \nu_2(L(n))= \begin{cases} 2,&n=1,\\ 1,&n\ge2\text{ even},\\ \nu_2(n+1)+2,&n\ge3\text{ odd}. \end{cases} \] For even squares, this follows from the domino–sandpile results of Florescu, Morar, Perkinson, Salter, and Xu, completed by a short parity observation. For odd squares, a unimodular cyclic basis identifies the folded cokernel with a quotient by two shifted Chebyshev polynomials and sends the all-ones class to $1$. Its order is determined by the constant part of this polynomial ideal, not just by a determinant. Two normalized Euclidean remainders reduce to consecutive Fibonacci polynomials over $\mathbb F_2$, giving the exact valuation.
Read the full abstract

All authors Turgay Akyar, Artem Beliakov, Konstantin Delchev, Nikita Kalinin, Ernesto Lupercio, Higinio Serrano, Mikhail Shkolnikov, Daniel Tabares, Nikolai Terekhov

General Relativity and Quantum Cosmology

Dilaton gravity can enhance quantum coherence and reduce entanglement

We investigate the influence of the Garfinkle-Horowitz-Strominger (GHS) dilaton black hole on different quantum resources of Dirac fields beyond the single-mode approximation. By employing the negativity to characterize quantum entanglement and the $l_1$-norm and the relative entropy of coherence to characterize quantum coherence, we demonstrate that these resources exhibit remarkably different responses to the gravitational field. Specifically, increasing the dilaton parameter continuously suppresses quantum entanglement, leaving only a finite residual amount in the strong-gravity regime, whereas quantum coherence is enhanced, indicating that the dilaton-induced spacetime affects nonlocal quantum correlations and local quantum superposition in fundamentally different ways. Furthermore, we show that an initially maximally entangled state does not always possess the largest negativity after propagating in the GHS dilaton spacetime; instead, under appropriate conditions, certain non-maximally entangled states can retain stronger entanglement than the maximally entangled one. These findings reveal the resource-dependent nature of gravitational effects in dilaton black hole backgrounds and provide new insights into the manipulation and protection of quantum resources for relativistic quantum information processing in curved spacetime.
Read the full abstract

All authors Zejun Wang, Zhihong Liu, Yu-Xuan Wang, Xiao-Li Huang

Mesoscale and Nanoscale Physics

Symplectic Hopf Insulator: Delicate Topology in Bosonic Bogoliubov-de Gennes Systems

Recent advances in topological phases have highlighted the role of symplectic (Krein-space) topology in the classification of bosonic Bogoliubov-de Gennes (BBdG) systems. In this work, we construct a BBdG realization of Hopf topology, which we dub the symplectic Hopf insulator, starting from a microscopic Bose-Hubbard generalization of the Moore-Ran-Wen model with weak on-site interactions treated within a Bogoliubov approximation. The resulting BBdG system admits a symplectic Hopf invariant, which we show to be integer-quantized for isolated bands. We establish that this topology is intrinsically delicate, requiring exactly two bosonic modes per unit cell, while remaining robust against weak interactions over a range of mass parameters. Upon terminating the three-dimensional insulator at a boundary, we find topologically protected in-gap surface states at finite excitation energy, whose protection is itself delicate. Our results establish the symplectic Hopf insulator as a robust yet delicate topological phase in weakly interacting bosonic systems lying beyond the tenfold-way classification.
Read the full abstract

Computer Vision

Programmable World Model

Recent video world models generate increasingly realistic and interactive visual experiences, yet lack reliable mechanisms for maintaining persistent world state and enforcing programmable rules over extended interactions. We introduce Programmable World Model, a framework that decouples world-state evolution from visual observation generation. An agent translates natural-language instructions into executable programs that specify entity states and state-transition rules, enabling direct control over individual entities and their interactions. A lightweight engine executes these programs to update and maintain an explicit, persistent global world state, including off-screen entities and non-visual attributes. To connect world state with visual generation, we introduce state-augmented 3D oriented bounding boxes (OBBs) as an intermediate representation. This representation, together with the target camera trajectory, is deterministically compiled into pixel-aligned spatiotemporal conditioning signals for a pretrained video model serving as the generative renderer. This design allows users to create playable games with predefined mechanics, direct control over individual entities, and persistent world state throughout gameplay. We further introduce CombatStateBench, a benchmark for evaluating programmable world models. On CombatStateBench, our method achieves 94% Count Accuracy and 98% State Accuracy, substantially outperforming existing interactive video world models while supporting coherent long-horizon generation. These results demonstrate the effectiveness of separating explicit state evolution from generative rendering for building persistent, programmable worlds.
Read the full abstract

All authors Zheng-Hui Huang, Guixu Lin, Jiacheng Lin, Yi-Chuan Huang, Ruihan Yu, Muyao Niu, Siqi Yang, Yu-Lun Liu, Yung-Yu Chuang, Kaipeng Zhang, Zhixiang Wang

Computation and Language

IdeaAMBIG: Benchmarking Implementation-Critical Gaps in Research-Idea Specifications

A research idea may be novel, coherent, and scientifically plausible, yet its proposed method may remain insufficiently specified for faithful implementation. We study the codification readiness of implementation-facing research-method specifications, defined by whether they provide sufficient methodological information for a competent implementer or coding agent to construct the intended method without unsupported assumptions. We construct evidence-grounded specifications and their supported resolutions from papers, codebases, issue threads, and reproduction artifacts. We introduce IdeaAMBIG, a benchmark of 660 evidence-grounded instances: 163 real-world gaps from reproducibility reports and GitHub issues, and 497 controlled synthetic gaps injected into codification-ready references. IdeaAMBIG evaluates three capabilities: codification-readiness assessment, defect localization, and clarification action generation. Defect localization receives only the specification, whereas clarification additionally receives the annotated defect. Across 13 LLMs, the best model achieves 9.6% Macro Defect Recovery Rate on real-world instances but 80.6% Macro Clarification Action Success Rate when given the defect. In an oracle study, supplying the gold resolution raises the downstream codification-ready rate from 14% to 98%. Across all evaluated models, defect localization is the main bottleneck, with stronger clarification given the defect.
Read the full abstract

All authors Yiling Ma, Yilun Zhao, Sihong Wu, Manasi Patwardhan, Arman Cohan

Dynamical Systems

Exact dimensionality of stationary measures for random diffeomorphisms with all Lyapunov exponents equal and negative

We prove exact dimensionality of ergodic stationary measures for random compositions of $C^1$ diffeomorphisms of a closed manifold $M$ that contract at a single Lyapunov scale. More precisely, let $\nu$ be a Borel probability measure on $\mathrm{Diff}^1(M)$ such that $\log\sup_{x}\|{D_xf}\|$ and $\log\sup_{x}\|{D_xf^{-1}}\|$ are $\nu$-integrable, and let $\mu$ be an ergodic $\nu$-stationary probability measure. If the top and bottom Lyapunov exponents of the derivative cocycle coincide and equal $\lambda<0$, then $\mu$ is exact dimensional and $\mathrm{dim}(\mu)=h_\mu^{\mathrm{F}}(\nu)/(-\lambda)$, where $h_\mu^{\mathrm{F}}(\nu)$ is the Furstenberg entropy.
Read the full abstract

Cryptography and Security

Towards Tackling Application Logic Flaws through Autonomous Formal-Logic Modeling and Automated Reasoning

Logic flaws pose significant challenges in the design and implementation of modern, semantically rich systems and applications, impacting security, privacy, and trust. These flaws are inherently tied to business-specific semantics and threat models, making their discovery and reasoning difficult and hard to scale. Real-world systems often exhibit diverse application features, complex protocol logic, and domain-specific threat models, necessitating substantial human effort and domain expertise for effective security analysis. In this paper, we introduce LL-Verifier, a novel, automated framework for identifying logic vulnerabilities built on (1) large language models for autonomous modeling, and (2) logic model checkers for rigorous reasoning. LL-Verifier processes natural language inputs, in particular protocol descriptions and security goals, to automatically generate formal logic models and properties expressed in a new logic language built on a generic logic language Maude, optimized for modeling arbitrary application-level semantics. These formal models are then converted into logical state machines, enabling exhaustive, rigorous verification through logic level model checking. This approach streamlines the analysis of diverse, application-level protocols deployed in real-world scenarios, offering automated, exhaustive, and precise reasoning within their logical constraints. We evaluated the high effectiveness, efficiency, and practicality of LL-Verifier by applying it to 27 access control protocols of widely used IoT devices, which come with vendor-specific logic flows and semantics. While LL-verifier tackles a hard problem in application security, i.e., automatic logic flaws discovery, our analysis uncovers a range of sophisticated logic vulnerabilities in IoT protocols and devices with serious security and privacy implications.
Read the full abstract

Instrumentation and Methods for Astrophysics

Performance Comparison of the Nonlinear Curvature and Shack-Hartmann Wavefront Sensors in Strong Turbulence

Strong turbulence induces spatial variations in beam intensity that hinder the reconstruction process of many commonly deployed adaptive optics (AO) systems that use gradient-based wavefront sensors (WFS), such as the Shack-Hartmann wavefront sensor (SHWFS) and pyramid wavefront sensor. The nonlinear curvature WFS (nlCWFS) uses Fresnel diffraction to extract wavefront phase and amplitude information, suggesting that it may be able to operate under challenging turbulence conditions. In this work, we investigate nlCWFS reconstruction accuracy as a function of turbulence strength and relative flux by modeling high spherical-wave Rytov number ($R_{sw}$) environments where scintillation and branch points impact sensing performance. We present open-loop as well as static and dynamic closed-loop results benchmarked against a comparable Shack-Hartmann WFS (SHWFS). In static and weak-to-moderate scintillation regimes, the nlCWFS consistently outperforms the SHWFS by leveraging amplitude-phase coupling inaccessible to gradient-based sensors. However, dynamic closed-loop simulations reveal a crossover behavior at higher scintillation strengths, where deep intensity nulls and proliferating branch points degrade the performance of Gerchberg-Saxton-based nlCWFS reconstruction, while the SHWFS degrades more gradually due to its insensitivity to such topological phase structure. These results highlight the regime-dependent advantages of the nlCWFS and emphasize the need for branch-point-tolerant reconstruction algorithms to fully realize its potential in strong-turbulence, low-flux conditions.
Read the full abstract

All authors Sam J. Potier, Arlene J. Aleman, Justin R. Crepp, Stanimir Letchev

High Energy Physics (Theory)

For Whom Does Bell Hold?

Violations of Bell's inequalities offer a definitive signal of non-classical (quantum) behavior in local deterministic systems. Yet, in many physical settings where quantum mechanics is expected to play an important role, one cannot construct a Bell-type test using the available observables. Cosmology offers one concrete example, where cosmic structure may have originated from quantum vacuum fluctuations yet all observations are effectively classical. Nevertheless, recent work suggests that quantum and classical time evolution may still be differentiated by the pattern of statistical correlations of these observables. In this paper, we explore and generalize the use of correlations as Bell-type test of the nature of time evolution. We show that quantum vacuum fluctuations of closed systems undergoing Hamiltonian evolution produce unique correlations that are not mimicked by classical Hamiltonian systems. Correlations in the quantum vacuum are generally time-independent and are controlled by the energy gap between the ground and exited states. Classical systems exhibit apparent poles at physical frequencies that do not arise in the quantum vacuum. As one approaches the poles, the evolution becomes dominated by a resonant Hamiltonian giving rise to time dependent correlations that eventually decay through dephasing. Finally, we show that this behavior is distinct from other signals of quantum evolution, including applications to quantum optics, quantum walks, and quantum search.
Read the full abstract

Statistical Methodology

Likelihood-free inference with nuisance parameters through normalizing flows

We present a simple decomposition of a neural-network-based normalizing flow that naturally uncovers a pivotal statistic (or something close) in the presence of nuisance parameters, based only on a sample generator from the distribution of interest. We show that the statistic is near-pivotal in the sense of minimum average KL-divergence of its $p$-values versus uniform and we argue that it can be expected to have good power when the dimension of the statistic equals the dimension of the parameter. It is able to incorporate prior knowledge about group invariances such as translation and scale. It can discover the one-sample $t$-test almost exactly, outperforms the Welch test in terms of worst-case size over a constrained variance-ratio range and achieves good calibration on partial biserial correlations, while showing higher power (and being much faster) on small-to-moderate samples than profile likelihood-ratio techniques.
Read the full abstract

Quantum Physics

Noether Symmetries Generate Deterministic Energy-Harvesting Protocols

We consider the general principles for when deterministic energy harvesting (DEH) is possible. DEH means absorbing energy from a fluctuating source without entropy being absorbed. We show that the symmetry structure of the source–harvester dynamics gives a general route beyond existing examples to identify DEH capable source states. Any continuous symmetry with a conserved Noether charge induces a source-side orbit of states that all implement the same deterministic harvester transition, provided the harvester boundary states are symmetry invariant. Consequently, one DEH capable source state with nonzero asymmetry between charge sectors can generate infinitely many simultaneously DEH capable source states. A Jaynes-Cummings model, a three-spin XX chain, and an SU(2) model illustrate the construction. We further extend Noether's theorem to generalised probabilistic theories and thereby generalise our main result. We further establish an asymmetry bound for harvesting, showing that source asymmetry cannot increase on average, while DEH saturates the bound exactly preserving asymmetry.
Read the full abstract

All authors Ali Akil, M. Hamed Mohammady, Zihan Wang, Oscar Dahlsten

Astrophysics of Galaxies

The kinematics of tadpole galaxies at intermediate redshift $z \sim 0.4 - 1.5$

Galaxy morphology and kinematics encode complementary information about the assembly history of galaxies, but the extent to which they evolve in tandem remains unclear. Tadpole galaxies, characterized by their distinct head-tail morphology and pronounced asymmetry, provide an ideal laboratory for investigating whether strongly asymmetric galaxies can exhibit ordered galaxy-scale kinematics. In this work, we present a detailed analysis of the ionized-gas kinematics of 20 morphologically selected tadpole galaxies at redshifts $z=0.4 - 1.5$ in the Hubble Ultra Deep Field, using deep VLT/MUSE spectroscopy together with HST and JWST imaging. In 13 out of 20 galaxies, the 2D velocity maps derived from the MUSE [O\,ii] $\lambda\lambda3726,3729$ emission show evidence for ordered motion, characterized by moderate velocity gradients along the kinematic major axis, while the remaining systems show no clear evidence for galaxy-scale ordered kinematics. In 16 galaxies, the [O\,ii] and rest-frame optical emission, probed by HST/F775W, have spatially coincident centroids, with projected offsets of $<2$~kpc. The morpho-kinematic position angles are also generally well aligned, with a median misalignment of $\Delta{\rm PA}\sim12^{\circ}$. Despite the strongly asymmetric tadpole morphologies, these results indicate that a substantial fraction of these systems retain coherent galaxy-scale gaseous kinematics, suggesting that morphological asymmetry need not imply a globally disordered dynamical state. Together, our analyses suggest that morphological and kinematic settlement does not occur simultaneously and these tadpole galaxies might represent a transient evolutionary phase towards the combined morpho-kinematic settlement process.
Read the full abstract

Computer Vision

Guiding Image-to-3D Generation with Test-Time Partial Observations

Image-to-3D models can generate visually compelling 3D assets from a single RGB image, but their geometry is often only loosely constrained by the available observations, limiting their use in applications that require geometric fidelity. In many real-world settings, however, partial geometric observations of the object may be available at test time. We introduce a training-free framework for incorporating such evidence into pretrained image-to-3D generative models without retraining or finetuning. To do this, we guide generation using a ray-consistent observation likelihood defined over the model's occupancy representation, combining surface occupancy and free-space evidence. Applied to SAM 3D and its multi-view extension, our approach substantially improves geometric fidelity across different levels of observability, as well as visual quality. Our results demonstrate that pretrained image-to-3D models can effectively integrate partial geometric observations through explicit test-time guidance, complementing their learned generative priors without modifying the underlying model.
Read the full abstract

Probability

Fluctuations of additive martingale limits of branching Brownian motion

Consider a one-dimensional branching Brownian motion. Let $W_\infty(\beta)$ denote the limit of the additive martingale in the subcritical regime $\lvert \beta\rvert < \beta_c$ and $Z_\infty$ be the limit of the derivative martingale at criticality. Madaule (Stochastic Process. Appl. 126 (2016), no. 2, 470–502) established the following convergence \[ \frac{W_\infty(\beta)}{\beta_c-\beta}\xrightarrow[\beta\nearrow \beta_c]{\mathbb{P}} 2Z_\infty. \] The goal of this paper is twofold: firstly, we strengthen this result into an almost sure convergence; secondly, we describe the fluctuations occurring in this convergence by proving \[ \frac{1}{\beta_c-\beta}\left( \frac{W_\infty(\beta)}{\beta_c-\beta} - 2 Z_\infty +2(\beta_c-\beta)\log(\beta_c-\beta) Z_\infty\right) \xrightarrow[\beta\nearrow \beta_c]{(d)} S, \] where, conditionally on $Z_\infty$, $S$ follows a spectrally negative 1-stable distribution with scale and shift parameters proportional to $Z_\infty$. Furthermore, these results are extended to the setting of complex additive martingales and the fluctuations to a multi-dimensional convergence.
Read the full abstract

Machine Learning

A positive resolution of the gap-entropy conjecture

We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and a unique optimal arm. For each suboptimal arm $i$, let $\Delta_i=\mu_*-\mu_i$ be its gap from the optimal mean, and write $H=\sum_{i\ne *}\Delta_i^{-2}$. Let $p_r$ be the fraction of $H$ contributed by arms with $2^{-(r+1)}<\Delta_i\le2^{-r}$, and let $\mathrm{Ent}(I)=\sum_{r:p_r>0} p_r\log(1/p_r)$. Among all algorithms that identify the optimal arm with probability at least $1-\delta$ on every Gaussian instance, the optimal expected number of samples on a given instance, averaged over all permutations of the arm labels, is within absolute constant factors of $H(\log(1/\delta)+\mathrm{Ent}(I))$. Moreover, there is an algorithm, independent of the instance, whose expected number of samples is bounded by a constant multiple of this quantity plus $g^{-2}\log\log(e^e/g)$, where $g=\min_{i\ne *}\Delta_i$ is the gap to the closest competitor.
Read the full abstract

Probability

The Ding–Song–Sun inequality via a maximum principle

We prove the Ding–Song–Sun inequality for continuous spin models on finite ferromagnetic graphs whose even single-site potentials have convex derivatives on the positive half of their domain. This class, introduced by Ellis, Monroe and Newman, includes the $\varphi^4$ and sinh-Gordon potentials. The proof uses a rank-one interpolation of the interactions and a maximum principle for a cooperative parabolic system on a half-plane. The boundary conditions follow by induction on the number of vertices and the number of positive coordinates of the field increment. In particular, the truncated two-point function in an arbitrary external field is bounded above by its zero-field value.
Read the full abstract

Differential Geometry

A sharp threshold for mixed $Q$-curvature rigidity

We resolve Case's question (Crelle's Journal, 2024) on the sharp lower threshold for Obata-type rigidity of $I_a=Q+a\sigma_2(A)$ in positive Einstein conformal classes of dimension $n\ge4$. Using a new reference-curvature identity, we prove that, on a closed connected manifold, every smooth metric in such a class with nonnegative scalar curvature and constant $I_a$ is Einstein whenever $a\ge-4$. The scalar-curvature sign assumption can be removed for $-4\le a\le-2(n-2)/(n-1)$. We also extend the quotient rigidity theorem of Ge–Wang–Wei to $I_a=\Lambda R^\theta$ for $R>0$, $a\ge-4$, and $\theta\le1$. Sharpness is established in every dimension by a shooting construction. For each sufficiently small $\eta>0$, we construct a smooth non-Einstein metric in the round conformal class on $\mathbb S^n$ with positive scalar curvature and the same constant $I_{-4-\eta}$ as the unit round metric. The construction smoothly matches a perturbed Schwarzschild neck near the equator with perturbed round caps at both poles.
Read the full abstract

Formal Languages and Automata

Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarchy

Language generation in the limit asks for valid unseen elements from every exhaustive positive presentation of an unknown infinite language. We characterize this task for arbitrary families over a countable universe. Generation is possible exactly when each target can be assigned a finite positive witness so that the targets activated by any finite sample have an infinite common intersection. The necessary direction follows from a universal normalization: a search through unconfirmed histories converts any successful generator into one depending only on the observed set. We then ask how large compatible witnesses must be. Positive separation width records the smallest uniform size bound, with two further levels for unbounded finite witnesses and the absence of any compatible finite-witness assignment. Every level occurs. Countable families admit singleton witnesses, explicit families realize every finite width, and a union of two families with infinite common cores requires unbounded finite witnesses. Finally, countable-support and finite-profile obstructions explain why local combinatorial data cannot determine generation in the limit. The characterization and full width hierarchy are checked in Lean, including the simplified normalization and a direct diagonal capture lemma. The accompanying Lean development is maintained at https://github.com/xiaoyulics/language-generation-characterization
Read the full abstract

All authors Xiaoyu Li, Andi Han, Jiaojiao Jiang, Junbin Gao

2609.10525 · 9 Sep · v2: fixed a typo in abstract title; added a figure in abstract page; added connections to known sufficient conditions; added a normalization example and appendices on quantifiers and computability; expanded the formalization discussion; main results unchanged

Computer Vision

Precision in Rice Variety Classification using Stacking-Based Ensemble Learning

Rice, a staple food for a significant portion of the global population, exhibits remarkable diversity in its varieties, presenting substantial challenges for accurate identification by consumers, traders, and farmers. This complexity often facilitates fraudulent practices, such as the unauthorized mixing of rice types, which undermines quality and trust in the supply chain. Despite its critical importance, existing research falls short of providing robust and efficient methods for precise rice variety classification based on external characteristics like color, size, and texture. To address this gap, our study introduces a comprehensive rice variety identification framework designed to enhance transparency and quality assurance. We developed a stacked ensemble model tailored for rice variety classification and curated a comprehensive dataset comprising 20 rice varieties, each distinguished by unique visual attributes. The proposed approach achieved an unprecedented classification accuracy of 100%. Furthermore, we integrated our model into a mobile application, enabling even novice users to effortlessly identify rice varieties using grain images from a smartphone camera. These findings underscore the transformative potential of advanced machine learning techniques in mitigating fraudulent practices and ensuring stringent rice quality control. Our work holds significant implications for agricultural stakeholders, paving the way for automated crop identification systems and advancing precision agriculture practices.
Read the full abstract

All authors Md. Masudul Islam, Galib Muhammad Shahriar Himel, Md. Golam Moazzam, Mohammad Shorif Uddin

Differential Geometry

Rigidity, sharp inequalities, and stability for $\sigma_2$-curvature by a reference curvature technique

Using a reference-curvature technique, we prove four main theorems. (i) For $n\geq4$, we remove the mean-curvature pinching from the Case-Wang rigidity theorem for $\sigma_2$-flat conformal hemispheres with $A_g\in\overline{\Gamma_2^+}$ and positive constant natural boundary curvature. (ii) On every closed positive Einstein manifold of dimension $n\geq5$, each conformal metric of constant $\sigma_2$-curvature is Einstein, and is homothetic to the background unless the background is a round sphere, thereby resolving the $\sigma_2$-Obata problem posed by Chang, Gursky, and Yang. (iii) We extend the spherical constant-$\sigma_2/\sigma_1$ classification and sharp integral comparison to closed positive Einstein manifolds. The comparison holds throughout the positive-scalar-curvature conformal class, with equality only for homotheties on nonround backgrounds. (iv) We establish global quantitative $\sigma_2$ stability on every fixed nonround positive Einstein background of dimension $n\geq5$, throughout its positive-scalar-curvature conformal class.
Read the full abstract

Robotics

Show-Harness: Just a VLM Agent Can Play Robots

Foundation vision-language models (VLMs) exhibit broad intelligence about the world, yet translating this intelligence into robot control remains challenging. We present Show-Harness, an Embodied Harness that enables VLMs to "play" robots through a compact semantic interface linking intent to action. Show-Harness exposes discrete semantic action units that VLMs can naturally reason over, while embodiment-specific interpreters deterministically ground them into local robot actions, keeping the VLM directly responsible for fine-grained physical decisions. Through the same interface, Show-Harness demonstrates the feasibility of (1) directly unlocking closed-source frontier VLMs for zero-shot robot control, and (2) adapting small-scale open-source VLMs for low-cost deployment with just a few GPU-hours of fine-tuning. We further develop GUMI (GUI Manipulation Interface), which extends the same semantic action space to GUI-based demonstration collection, allowing humans and agents to "play" robots across embodiments without specialized teleoperation hardware. Extensive experiments show that Show-Harness-equipped VLM agents generalize robustly across tasks, embodiments, and environments, outperforming representative agentic and VLA paradigms. These results suggest that the right interface can unlock substantial embodied capability from foundation VLMs, without requiring additional model capacity or costly embodiment-specific pretraining.
Read the full abstract

All authors Yanzhe Chen, Zechen Bai, Zhijun Cao, Wenzheng Zeng, Kevin Qinghong Lin, Yiqi Lin, Guoqiang Liang, Kevin Yuchen Ma, Qiming Huang, Mike Zheng Shou

General Relativity and Quantum Cosmology

Point particles in general relativity: beyond linear perturbation theory

Point particles are generically ill defined in fully nonlinear general relativity, although they are naturally well defined in linear perturbation theory. In a previous paper, two of us showed how they can be rigorously defined from matched asymptotic expansions at second order in perturbation theory on a generic background spacetime. Here we show how the resulting field equations can be recast in a more practical, more fully “skeletonized” form. We also show that this form of the field equations enables simple derivations of equations of motion. Finally, we show how calculations in second-order perturbation theory can bypass the use of singular “punctures” and make rigorous use of off-the-shelf regularization methods such as Blanchet and Damour's Hadamard regularization, opening new avenues to second-order self-force calculations in black hole binaries.
Read the full abstract

Quantum Physics

Private communication via zero-private-capacity quantum channels

Private communication over a noisy quantum channel requires reliable transmission to the receiver and secrecy from the environment. Whether two channels with zero private capacity can jointly enable private communication is a longstanding open problem in quantum information theory. Here we resolve this problem by exhibiting a four-level channel and a qubit erasure channel with half erasure probability, each with zero private capacity, whose joint use achieves more than 0.0001903 private bits per product use. The encoding gives the receiver a linear information gain with at most quadratic environmental leakage, enabling privacy through a fixed joint measurement and classical coding. This superactivation, impossible for independent classical memoryless wiretap channels, shows that a channel's private capacity alone does not determine its value for secure communication. The initial activation example was identified through interactions with large language models, and the result has been formalized in Lean 4.
Read the full abstract

Statistical Mechanics

Optimal Intermediate Hamiltonians for Non-Equilibrium Free Energy Calculations: A Numerical Study of Markov Models

The Jarzynski relation enables the estimation of equilibrium free energy differences from non-equilibrium, finite-time switching simulations. These estimates usually converge poorly because rare trajectories dominate the exponential work average. Here, we numerically determined and explored the sequence of intermediate Hamiltonians connecting initial and final states that minimize the mean squared error (MSE) of the Jarzynski estimator and thereby enhance convergence. For discrete-time Markov models, an exact tilted-master-equation representation of the MSE in the large-sample limit, combined with automatic differentiation, enables efficient gradient-based minimization over all intermediate energies. We applied our approach to three model systems of increasing complexity: a two-state model, a double-well potential, and a shifted potential well. In all three systems, the optimal intermediate Hamiltonians jump at the initial and final times. Extensive Monte Carlo simulations show that optimal intermediates can reduce the MSE by more than an order of magnitude compared with linear and logarithmic interpolation, most strongly for large changes in the energy landscape. Remarkably, they need not dissipate less work than intermediates yielding larger errors. Our results suggest heuristics for more efficient non-equilibrium free energy calculations of realistic molecular systems: optimal intermediate Hamiltonians jump at the initial and final times; for barrier-crossing problems, the barrier should be lowered rapidly and raised again later; and minimizing dissipation does not guarantee faster convergence.
Read the full abstract

Computer Vision

BrainTaskonomy: Learning How to Pretrain and What to Transfer in fMRI Foundation Models

fMRI foundation models increasingly aggregate heterogeneous data across brain states, cohorts, and acquisition settings, yet pretraining domains are commonly treated as a flat mixture and downstream tasks are adapted independently. We study whether measured learning relations can organize both stages without modifying the backbone. During pretraining, a lightweight Brain-DiT proxy estimates difficulty and directed facilitation across ten fMRI domains, yielding a priority-guided cumulative domain curriculum combined with high-to-low-noise timestep scheduling and joint consolidation. During adaptation, controlled first- and higher-order transfer across fifteen tasks constructs a directed taskonomy, from which budgeted integer programming (BIP) selects directly supervised source tasks and target-specific routes. The joint priority-domain and high-to-low-timestep curriculum reduces v-NMSE, PSD-NMSE, and FC-MSE by 6.5%, 16.3%, and 10.5%, respectively, relative to uniform sampling over both dimensions, and shows strong downstream performance across six in- and out-of-domain tasks. The taskonomy reveals asymmetric, target-dependent transfer, while exploratory sealed-test evaluation shows larger descriptive gains for BIP policies when higher-order route spaces are available than for matched random controls. Together, these findings support organizing fMRI pretraining and adaptation by measured learning relations rather than treating domains and tasks as independent flat sets.
Read the full abstract

All authors Junfeng Xia, Wenhao Ye, Junxiang Zhang, Jiayu Zuo, Mo Wang, Quanying Liu

Metric Geometry

An isoperimetric problem for Fourier zeros of centrally symmetric convex bodies

Given a centrally symmetric convex body, consider the zero set of the Fourier transform of its characteristic function. We study how large the distance from this set to the origin can be when the volume of the body is fixed. A 2009 conjecture of Benguria, Levitin, and Parnovski asserts that the maximum is attained by a Euclidean ball. We disprove it in all dimensions greater than one. In the plane, every regular centrally symmetric polygon with at least twelve sides outperforms the disk, albeit by a tiny margin, and the regular dodecagon is best among them. In dimensions three and higher, no maximiser exists.
Read the full abstract

All authors Javier Gómez-Serrano, Michael Levitin, Daniel Platt, Iosif Polterovich

Data Structures and Algorithms

Subexponential Approximation of the Permanent in Deterministic Polynomial Time

We give the first deterministic polynomial time algorithm that approximates the permanent of arbitrary nonnegative rational matrices within a subexponential factor. For a matrix of order $n$, the approximation factor is \[ \exp\!\left(O\!\left(\frac{n(\log\log n)^2}{\log n}\right)\right)=\exp(o(n)). \] All previously known deterministic polynomial time guarantees for unrestricted inputs had approximation factors $\exp(\Omega(n))$. Our proof uses convex optimization to tighten an upper bound on the permanent. The bound is based on weighted sums over all matchings in a bipartite graph representing the matrix, and correlations between unmatched vertices control its error. We approximate these sums deterministically using correlation decay and a bound on the effect of vertex deletion.
Read the full abstract

Performance

PASCAL: A Progress Divergence-Aware Shared-Cache Model

In modern AI accelerators and GPUs, many concurrent cores repeatedly access the same shared data. This pattern occurs in attention, where different query (Q) tiles share the same key and value (K/V) blocks, GEMM, where every tile in a row reads the same slice, and many other operators. We name this pattern shared cyclic scan. Due to a significant amount of data reuse in this pattern, the cache is expected to capture as much data reuse as possible and largely reduce requests sent to the main memory for both performance and energy consumption concerns. However, in reality, because of the intrinsic asynchrony of multi-cores, the actual cache miss rate and DRAM traffic can be much higher compared to ideal cases. In this paper, we propose PASCAL, a shared-cache model for shared cyclic scans. It calibrates finite-run traffic, which reflects progress divergence, on reference configurations and interpolates it along static program structure such as occupancy to predict the miss rate before execution. PASCAL supports software configuration exploration without target traces or counters at scales where cycle-accurate simulation is impractical, while its analysis gives a sharp $2\sigma-1$ sufficient capacity condition for preserving LRU sharing. Across held-out scans and GEMM on GB10 and Thor, PASCAL reaches 12.04% balanced fill-equivalent miss-rate MAPE. Replacing TileSight's cache component with PASCAL lowers GB10 GEMM latency MAPE from 18.17% to 13.14%.
Read the full abstract

All authors Zhongchun Zhou, Ya Wang, Chengtao Lai, Songtao Mao, Wei Zhang