Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Analysis of PDEs

Linear and Nonlinear Instability in Two-Dimensional Inertial Magnetohydrodynamics

We study spectral and nonlinear instability for some steady states of a two-dimensional inertial magnetohydrodynamic system on the torus. For equilibria with aligned velocity and magnetic fields, the linearized problem reduces to a matrix recurrence of Fourier coefficients, and a stable matrix continued fraction produces a smooth eigenmode. For a purely magnetic family, the square of the linearized operator admits a compact self-adjoint reduction on each transverse Fourier blocks that classifies the entire unstable spectrum. In an invariant symmetry class, we identify the unstable branches and a spectral gap below the leading eigenspace. The spectral gap then permits an approximate-trajectory construction that proves nonlinear instability on the logarithmic time scale. Our study is motivated by the physics literature, where the nonlinear instability of purely magnetic tearing modes is invoked to explain magnetic reconnection.
Read the full abstract

Solar and Stellar Astrophysics

Presence of Solar Neutral Atom Corona and Coronal Heating

By analyzing slit scanning spectral data obtained during 2024 total solar eclipse, presence of neutral atom corona is revealed along with a hidden inner F-corona detected within heights below half a solar radius. The inner F-corona is found to be essentially different from the Fraunhofer corona formed by dust scattering beyond about 2.3 solar radius heights. The two new kinds of the solar corona are deduced from the intensity difference between the spectral line intensity distribution and their adjacent continuum one acquired during the totality. Through analysis of the recorded spectra ranging from 516.0nm to 540.7nm, the relative depths of strong Fraunhofer lines are found to be changed among the neighboring lines from one place to another and from the photospheric lines acquired before the eclipse. Thus the resonant scattering is regarded to be responsible for the changes. Furthermore, shown in the reconstructed maps at selected spectral lines, the detected inner F-corona is found spreading globally and the neutral atom scattering acts as its dominant source. Both of their distribution patterns generally depend on specific lines and show considerably asymmetrical diffusions. The outward neutral fluxes are observed to be mainly hindered in regions of coronal magnetic loops with roughly estimated concentration above $10^{-5}$. Thus it can play a key role in global coronal heating via Cowling dissipation in these widely spread coronal loops, like heating in Tokamak by neutral beam injection(NBI). The Cowling dissipation can give a consistent interpretation of heating from the chromosphere to the corona. Thus the neutral atom corona is not only a new gradient of the solar corona but also the missed factor critical for concatenating together these coronal heating mechanisms.
Read the full abstract

All authors Z.Q. Qu, R.Y. Zhou, H. Su, Y. Liang, L. Chang, X.M. Cheng

Solar and Stellar Astrophysics

Thermodynamic exchange and mode stability in strongly nonadiabatic radial pulsations

We apply the quadratic balance relation for linear nonadiabatic pulsations to radial modes of a sequence of post-AGB envelope models covering $3.52\leq\log(T_{\rm eff})\leq4.6$. The relation separates the thermodynamic exchange power $\mathcal{P}_{\rm ex}$, response power $\mathcal{P}_{\rm rsp}$, and surface contribution $\Delta B$, and introduces an effective norm through $\mathcal{P}_{\rm ex}+\Delta B=2\gamma\chi_{\rm eff}\mathcal{E}_{\rm kin}$, where $\gamma$ is the mode growth rate. For nearly adiabatic modes $\chi_{\rm eff}$ is close to unity, whereas in strongly nonadiabatic pulsations the compression and horizontal area deformation contributions can make it change magnitude or even reverse its sign. In the cooler models, a broad family of overtone modes has $\chi_{\rm eff}<0$ and is damped despite positive thermodynamic exchange power. For these modes the response power supplies the opposing damping. Conversely, two low frequency modes in the hotter models are excited over a range of effective temperatures, even though their thermodynamic exchange power is negative. Their instability is produced by the positive response power. Strange modes generally have $\chi_{\rm eff}>0$, apart from a narrow boundary-sensitive transition during which a cold strange mode transforms into an ordinary p-mode. The excited low frequency solution with $\chi_{\rm eff}<0$ persists with a finer numerical mesh and such modes are found under the alternative outer boundary formulations examined, although their frequencies are boundary condition dependent. Thus, for strongly nonadiabatic pulsations, the sign of the thermodynamic exchange power alone does not determine mode stability.
Read the full abstract

Differential Geometry

On Compact Hermitian Surfaces With Positive Strominger-Bismut Sectional Curvature

In an earlier work, Yau and Zheng proposed a Hermitian analogue of a weak form of the Frankel conjecture, which states that any compact Hermitian manifold with positive Strominger-Bismut sectional curvature must be biholomorphic to the complex projective space. In this article, we confirm the conjecture in complex dimension two. This is achieved by a vanishing theorem for anti-self-dual harmonic 2-forms on such surfaces, utilizing a curvature decomposition formula by Ferreira and a refined Kato inequality.
Read the full abstract

Atomic Physics

Non-orthogonal extension of Graspg - dynamic electron correlation for large and compact active spaces

Accurate relativistic multiconfiguration calculations of correlation-sensitive atomic properties are often limited by the rapid growth of configuration state function expansions when a single common orthonormal orbital basis is used. In this work, a partitioned correlation function interaction (PCFI) method is developed for relativistic atomic structure calculations. The correlation space is separated into physically motivated components, which are optimized independently with correlation-specific orbital sets. The interactions between configuration spaces constructed from mutually non-orthogonal orbital sets are evaluated using biorthonormal transformations, allowing different correlation effects to be combined in a compact final interaction calculation. Full details of the method are provided, emphasizing its connection to configuration state function generators (CSFGs), which significantly reduce the time required to construct the Hamiltonian matrix in conventional RCI calculations. Applications to the neutral Li, Be, and Al atoms are presented for energy levels, mass shifts and hyperfine structure constants. Compared with conventional relativistic configuration interaction (RCI) calculations that rely on a single orbital basis, PCFI produces more compact and predictable convergence patterns for both total and transition energies. It also offers greater stability for correlation-sensitive properties such as specific mass shifts and hyperfine constants. By using property-oriented partitions, PCFI captures core-polarization effects more effectively, thereby reducing the oscillatory behavior often observed in standard RCI approaches. Overall, the results demonstrate that PCFI provides a promising and computationally efficient framework for accurate relativistic multiconfiguration calculations of correlation-dependent atomic properties.
Read the full abstract

All authors Sijie Wu, Ran Si, Chongyang Chen, Gediminas Gaigalas, Michel Godefroid, Per Jönsson

Fluid Dynamics

Control of Reverse Flow on High-Speed Rotorcraft Using a Blade with a Sinusoidal Trailing Edge

One of the main challenges limiting the maximum forward speed of high-speed rotorcraft is the development of reverse flow on retreating blades. Flow separation at the sharp aerodynamic leading edge during reverse flow leads to negative lift, high drag, high pitching moment, and a pitching moment impulse. The study experimentally investigates the effectiveness of a sinusoidal trailing edge as a passive method for the control of reverse flow, under static pitching conditions. Three NACA 0015 two-dimensional blades were evaluated under both reverse and forward flow conditions. A baseline blade with a straight trailing edge and two modified blades with sinusoidal trailing edges, each having a spatial amplitude of 10% of the chord and wavelengths of 5% and 10% of the chord, respectively. Experiments were conducted at chord-based Reynolds numbers of 70000 and 140000, consisting of planar Particle Image Velocimetry and aerodynamic load measurements. The study shows that a sinusoidal trailing edge significantly mitigates flow separation, leading to a large reduction in the associated problems over a wide range of angles of attack. The problem of pitching moment impulse is eliminated. The sinusoidal geometry with a lower wavelength of 5% of the chord shows comparatively better performance. Additionally, both sinusoidal geometries minimally affect the forward flow characteristics.
Read the full abstract

Machine Learning

Robust small-molecule identification from incomplete, degraded, and inconsistent spectra using multimodal mixed-condition training

Reliable small-molecule identification often requires complementary evidence from multiple spectroscopic measurements. In practice, however, spectra may be unavailable, degraded by measurement-related variations, or even incorrectly associated with a sample, thereby hindering accurate molecular identification. Herein, we propose a multimodal mixed-condition training strategy that accommodates missing, degraded, and mismatched measurements for small-molecule structure identification. The strategy incorporates chemical and spectroscopic knowledge through predefined missing-input configurations, modality-specific spectral perturbations, and chemically informed spectrum replacements. Models were trained on 635,441 samples comprising mass spectrometry (MS), infrared (IR), and nuclear magnetic resonance (NMR) simulated spectra from the Multimodal Spectroscopic Dataset (MSSD). They were then systematically evaluated on 79,462 held-out samples across 30 views designed to represent variations in spectra. A controlled comparison of complete-input and mixed-condition training under concatenation and mixture-of-experts (MoE) fusion showed that the training strategy was the principal source of improvement. For MoE, mixed-condition training increased the mean reciprocal rank (MRR) by 6.08% (from 0.9203 to 0.9763) and the top-1 molecular identification rate by 7.67% (from 89.50% to 96.36%). Notably, under single-modality inputs, IR MRR increased 2.15-fold (from 0.4337 to 0.9307), while MS MRR increased 2.31-fold (from 0.3711 to 0.8575). With the proposed strategy, complete-input performance remained high, while sample-level mismatch detection also improved. Together, these results highlight the potential of multimodal mixed-condition training for practical molecular identification by explicitly addressing incomplete, degraded, and mismatched measurements encountered in real-world analysis.
Read the full abstract

All authors Bowen Gao, Lei Zhu, Yiying Wang, Wenjie Yu

Functional Analysis

Jensen-type inequalities on pairs of measure spaces and their applications

We develop applications of a Jensen-type inequality for pairs of positive measure spaces. The framework yields $L^p$ and operator inequalities for positive integral operators, norm and entropy estimates for Fejér means, and probabilistic moment and variance bounds. We also obtain robustness estimates under random and deterministic erasures. These results provide a unified connection between Jensen-type inequalities, harmonic analysis, operator theory, probability, and robust reconstruction.
Read the full abstract

All authors Shankhadeep Mondal, P. D. Johnson, R. N. Mohapatra, David Guinovart

Analysis of PDEs

Interaction between nonlinear diffusion and mean curvature of a surface with initial discontinuities

We consider the Cauchy problems for a class of nonlinear diffusion equations where each initial data is given by a characteristic function of an open set $\Omega$ in the whole Euclidean space. If the boundary $\partial\Omega$ is of class $C^2$ in a neighborhood of a point $x$ on it, then we extract the mean curvature of $\partial\Omega$ at $x$ from the initial diffusion at $x$. This corresponds to the author's previous result for the two-phase linear diffusion equation. Applications to some overdetermined problems for nonlinear diffusion equations are given.
Read the full abstract

Combinatorics

A finite cover for coefficient positivity of stretched Littlewood-Richardson polynomials in the seven-row, size-thirty box

We give a finite cover argument for nonnegativity of the ordinary monomial coefficients of every stretched Littlewood-Richardson polynomial with partition lengths at most seven and outer size at most thirty. Explicit reductions leave 358,952 residual triples. The computational part consists of exact finite enumeration, local reduction checks and rational Ehrhart polynomial computations. Its three named dependencies are stated precisely below, separately from the mathematical implication they establish.
Read the full abstract

Distributed Computing

Color Complexity of Recolorable Graph Exploration: Upper and Lower Bounds via Block Structure

We study exploration of anonymous, port-free graphs by a single agent with no internal memory. To compensate for the lack of memory, the agent uses writable vertex colors as external memory. From every starting vertex, the agent must visit all vertices, return to its start, and terminate there. Throughout, recoloring is unrestricted, and the color count includes the common initial color. However, to our knowledge, no nontrivial color lower bound was known for unrestricted recoloring. We determine the optimal number of colors on two classes defined by block structure and prove the first nontrivial color lower bounds for unrestricted recoloring. First, a single three-color algorithm explores every tree and every simple cycle in $O(n)$ moves, and no algorithm with at most two colors explores $P_3$, the path on three vertices. Second, we give a four-color algorithm that explores every graph whose blocks are cycles or complete bipartite graphs in $O(n)$ moves, and we prove that no algorithm with at most three colors explores all subcubic pseudotrees. Hence four colors are optimal for every class between subcubic pseudotrees and this block-defined class. On cacti, this improves the previous five-color upper bound to a tight four. The lower bound reduces the possible initial actions by hand and rules out the remaining cases by a machine-checked SAT certificate on nine graphs with at most five vertices. Finally, we extend the known five-color algorithm for triangle-free graphs to graphs whose blocks are cliques or triangle-free, using $O(n\Delta)$ moves, where $\Delta$ is the maximum degree.
Read the full abstract

All authors Shoma Hiraoka, Shunsuke Imori, Shota Takahashi, Yuichi Sudo

Combinatorics

Subtree Counts and the Maximum Mean Subtree Order

For a finite simple graph $G$ of positive order, let $s_k(G)$ be the number of its $k$-vertex tree subgraphs. We prove that, among graphs of a fixed order $n$, the ratios $s_k(G)/s_k(K_n)$ form a nonincreasing sequence in $k$. It follows that the complete graph maximizes the mean subtree order: $\mu(G)\leq\mu(K_n)$, with equality if and only if $G$ is complete. This monotonicity theorem also establishes the $s_{n-1}$-to-$s_n$ ratio conjecture posed in recent work on extremal mean subtree order. The proof lifts a known coupling of rooted Cayley-tree shapes of consecutive orders to uniform labeled tree subgraphs of $K_n$ that are nested at every sample point. Event inclusion gives the count inequalities, and a double-sum identity gives the mean bound.
Read the full abstract

All authors Jungang Chen, Xian'an Jin, Zhuo Li, Hongxia Ma

Dynamical Systems

Statistical behavior of systems with nested invariant cones

Nested invariant cones (NICs) encode hierarchical order and oscillation structures in many finite and infinite dimensional dynamical systems. We investigate how this hierarchy constrains the Birkhoff center and the supports of invariant probability measures. For eventually compact, dissipative semiflows that are uniformly eventually strongly monotone with respect to NICs, we prove that every connected component $B$ of the Birkhoff center lies in a single cone layer: there exists $j>0$ such that $B$ is unordered with respect to all lower-level cones and strongly ordered with respect to all cones at level $j$ or higher. The same conclusion holds for every connected component of the support of an invariant probability measure. Under an additional transversality condition involving a codimension-$d$ linear subspace, each such component admits a homeomorphic embedding into $\mathbb R^d$. If $d=1$ or $2$ and the restriction of the semiflow to its global attractor extends to a flow, then the system has zero topological entropy, independently of the dimension of the original phase space. We apply the theory to bidirectional cyclic feedback systems and scalar parabolic equations on the circle. In the parabolic case, the natural infinite family of zero-number NICs fails to be uniformly eventually strongly monotone, even for the heat equation; we overcome this obstruction by constructing a finite family of perturbed NICs. In both applications, every connected component of the Birkhoff center admits a planar embedding, and the topological entropy is zero.
Read the full abstract

Human-Computer Interaction

ggaction: A Grammar of Graphical Actions

A chart may be declarative; authoring it is not. Visualization grammars often describe charts as finished specifications, whereas people construct them through a sequence of authoring actions. This mismatch can make visualization code difficult for humans to interpret and for machines to generate from human intent. ggaction addresses this gap by modeling the chart authoring process itself. In ggaction, individual authoring actions are abstracted as functions, and the authoring process is expressed as a chain of these functions. This representation more closely aligns chart designers' authoring intent with code specifications, making the code easily understandable to both humans and machines, including language models. Through a series of evaluations, we show that ggaction is sufficiently expressive to capture common chart authoring intents and outperforms widely used visualization grammars, including Vega-Lite and ggplot2, in both human and machine interpretability. ggaction is available at github.com/ggaction/ggaction.
Read the full abstract

Computer Vision

Beyond Natural Images: Rethinking AI-Generated Image Detection in Documents

AI-generated image detection has attracted increasing attention, but existing evaluations mainly focus on natural images, leaving AI-generated document images largely underexplored. This omission is concerning because documents often appear in sensitive real-world scenarios, such as invoices, expense reports, certificates, and medical records. In this paper, we first construct a controlled diagnostic benchmark, AIGDoc-Pilot, and reveal that existing detectors suffer substantial performance degradation on AI-generated document images, with the mean AUC dropping by more than 7%. Based on this, we further reveal two document-specific properties behind this gap: generation artifacts exhibit strong spatial inconsistency across local regions, and text density significantly affects real-synthetic separability, where text-dense regions offer stronger discriminative evidence. Motivated by these findings, we construct AIGDoc, a larger document-centric dataset containing diverse real-world documents and AI-generated counterparts produced by multiple advanced generation and editing models. Extensive experiments on AIGDoc demonstrate that existing detectors still struggle to reliably identify AI-generated documents, while document-based training partially narrows the gap. Together, these results offer valuable insights for developing dependable and generalizable detectors in document-centric scenarios. The code and datasets will be made publicly available upon acceptance of the paper.
Read the full abstract

All authors Zhangjie Fu, Jiazhen Yan, Yuanwen Chen, Xinquan Yu, Yanzhe Li, Hui Jiang, Lei Gao, Chenfu Bao

Combinatorics

The Colomo-Pronko conjecture for frozen-corner alternating sign matrices

We prove the Colomo-Pronko conjecture for alternating sign matrices with a prescribed square of zeros at a corner, for all matrix sizes and freezing parameters. A known multiple-integral formula for the frozen-corner count yields determinant representations built from fixed polynomial kernels. We relate these kernels to the conjectured determinant through an inverse identity for the commutator of a signed Pascal matrix with reversal. In odd dimension, the comparison uses the one-dimensional nullspace and projection along it to eliminate the central coordinate. Combined with the asymptotic analysis of Colomo and Pronko, our result removes the conjectural assumption from their GUE Tracy-Widom fluctuation theorem for the intersection of the frozen boundary with the main diagonal in uniformly random alternating sign matrices. The finite-dimensional algebraic core of the proof has been formalized in Lean 4.
Read the full abstract

Computer Vision

Two-Stage Mixture-of-LoRA for Multi-Task Medical Vision-Language Learning

Medical vision-language models (VLMs) allow a single model to perform clinical image analysis tasks ranging from diagnosis classification to report generation. However, joint adaptation is challenged by heterogeneous output formats, conflicting task gradients, and imbalanced training data. Hence, we present Two-Stage Mixture-of-LoRA, a framework built on MedGemma-1.5-4B. The framework uses a shared-specific Mixture-of-LoRA architecture comprising one shared LoRA and six task-specific expert LoRAs, together with a two-stage training procedure. In Stage 1, we jointly train the shared LoRA and all task-specific expert LoRAs on all tasks. In Stage 2, we first freeze the backbone, the shared LoRA, and all non-target experts, and refine one task expert at a time. Classification and regression then receive an additional modality-balanced continuation, in which smaller modality groups are repeated to match the largest group. In the FLARE 2026 Task 3 test sets, the proposed method achieves 0.85 balanced accuracy for classification, 0.48 micro-F1 for multi-label classification, 0.79 detection F1, and 17.39 regression MAE. Code is available at https://github.com/YuanYL03/MICCAI-FLARE-2026-Challenge-Task3-2D.
Read the full abstract

All authors Zhanghao Chen, Yuanyuan Li, Zhenyu Lu, Shuo Gao, Guangquan Zhou, Yikun Zhang

Combinatorics

Finite identity bases for flat semirings of linear words

For a set $W$ of nonempty words, let $S(W)$ be the flat semiring formed by the nonempty factors of words in $W$, together with an absorbing zero. We prove that $S(W)$ has a finite identity basis whenever every word in $W$ is linear, with no restriction on the size of $W$ or on the lengths of its words. In the bounded case its variety is generated by the interval semiring $A_m\cong S(a_1\cdots a_m)$, where $m$ is the maximum word length and the letters $a_i$ are distinct. In the unbounded case its variety is generated by the interval semiring on all finite intervals of the nonnegative integers. We give explicit finite bases in both cases. The proofs encode nonzero polynomial evaluations by endpoint graphs and derive the required graph identifications using finitely many splicing identities. In particular, the eleven-element semiring $S(abcd)$ is finitely based, providing a counterexample to the length-bound conjectures for $S(W)$ proposed by Gao, Ren and Zhao.
Read the full abstract

Materials Science

4DMulti: automated multicomponent identification at complex material interfaces

Mapping crystalline phases at heterogeneous interfaces is essential for understanding material performance and degradation. However, structural heterogeneity, phase overlap, and local disorder complicate diffraction interpretation, while growing data volumes make manual analysis increasingly impractical. We introduce 4DMulti, a physics-guided learning framework for automated multicomponent identification from large-scale four-dimensional scanning transmission electron microscopy (4D-STEM) data. The supporting diffraction data resource comprises over 6 million high-quality experimental patterns and labeled patterns generated by Sim2real. A retrieval-conditioned latent diffusion transformer (Sim2real) translates simulated patterns into experimental-style examples under constraints designed to preserve Bragg geometry, while a rotation-invariant coordinate convolutional network identifies phases across in-plane rotations. 4DMulti achieves 98.82% classification accuracy on a five-phase experimental nanoparticle benchmark, with ablation studies supporting the complementary benefits of domain adaptation and rotation-invariant classification. We define diffraction-inferred structural complexity (DISC), a normalized predictive entropy score that quantifies phase-assignment ambiguity within a specified candidate phase library. We apply 4DMulti to generate structural maps of superconducting heterostructures, corroded alloy surfaces, and degraded solid-state battery interfaces down to single-nanometer spatial resolution. 4DMulti connects simulation-derived crystallographic knowledge to automated experimental interpretation, establishing a foundation for scalable analysis of complex interfaces and data-driven discovery of interfacial design principles.
Read the full abstract

All authors Haoran Zhang, Zian Mao, Shufen Chu, Xiaoya He, Yuyan Guan, Antong Yang, Mingze Li, Xiaoqin Zeng, Yujun Xie

Computer Vision

Mobile CT Services for Rural, Regional, and Remote Areas: Current Practice and Future Integration with Telehealth and Regulatory-Authorised AI

Computed tomography (CT) plays an essential role in clinical workflow to improve patient outcomes. However, access to CT imaging and specialist interpretation remains limited, particularly in rural, regional, remote (RRR), and other resource-limited settings. Recent advances in mobile CT, telehealth, and artificial intelligence (AI) provide opportunities to extend advanced imaging services to populations in RRR settings. This review examines: 1) mobile CT systems deployed in trucks, trailers, ambulances, and other mobile platforms; 2) telehealth technologies supporting CT-based healthcare; and 3) AI for CT that has received regulatory authorisation or is currently deployed in clinical practice. Applications are evaluated across four clinical functions: screening and diagnosis, patient monitoring, risk prediction, and intervention or therapeutic decision support. The review covers neurological, thoracic, cardiovascular, abdominal, oncological, musculoskeletal, and interventional imaging, with particular attention to stroke, cancer, and other image-guided treatment. Other factors such as regulatory status, deployment status, and estimated technology readiness (TRL) level are compared. Current evidence indicates that mobile CT, telehealth, and AI for conventional CT are individually relatively mature, but fully integration of these technologies remains less widely deployed and validated in the clinical settings. Key barriers include regulatory variation, domain shift, connectivity requirements, cost, workflow integration, cybersecurity, and limited evidence of patient-level benefit. Future research should prioritise prospective, multicentre evaluation of integrated CT systems in real-world and underserved clinical settings.
Read the full abstract

All authors Zhicheng Lu, Md Zahid Islam, M Mamun Huda, Kristie Sweeney, Shayne Chau, Oliver Mulcock, Corey Hemopo, Catherine Keniry, Mohammad Ali Moni

Optimization and Control

Spectral-Residual Continuous Greedy for Tensor Sampling

Sampling a multidomain tensor from limited measurements is fundamental in structured linear inverse problems. Kronecker-structured sampling avoids the full high-dimensional sensing matrix, but design remains difficult: sequential discrete methods can commit the cross-mode budget too early, whereas standard continuous greedy avoids such early commitment at the cost of repeated state-dependent gradient evaluations. We propose spectral-residual continuous greedy (\alg) for frame-potential (FP) tensor sampling. \alg maintains a state-dependent fractional allocation before rounding. Mode-wise Gram matrices provide safe gradient intervals for direction certification, while Shapley values prioritize unresolved gradient queries. SR-CG then applies deterministic rounding followed by path-guided exchange (PGX), which reuses the final fractional state to restrict candidate swaps and accepts only exact FP-decreasing exchanges. We establish a finite-step approximation guarantee that approaches the classical $1-1/e$ factor as direction certification becomes exact and finite-step residual error vanishes. Experiments show fewer exact gradient evaluations and better FP designs, with clearer gains on instances where the cross-mode budget allocation is difficult to determine. \alg also achieves lower average normalized mean-squared error (NMSE) than Greedy-FP at all tested noise levels, although the reconstruction gain is smaller than the FP gain.
Read the full abstract

High Energy Physics (Theory)

Free Field Realization of $\mathcal{W}$-Algebra Associated with Exceptional Lie Algebras

We study the free field realization of the $\mathcal{W}$-algebra associated with the exceptional Lie algebras $E_6$, $E_7$, $E_8$, and $F_4$. We develop a recursive construction in which a $\mathcal{W}$-algebra of rank $r$ is obtained from a $\mathcal{W}$-algebra of rank $r-1$ together with a free boson. The $\mathcal{W}$-currents are constructed from the zero commutation relation with the screening charges. The $\mathcal{W}E_6/\mathcal{W}E_7$ algebra is constructed from the $\mathcal{W}D_5/\mathcal{W}D_6$ algebra and is shown to be the same as that realized from the $\mathcal{W}A_5/\mathcal{W}E_6$ algebra, up to a change of the free field basis. The spin-$8$ generator of the $\mathcal{W}E_8$ algebra is built from the $\mathcal{W}D_7$ algebra. The recursive construction of the $\mathcal{W}BC_r$ algebras is also studied. We then realize the $\mathcal{W}F_4$ algebra based on the $\mathcal{W}BC_3$ algebra. Furthermore, the $\mathcal{W}$-charges of the generators of the $\mathcal{W}E_{6,7}$, $\mathcal{W}BC_{2,3}$, and $\mathcal{W}F_4$ algebras are calculated and expressed in terms of the Casimir invariants.
Read the full abstract

Sound

AURA: Unified Multimodal Framework for Conversational Music Editing

Instruction-guided music editors typically process each request independently, limiting their ability to support workflows in which users progressively refine a track. We introduce AURA, a unified multimodal framework for conversational music editing. AURA uses a multimodal large language model to interpret the complete dialogue history, an optional image, and reference audio, distilling the editing intent into compact concept tokens. A concept-to-audio module injects these tokens and frame-aligned reference features into a frozen MusicGen backbone, enabling precise edits while preserving unaffected content. AURA optimizes only 91M parameters while retaining 1.9B frozen backbone parameters. Experiments on Slakh2100 and MoisesDB demonstrate substantial improvements in edit correctness and content preservation over existing instruction-guided methods, including a 4-5 times reduction in FAD for out-of-domain addition and removal.
Read the full abstract

Robotics

BIG-CBF: Behavior-Imagination-Guided Control Barrier Function with Shared Uncertainty for Mobile Robot Navigation

Control barrier functions (CBFs) provide a mathematically grounded framework for enforcing local collision-avoidance constraints in autonomous mobile robots, commonly through optimization-based safety filters. However, a minimum-intervention CBF filter lacks task-level maneuver awareness and may fail to select a productive avoidance direction when multiple distinct maneuvers are locally viable, leading to safe but stalled behavior in geometrically ambiguous environments. This paper presents BIG-CBF, Behavior-Imagination-Guided Control Barrier Function with shared uncertainty, a two-rate navigation architecture that separates low-rate maneuver selection from high-rate safety filtering. Over a short horizon, six closed-loop feedback behaviors are imagined and evaluated using analytic CBF compatibility together with a lightweight objective accounting for task progress, freezing, smoothness, and switching. To reduce planning-execution mismatch, the imagination and execution layers share consistent uncertainty sources for relative-motion delay, obstacle prediction, zero-order-hold motion, and command-execution residuals, while a hard CBF remains the final safety authority. In a 3,600-episode comparative benchmark across nine scenarios, BIG-CBF achieves the highest overall task success rate of 99.78% while substantially reducing downstream CBF intervention. On a physical omnidirectional robot with onboard Jetson Orin Nano computation, BIG-CBF completes all 15 evaluation runs without a recorded contact event. Matched hardware comparisons against the non-shared variant further show lower CBF intervention energy and activation frequency, supporting improved consistency between maneuver selection and safety-critical execution.
Read the full abstract

All authors Shibo Li, Zhongcheng Wang, Jiahe Cao, Jianhua Yang, Ke Wu

Astrophysics of Galaxies

Decoding RR Lyrae light curves with deep learning for accurate absolute magnitude estimation

RR Lyrae stars are essential standard candles for distance measurements in the Milky Way and nearby galaxies. Traditional estimates rely on the Period–Absolute Magnitude–Metallicity relation but are limited by uncertainties in metallicity determinations. We present a deep learning approach that directly predicts absolute magnitudes from RRab and RRc light curves, eliminating the need for metallicity estimates. Our model achieves validation precisions of 0.053 mag and 0.036 mag (approximately 2.5% and 1.7% in distance) for individual RRab and RRc stars, respectively. Tests on globular clusters yield typical distance precisions of 1.0% for RRab and 1.7% for RRc stars. For the benchmark systems, combining the RRab- and RRc-based models yields distance moduli of 18.498 $\pm$ 0.001$_{\text{stat}}$ $\pm$ 0.018$_{\text{sys}}$ mag for the Large Magellanic Cloud and 19.564 $\pm$ 0.003$_{\text{stat}}$ $\pm$ 0.019$_{\text{sys}}$ mag for the Sculptor dwarf spheroidal galaxy. These measurements are in excellent agreement with previous results, achieve a distance precision of approximately 1%, and represent a 1.8-fold improvement over traditional RR Lyrae calibration relations. Our approach showcases the ability of AI to directly extract key physical parameters from complex, information-rich light curves, resolve degeneracies, and scale to broader applications.
Read the full abstract

All authors Shunxuan He, Huiwen Wu, Yang Huang, Deyi Zhang, Guirong Xue, Jifeng Liu, Xiaodian Chen, Xinyu Qi, Xiaoyu Tang

Quantum Physics

Engineering non-Markovianity from spectral shaping of bosonic and fermionic baths

Non-Markovianity is the property that a physical system's future state depends on its previous dynamical history, namely the system has memory of its past. It is a key resource for quantum technologies but it is difficult to engineer without specific strategies. Here, we show that introducing a band gap in the environmental spectral density of both bosonic and fermionic baths provides a direct route to tuning non-Markovianity over a wide range. We demonstrate this effect by means of numerical simulations across bosonic and fermionic environments and discuss experimental tests of our predictions.
Read the full abstract

All authors Si Luo, Cun Long, Daochi Zhang, Massimiliano Di Ventra, Xiao Zheng

Combinatorics

Poisson laws and exterior stability for random alternating tensors

For fixed $k\ge3$, we determine the critical law of totally isotropic $r$-spaces for a uniform random map $\Theta_N:\Lambda^k\mathbb {F}_q^N\to\mathbb {F}_q^m$. At the exact balance $m\binom rk=r(N-r)$, the entire null configuration is asymptotically an independent Bernoulli subset of $\operatorname{Gr}(r,\mathbb {F}_q^N)$ in total variation, uniformly in $q$ and $m$. Consequently, the counting measure $\Xi_r$ is asymptotically a Poisson point process, and its total mass $X_{N,r}$ is asymptotically Poisson. An exterior-rank stability theorem shows that near-extremal families decompose into Grassmann clusters with uniformly controlled span deficiency. We obtain quantitative rates and identify the first exterior-dependence scale. We also show that rare null $(r+1)$-spaces force high-order factorial-moment divergence, while the fixed-target bilinear cases $m=1,2$ exhibit non-Poisson critical behavior.
Read the full abstract

Machine Learning

Communication-Efficient LLM Adaptation over Decentralized GPU Meshes

Decentralized training enables large-model training over low-end GPUs and internet-grade connections, but communication along both data-parallel and pipeline-parallel axes becomes the primary bottleneck. We study post-pretraining adaptation in this setting. We propose an asynchronous two-circuit system: a fast compressed training circuit drives throughput using activation masking for pipeline-parallel (PP) transfer and compressed data-parallel (DP) synchronization, while a slow anchor circuit runs occasional unmasked forward–backward passes off the critical path. Then, we introduce a spectral correction optimizer that uses these delayed anchor priors to denoise masked gradients without blocking the fast stream. Although prior work has found aggressive activation compression unreliable, we show that masking supports post-pretraining adaptation at high compression rates when anchored this way. Pipeline-parallel compression alone yields up to a $9\times$ throughput gain, and combining it with data-parallel compression increases beyond $40\times$ over internet-grade $\sim 200$Mbps connections, while matching dense uncompressed performance across domain adaptation and continual pretraining.
Read the full abstract

All authors Sameera Ramasinghe, Shamane Siriwardhana, Thalaiyasingam Ajanthan, Hadi Mohaghegh Dolatabadi, Chamin P Hewa Koneputugodage, Gil Avraham, Violetta Shevchenko, James Snewin, Karol Pajak, Harry Xi, Alexander Long

Commutative Algebra

Baer Splitting Beyond $\tau_q$-Semisimplicity

For a commutative ring $R$, we call an $R$-module $B$ Baer if $\Ext_R^1(B,T)=0$ for torsion $R$-module $T$. It is known that every Baer module is projective when $R$ is $\tau_q$-semisimple, i.e., rings whose total rings of quotients are semisimple. And it was conjectured that the converse characterizes $\tau_q$-semisimple rings. We show that the converse fails in two substantially different ways. First, the failure is already systematic in the non-reduced Noetherian case. If $D$ is a Dedekind domain which is not a field and $R=D[\varepsilon]/(\varepsilon^2)$, then every Baer $R$-module is projective, although $R$ is not reduced, and thus is not $\tau_q$-semisimple. Second, the converse fails even among reduced rings, and in fact among reduced coherent Bézout rings. The main tool is a countable-ring criterion. For a countable Noetherian domain $D$, let $\EC(D)$ be the ring of eventually constant sequences over $D$. If $D$ is not a field, then every Baer $\EC(D)$-module is projective, whereas $\EC(D)$ is reduced and has countably infinitely many minimal prime ideals, and thus is not $\tau_q$-semisimple.
Read the full abstract

Optimization and Control

Convex Pursuit-Evasion Games for Spacecraft Proximity Operations on Circular and Elliptical Orbits

Inspecting or servicing a non-cooperative spacecraft is a two-player game: the target can thrust to defeat the inspector's plan. Hamilton-Jacobi-Isaacs reachability answers such games exactly but its cost grows exponentially with state dimension, while learning-based controllers scale yet certify nothing. Convex formulations are the usual escape, typically cast as convex-concave saddle-point problems. That framing fails in the terminal-distance orbital game: with effort regularization, the payoff is convex in both controls, so no pure open-loop saddle point need exist. In its place we derive two exact one-sided guarantees read from the players' terminal reachable sets via support functions: an escape certificate proving the target can hold a guaranteed standoff, and a security strategy bounding the miss distance the inspector can force. Together they bracket the engagement without assuming player rationality, and over two hundred perturbed trials the escape certificate separated capture from escape without error. A projected extragradient method supplies a strategy pair in about 25 ms, certified in place by best-response gaps. The construction carries unchanged to elliptical reference orbits via Yamanaka-Ankersen dynamics, where the orbital phase moves miss distance by nearly a factor of two, reproduced by nonlinear Keplerian propagation. Under receding-horizon play the inspector captures in half of ten representative engagements. Angles-only navigation error, keep-out zones, multiple pursuers, and closed-loop play are treated as extensions.
Read the full abstract