Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 15 September
Determining the momentum missing on a Poincaré section of a two-degree-of-freedom Hamiltonian is usually posed as the root-finding problem $H(0,q_2,p_1,p_2)=E$, which degenerates at the boundary of the energetically allowed region. We argue that the degeneration is the visible symptom of a geometric object and reorganize the problem around it. The section is a coisotropic hypersurface, the missing momentum is its characteristic direction, and recovering it is a reconstruction through the associated coisotropic reduction. Its carrier is not the fibrewise least-energy function, which we show is informationally incomplete, but the correspondence $\Sigma_E^{\mathrm{sec}}=\Sigma_E\cap C$ together with the reducing projection $\pi_E$, a branched reconstruction over the admissible region whose discriminant is identified with the Hill boundary under a base-side regularity condition. We prove, isolating for each conclusion its minimal hypothesis: that $\pi_E$ is proper and a covering away from the discriminant (coercivity); that the fibres have exactly two points over the interior (unimodality); that along the discriminant $\pi_E$ is a fold (fibrewise nondegeneracy and transversality); and that the discriminant coincides with the topological boundary of the admissible region precisely under a regularity of the least-energy function on the base, which no fibrewise hypothesis supplies. Strict convexity of $H$ in the momenta is shown to be a sufficient but non-fundamental bundle of these conditions. The boundary is a discriminant, not a Lagrangian caustic. Only afterwards does the squared fibrewise energy residual $F_b=(h_b-E)^2$ appear, as the analytic resolution of the fold; inside the admissible region it is a double well with two global minimizers, so branch selection is a separate rule.
Number Theory
The Local Ghost Theorem in the Très Ramifié Case
Let $p\geq 11$ and let $\bar\rho$ be a très ramifié representation. For a primitive projective-augmented module of the corresponding type, we prove the très ramifié analogues of the local results of Liu-Truong-Xiao-Zhao and thereby establish the local ghost conjecture in this case. The main difference here is that the Iwahori dimension increases by one between consecutive relevant classical weights and may therefore be odd. Accordingly, the proof of the near-Steinberg results must treat both integral and half-integral centres.
Read the full abstract
Instrumentation and Detectors
Cyclotron-Frequency Stability via Single-Ion Fluorescence in a Penning Trap with a Cryogen-Free Superconducting Magnet
In this work, we investigate the magnetic-field stability of a Penning trap operated with a cryogen-free superconducting magnet through cyclotron-frequency measurements of a single laser-cooled calcium ion using two complementary photon-based detection techniques: a pulsed optical method for determining the three ion eigenfrequencies and Fluorescence-Detected Fourier-Transform Ion-Cyclotron-Resonance (FD-FT-ICR). For the former technique, the data-analysis procedure was revisited, considering it as the dominant contribution to the measurement uncertainty and yielding a long-term magnetic-field drift $(1/B)(dB/dt) = -3.07(32)\times10^{-9}$ $\mathrm{h}^{-1}$. This value is comparable to those reported for high-precision Penning-trap experiments employing liquid-helium-based superconducting magnets. The short-term stability was investigated using the FD-FT-ICR technique, resulting in a minimum relative magnetic-field variation of $\delta B/B \simeq 5\times10^{-8}$ for averaging times between 30 and 60 s. Furthermore, this technique enables direct cyclotron-frequency determinations on timescales as short as a few seconds, providing access to magnetic-field fluctuations that are generally not resolved in conventional Penning-trap experiments.
Read the full abstract
Quantum Physics
Phase Transition in Binary Compressed Sensing via Annealing with Adaptive Regularization
Regularization choice changes the recovery phase diagrams of annealing-based binary compressed sensing. We develop a regularization-selection method that combines systematic parameter search with random forest regression. Under noiseless Gaussian measurements with known sparsity, reference parameters are selected from a candidate grid by minimizing mean squared reconstruction error over repeated simulated annealing (SA) trials. The fitted model predicts these reference values from signal dimension, sampling ratio, and sparsity. With predicted regularization, the SA recovery transition broadly follows the asymptotic reference boundary for box-constrained $\ell_1$ recovery at the larger signal dimensions examined. Without retraining, the same predictor supplies identical regularization values to SA and a quantum–classical hybrid solver. On matched problem instances, the hybrid solver yields smaller mean squared reconstruction errors than SA in parts of the evaluated parameter space. The resulting rule reuses the searched information for subsequent reconstruction without repeating candidate searches at each setting. The results quantify empirical performance under the stated finite candidate grid and solver settings; they do not constitute a solver-independent recovery guarantee or a time-to-solution comparison.
Read the full abstract
Computational Complexity
Euclidean SVP is NP-hard for Cyclic Lattices
We prove that exact Euclidean SVP is NP-hard under deterministic polynomial-time many-one reductions for full-rank cyclic integer lattices, equivalently full-rank ideals of $R_N:=\mathbb{Z}[X]/(X^N-1)$ in the coefficient norm. Hardness holds with $N=q-1$ for a varying odd prime $q$. As an application, we prove the same hardness for the algebraic class of NTRU-form lattices $\{(x,z)\in R_N^2:Hx\equiv z\pmod{QR_N}\}$, where $H,Q$ are unrestricted inputs. The decision problems are NP-complete, and the exact search problems are NP-hard under polynomial-time Turing reductions. No hardness claim is made for cryptographic NTRU parameter subclasses or key-generation distributions.
Read the full abstract
Machine Learning
Continuous-Time Machine Learning: A Unified Mathematical Perspective
Continuous-time (CT) machine learning has emerged as a principled framework for modeling temporal dynamics as a continuous process, particularly when observations are sampled at arbitrary time points or span long-range horizons. However, major branches of CT machine learning have matured in separate research communities, leaving their mathematical relationships and design trade-offs insufficiently characterized. In this survey, we develop a unified, concept-driven view of major CT machine learning branches through a taxonomy that organizes families according to their underlying base mathematical formulations. We present a canonical mathematical formulation that relates these families through different architectural choices of vector-field parameterization, stochasticity, memory mechanisms, and discretization. We compare training algorithms, optimization strategies, and failure modes, highlighting the trade-offs across families. We further provide a comparative analysis of theoretical computational complexity alongside an illustrative architecture-controlled benchmark analysis on representative architectures from each family. We also review software ecosystems supporting their implementation. Finally, we identify open challenges in approximation theory, training stability, hardware-efficient implementations, benchmarking, foundation models, and scientific machine learning, and discuss an agenda for future research.
Read the full abstract
Fluid Dynamics
Turbulence at an aerofoil leading edge: the linearity boundary and its generation mechanism
Turbulence approaching an aerofoil leading edge is strained and blocked in the final few nose radii. Rapid-distortion theory assumes that the pre-impact field is a linear image of the upstream turbulence; we test that assumption directly. Grid turbulence is computed over a NACA~0012 aerofoil and sampled on three congruent surfaces around the nose, giving the cross-spectral tensor between upstream and pre-impact stations. Relative to a no-aerofoil control, the linearity spectrum falls by a factor of three already at the energy-containing scales ($\kappa = k\,r_{\mathrm{LE}} \approx 0.3$), showing that a substantial part of the pre-impact turbulence is generated locally rather than inherited. The same location appears in physical space: the anisotropy invariant $III_b$ changes sign from prolate to oblate within the last few per cent of chord, departing the plane-strain rapid-distortion prediction. The change is produced by pressure–strain redistribution, which drains the strain-amplified wall-normal stress into the other components; the term is absent in the control and becomes active once the accumulated strain is rapid. Across a fourteen-fold range of nose radius the sign change occurs at $x \approx -1.5\,r_{\mathrm{LE}}$ and the generated turbulence is spanwise-dominated. At second order the mapping remains usable: when inserted into a standard Amiet prediction it improves agreement with measured leading-edge noise, and the same coefficients transfer to independent published cases when only nose radius and free-stream speed are supplied.
Read the full abstract
Probability
Brownian motion on the complex general group and the non-compact Jacobi process
In this paper, we introduce and study a new non Hermitian matrix-valued process built from truncations of Brownian motion on complex positive-definite matrices and of its inverse. We prove that its eigenvalue process is valued in $(1,+\infty)$ and that it forms a non-compact Jacobi particle system. Surprisingly, the same particle system occurs in \cite{BDW} in connection with Brownian motion on a non-compact complex Grassmann manifold. In this respect, we supply evidences showing that this occurrence holds true only at the spectral level and not on the corresponding matrix diffusions. We then study the large-size limit of our matrix model and prove results parallel to those obtained by the second author for the free Jacobi process.
Read the full abstract
Atmospheric and Oceanic Physics
Predictability-Guided Multiscale Probabilistic Forecasting of Wind Direction under Extreme Shear
Accurate multi-horizon wind direction forecasting is critical for turbine yaw control and grid security. Rapid directional shear (turning $\ge 90^\circ$) challenges models via non-Euclidean geometry on $S^1$, multiscale dynamics, and regime-dependent uncertainty. Conventional discrete models and foundation models suffer from mid-frequency phase lag and turning misalignments. We show that directional predictability decays at disparate rates across frequency subbands, rendering monolithic mechanisms suboptimal. We propose a predictability-guided paradigm: slow synoptic drift $\to$ deterministic regression; intermediate turning $\to$ continuous latent differential flows; unresolved turbulence $\to$ conditional residual diffusion; followed by causal recalibration. On a 10,000-sequence multi-year benchmark, our framework maintains calm-weather accuracy (Test MCE $38.48^\circ$) while reducing extreme-turning error (Case 1 MCE $60.69^\circ$ vs $70.42^\circ$ for zero-shot foundation models). The circular CRPS reaches $22.36^\circ$, with 93.88% coverage at nominal 95% (91.01% out-of-distribution). Density estimation further reveals near-antipodal bimodal structure under severe shear (13.39%–15.43% tail mass $\ge 135^\circ$), exposing a geometric bound where single-center calibration under-covers (81.56%), motivating multimodal circular manifold learning.
Read the full abstract
Logic in Computer Science
Vibe-Coded and Tuned: A State-of-the-Art SMT Solver for QF-LRA
This paper presents the SMT solver primo, which is fully vibe-coded and then parameter-tuned, achieving state-of-the-art results on linear real arithmetic (QF-LRA). The performance of primo is achieved by a systematic literature survey, repeated profiling, and parameter tuning. The resulting solver outperforms the winner of the QF-LRA track of SMT-COMP~2026. This confirms that vibe-coding of automated reasoning tools will enable us to make great strides in the future.
Read the full abstract
Robotics
The Robot Data Factory
Physical AI requires more than increasingly large robot datasets: intelligent robots acquire knowledge through continuous interaction with the physical world. We argue that the defining scientific resource of Physical AI is therefore not raw robot data alone, but robot experience - physically grounded interaction whose observations, actions, embodiment, context, and outcomes preserve the perception-action-consequence loop. We introduce the Robot Data Factory (RDF), a mission-driven infrastructure and methodology for continuously generating, validating, benchmarking, and reusing such experience. RDF organizes heterogeneous robots and environment-specific training grounds through reproducible missions, skill curricula, synchronized multimodal sensing, external ground truth, an agentic robot network, data pipelines, and living benchmarks. Rather than treating datasets as static end products, RDF implements a closed Deploy-Measure-Learn-Repeat cycle in which validated physical experience supports world models, vision-language-action models, embodied policies, digital twins, and subsequent robot deployment. We further formalize robot experience and its quality, introduce a mission-task-skill-episode-dataset-benchmark-capability hierarchy, and derive quantitative scaling laws and an algorithmic synthesis procedure connecting robot fleet size, sensor rates, storage, learning representations, tokenization, training compute, inference, and latency to Embodied-AI cluster requirements. The framework is instantiated in three complementary physical training grounds for domestic, environmental, and energy applications. RDF thus reframes robot data generation as a continuous scientific production process and provides a pathway toward reproducible, scalable, and eventually federated infrastructure for Physical AI.
Read the full abstract
Analysis of PDEs
Point vortex dynamics in quasi-periodic channels: transporting trajectories and ergodic distribution of equilibria
We study the dynamics of a single point vortex in an unbounded planar channel whose interfaces are quasi-periodic in the longitudinal direction. The motion is governed by the Robin function. We introduce a hull formulation that lifts the quasi-periodic geometry to a periodic problem on a finite-dimensional torus and yields an exact quasi-periodic representation of the Robin function. Under a natural transversality condition, we construct global quasi-periodic invariant graphs describing transporting vortex trajectories and show that a full neighborhood of each boundary component is foliated by such graphs. Under a Diophantine condition on the spatial frequencies, the dynamics along each graph can be straightened to a constant drift, so that the vortex motion is quasi-periodic modulo translation. A central contribution concerns the distribution of vortex equilibria. In the quasi-periodic setting, where no fundamental spatial cell exists, we identify critical points of the Robin function with crossings of a hypersurface by a Kronecker flow on the hull torus. Exploiting unique ergodicity, we establish a general zero-counting theorem, allowing finite-order tangencies, which yields an explicit geometric flux formula for the asymptotic density of critical points and their limiting phase distribution. The result is nonperturbative once the critical hull is constructed. Explicit periodic and quasi-periodic models reveal bifurcations and phase transitions in the critical-point distribution, while numerical computations provide quantitative validation of the analytical results.
Read the full abstract
Optimization and Control
Stability Analysis of Generalized Multi-Source Weber Problems
This paper presents a stability analysis of the generalized multi-source Weber problems under the influence of data perturbation within the framework of the Minkowski function. First, we establish explicit Lipschitz constants for the objective functions and optimal value functions. Then, we prove several properties of the global optimal solution sets. Furthermore, we provide sufficient conditions for the upper semicontinuity of global solution mappings and the inner semicontinuity of local solution mappings. Three illustrative examples are constructed. Our results give indirect answers to several open questions regarding the stability of local optimal solution mappings of the optimization problems discussed.
Read the full abstract
Number Theory
Iwasawa theory of (directed) Cayley graphs
In this article, we prove the Defect Conjecture for Cayley graphs of abelian groups, dihedral groups, and groups of the form $\mathbb{Z}/p\mathbb{Z} \rtimes \mathbb{Z}/(p-1)\mathbb{Z}$ where $p\geq 3$ is a prime. We also compute the Iwasawa invariants of the Bowen–Franks groups associated with these graphs in several cases.
Read the full abstract
Commutative Algebra
Annihilator Multiplication Modules: Ring Characterizations and Constructions
An $A$-module $E$ is annihilator multiplication if the annihilator of each element equals that of $IE$ for a finitely generated ideal $I$. We characterize rings for which every faithful module has this property as the commutative quasi-Frobenius rings, and rings for which every module has the property as the Artinian principal ideal rings. Both characterizations reduce to two-generated modules. Over a reduced ring with finitely many minimal primes, faithful annihilator multiplication modules are exactly the regular-torsion-free modules, and principal ideals suffice in the definition. An ascending chain condition on annihilator ideals gives finite detection of the module annihilator, yielding localization and graph rigidity results. We also prove equality of associated primes with those of the faithful quotient and establish projective tensor and trace characterizations. Over local square-zero rings, the property is equivalent to nonsingularity of a bilinear multiplication map. A projective dimension argument gives a sharp length bound, attained by explicit faithful indecomposable nonprojective modules whose endomorphism rings are computed. Every cyclic submodule of these examples embeds in the ring, although the whole module is not torsionless. Support, hereditary torsion, and amalgamation criteria connect these structural results with further module constructions.
Read the full abstract
Number Theory
Triple divisor type functions in arithmetic progressions to prime power moduli
We study the equidistribution in arithmetic progressions modulo powers of a fixed odd prime of Hecke eigenvalues of noncuspidal $\mathrm{GL}_3$ automorphic forms, with a focus on the convolution coefficients $\lambda_{1\boxplus f}(n)=(\lambda_f\star 1)(n)$,attached to a level $1$ holomorphic primitive cusp form $f$. Utilizing techniques introduced by Kowalski–Lin–Michel and Milićević, we prove the exponent $\vartheta=1/2+7/458-\varepsilon$ is admissible.
Read the full abstract
Number Theory
Laurent series expansions for the Barnes multiple zeta function
We study the Laurent coefficients of the Barnes multiple zeta function with complex parameters in a common open half-plane and a fixed holomorphic determination of the logarithm. At the highest pole, we derive explicit limit formulae for every regular Laurent coefficient in terms of finite multiple sums and logarithmic correction terms. At the lower possible poles, we establish all-order relations with the Taylor coefficients at the origin and their parameter derivatives. We also determine the large-order behavior by subtracting all principal parts. The remaining function is entire, so Cauchy's estimate separates explicit residue contributions from a remainder that decays faster than any fixed geometric rate. The neighboring residues yield the limiting even and odd subsequences, with vanishing residues and cancellations accounted for. The constant-term cases recover known finite-part representations; the main focus is their extension to higher Laurent coefficients.
Read the full abstract
General Relativity and Quantum Cosmology
At Most One Inner Killing Horizon in Stationary Black Holes
Stationary-axisymmetric black holes are the standard theoretical framework for astrophysical black holes, yet their interiors remain largely inaccessible: the absence of a hypersurface-orthogonal timelike Killing vector renders the metric non-diagonal, and frame dragging obstructs the usual techniques for probing the interior. We prove that any stationary-axisymmetric black hole satisfying the classical energy conditions contains at most one nondegenerate inner Killing horizon per connected interior branch, irrespective of its matter content. For compact horizon sections, we apply the Raychaudhuri equation to the congruence normal to constant-time hypersurfaces: the strong energy condition makes the squared lapse subharmonic, and the maximum principle excludes a second inner horizon. For noncompact planar and hyperbolic sections central to holography, the null energy condition instead yields a monotonicity obstruction through a geometric flow we introduce here, the “inverse lapse flow,” whose weak continuation via viscosity solutions we also construct. The attractive nature of gravity, encoded in these energy conditions, thus both drives horizon formation and caps the number of inner horizons, revealing a striking dual role of the same focusing mechanism.
Read the full abstract
Robotics
World Models for Embodied Intelligence: From Plausible to Controllable to Actionable
World models connect perception and decision-making in embodied intelligence by maintaining hidden state, anticipating consequences, comparing interventions, and adapting when execution departs from expectations. Although progress is often measured by visual fidelity, their value lies in improving behavior. Before reaching for a cup, a person anticipates its weight and resistance to grasping, shaping the hand before contact. Such anticipation is coarse and rarely pictorial, yet it guides action. This raises a central question: which predictive capabilities improve behavior? Existing surveys, organized by architecture, output modality, or application domain, leave this question implicit. We introduce three progressively stronger capability levels: Plausible models preserve task-relevant temporal, geometric, or physical structure; Controllable models additionally predict how interventions alter that structure; and Actionable models translate predictions into measurable gains in planning, action, learning, evaluation, verification, recovery, or data selection. We complement this hierarchy with a 3 x 4 matrix crossing geometry, physics, and action grounding with improvement loops centered on data, rewards, policies, and the model itself. Using this framework, we survey manipulation, navigation, locomotion, autonomous driving, and general embodied learning, tracing technical progressions, clarifying capability requirements, and examining datasets, benchmarks, and evaluation protocols. We identify challenges in long-horizon consistency, uncertainty calibration, causal intervention testing, latency, verification and recovery, and cross-embodiment transfer. This perspective shifts evaluation from visual plausibility toward whether predictions capture task-relevant state, reflect intervention effects, and improve the closed-loop behavior of embodied agents.
Read the full abstract
Robotics
IL-ACT: Imitation Learning with Adaptive Cartesian Tracking Control for a 30-ton Excavator
Autonomous excavator control is challenged by coupled kinematics, actuation lag, and uncertainty. We propose imitation learning and adaptive Cartesian tracking (IL-ACT), a novel motion control framework for a 30-ton-class excavator. An anchored, 14-input imitation policy pretrained on operator demonstrations generates nominal joint rates; adaptive Cartesian feedback and gated gain/bias estimation correct these commands before a stopping-distance governor constrains joint-reference generation. Simscape evaluation covers 100 sequential goals and spiral, figure-eight, and rounded-raster tracking, including 88 additional runs across three training seeds, two initializations, and speeds, under hydraulic response and sensing conditions. Compared with Teacher+ACT, IL-ACT completes all goals with shorter duration and lower terminal errors under both response conditions. Telemetry-initialized IL-ACT lowers RMSE in all 24 figure-eight and rounded-raster seed comparisons and lowers additional-load spiral mean RMSE by approximately 29%. Original spiral RMSE also improves over IL-only and PID. Under a shared sensor-noise realization, telemetry-initialized IL-ACT achieves 27.67% lower mean RMSE than Teacher+ACT; enabling estimation reduces mean RMSE by $22.44\%$ relative to the frozen estimator. Pretrained-weight effects remain mixed, and the original teacher comparison exhibits a spiral RMSE–maximum-error tradeoff. Analysis establishes bounded adaptive states and Cartesian feedback, with reference admissibility conditional on governor feasibility.
Read the full abstract
Computer Vision
MAETrack: Unleashing the Potential of Pretrained Geometric Priors for 3D Single Object Tracking
Large-scale pre-training has transformed representation learning in 2D vision, yet its transferability to 3D single object tracking (SOT) remains insufficiently understood. Directly fine-tuning self-supervised 3D encoders, such as masked autoencoders (MAE), often leads to sub-optimal adaptation because the reconstruction objective is not fully aligned with the spatial-temporal matching requirements of tracking. In this paper, we observe that this difficulty can be interpreted as a layer-wise transfer mismatch: shallow layers tend to preserve transferable geometric cues, while deeper layers become increasingly specialized to the reconstruction pretext task and are less suitable for downstream tracking. Based on this observation, we propose MAETrack, a lightweight adaptation framework for transferring pre-training MAE representations to 3D SOT. MAETrack includes Layer-Selective Initialization (LSI), which initializes only the shallow stages of the tracking backbone from pre-trained weights while re-initializing deeper stages, and Geometric Residual Gating (GRG), which reinforces structurally salient regions in the search BEV features before template-search fusion through residual spatial modulation. Extensive experiments on standard 3D SOT benchmarks show that MAETrack consistently improves upon vanilla fine-tuning baselines with limited computational overhead. More broadly, our results suggest that effective transfer from 3D reconstruction pre-training to 3D tracking is not merely a matter of partial fine-tuning, but depends on a tracking-oriented transfer principle that preserves shallow geometry while adapting deeper representations to the downstream objective.
Read the full abstract
Cryptography and Security
Toward Secure AI-Powered Penetration Testing Agents: Security Threats, Guardrails, and Architectural Perspectives
LLM-powered autonomous agents are transforming the penetration testing space with dynamic, multi-step offensive security workflows that require minimal supervision by humans. These agents leverage sophisticated reasoning abilities and external security tools to independently carry out reconnaissance, identify vulnerabilities, devise exploitation plans, and perform post-exploitation operations. But the ability to have persistent memory, to take actions in the real world, and to do long-horizon reasoning raises qualitatively different security concerns than traditional chat-based LLM systems. Existing guardrail mechanisms for conversational AI may not be sufficient to secure autonomous AI pentesting agents accordingly. To address these issues, we carry out a comprehensive security analysis on autonomous AI-penetration testing agents. We systematically analyse representative agent architectures, characterise their trust boundaries and attack surfaces and propose a threat taxonomy that is aligned with the lifecycle and covers LLM lifecycle attacks, agent-architecture attacks and cross-cutting behavioural attacks. We analyse the limitations of existing guardrail mechanisms, identify key research gaps, and discuss future research directions for developing specialised, context-aware, and architecture-aware guardrails to secure next-generation AI-driven offensive security systems.
Read the full abstract
Algebraic Geometry
Cartan-Fejer Gram Tomography and Flop Covariance for BPS Resummed Gromov-Witten Potentials
We introduce a matrix-valued finite difference formalism for the genus zero BPS resummed local Gromov-Witten potential of a threefold flop. Factoring the central difference as \[ \Delta_\eta=\nabla_\eta^2, \qquad \nabla_\eta=T_{h\eta/2}-T_{-h\eta/2}, \] we prove that the mixed differences \( \mathbf H=(\nabla_{\eta_i}\nabla_{\eta_j}F)_{i,j} \) admit an exact rank one signed \(q\)-Gram decomposition. Primitive BPS classes are therefore detected by rank one coefficient matrices, and a matrix-valued Möbius inversion reconstructs all multiplicities on a primitive ray. Under a simple threefold flop the Gram forcing is covariant away from the flopped ray and acquires the universal logarithmic anomaly \[ \kappa_C(C^+\otimes C^+)\log r, \qquad \kappa_C=\sum_{d\ge1}d^3n_{dC}. \] After a natural renormalization it becomes flop covariant, while one classical logarithmic derivative recovers the cubic correction in the crepant transformation formula. We interpret \(\kappa_C\) as the third moment of the GV width distribution: Toda's noncommutative width is the second moment, and contraction algebra BPS invariants give a finite cohomological width series whose numerical realization contains all these moments. For root supported BPS theories, simple root Gram coefficients reconstruct the signed Cartan matrix. Applied to the standard ADE foldings, the theory distinguishes \(B_n\) from \(C_n\), detects the \(F_4\) double bond and \(D_4\) triality, and yields explicit global \(q\)-Gram discriminants.
Read the full abstract
Optics
In-Situ Quantum Optical Measurement for Colloidal Quantum Dots Confined in an Optical Trap
While optical manipulation of atomic arrays has reached a high degree of precision and scalability, the stable optical confinement of solution-based artificial atoms like colloidal quantum dots (CQDs) remains hindered by weak trapping forces and thermal fluctuations. High-intensity trapping often compromises the quantum properties of these emitters, creating a significant trade-off between mechanical stability and optical integrity. To overcome this, we propose encapsulating CQDs within a transparent polymer matrix, thereby increasing the effective interaction volume and optical restoring force without altering the emitters themselves. This strategy allows for stable spatial confinement under standard experimental conditions, as evidenced by the direct resolution of positional fluctuations through photoluminescence imaging and trajectory tracking. With averaged position fluctuations below 20 nm, the intrinsic emission spectra and photoluminescence decay dynamics remain largely unaffected, and photon-correlation measurements confirm the full preservation of single-photon emission. These findings establish a robust method for the controlled confinement of colloidal quantum emitters and in-situ quantum-optical measurements for future advancements in quantum-optical manipulation of artificial atoms.
Read the full abstract
Signal Processing
Ambiguity Function Analysis of OFDM Signals With Pilots and Data Payloads
Practical orthogonal frequency division multiplexing (OFDM) communication frames contain both deterministic pilots and random data payloads, motivating the joint ambiguity function (AF) analysis of the two components when the entire frame is reused for integrated sensing and communication (ISAC). This paper characterizes two discrete AF formulations for different Doppler regimes, namely the discrete periodic AF (DP-AF) and fast-slow-time AF (FST-AF), and derives closed-form expressions for their expected squared values. For the FST-AF, the expected sidelobe level (ESL) is uniform over the delay-Doppler plane and depends only on the pilot count, constellation kurtosis and total number of time-frequency resources, but not on the pilot symbols or pattern. For the DP-AF, we establish attainable lower and upper ESL bounds and show that no pilot design can minimize all sidelobes simultaneously. We further prove that attaining the lower bound at non-zero Doppler requires a periodic pilot pattern, while equally spaced chirp pilots, including Zadoff-Chu (ZC) sequences, maximize the numbers of sidelobes attaining the lower and upper bounds simultaneously. Two representative ZC pilot patterns widely encountered in communication frames are then examined: contiguous placement produces delay-Doppler ridges described by squared Dirichlet kernels, whereas equally spaced placement generates periodic peak-and-notch structures. Both regular patterns exhibit pronounced high sidelobes, suggesting that communication-oriented pilot patterns should be re-designed for delay-Doppler estimation in the context of ISAC. Numerical results validate the analysis and show that irregular pilot placement can suppress high sidelobes and improve target estimation performance.
Read the full abstract
Computer Vision
Efficient 3D Whole-Body PET Image Denoising via Conditional Rectified Flow With Optimized Sampling Strategy
Reducing radiation exposure in Positron Emission Tomography (PET) is important for patient safety; however, ultra-low-dose imaging suffers from severe noise, which may affect diagnostic interpretation without appropriate image enhancement. While current 3D deep generative models, particularly diffusion models, have shown strong reconstruction fidelity, their practical use can be limited by long inference times. In contrast, faster 2D-based alternatives may have difficulty maintaining volumetric consistency, an important consideration for whole-body PET imaging analysis. To bridge this gap, we propose a one-pass conditional 3D rectified flow (3D Flow) framework for whole-body PET image denoising that incorporates a novel optimized non-uniform sampling strategy. The model is trained with a one-pass linear-interpolant velocity-matching objective. This approach reconstructs a full 3D volume in approximately 30 seconds in our implementation, compared with multi-hour inference for the evaluated 3D DDPM baseline. Evaluations including zero-shot transfer to an independent clinical dataset show that our model achieves favorable global image quality and lesion conspicuity compared with the evaluated 3D DDPM and DDIM baselines, including on challenging short-acquisition data. Furthermore, the proposed method shows promising zero-shot transfer performance across the evaluated datasets and unseen dose levels (down to 1/100 of the standard dose), with artifact-focused visual comparisons supporting the need for further lesion-level validation. By balancing reconstruction fidelity and computational efficiency, this work presents a candidate approach for ultra-low-dose whole-body PET image denoising.
Read the full abstract
Computer Vision
Efficient Quantization-Aware Distillation with Cross-Modal Alignment for Edge Vision-Language Models
Large-scale vision-language models (VLM) such as CLIP enable strong open-vocabulary reasoning, yet deploying these capabilities on resource-constrained edge devices remains challenging. EdgeVL addresses this problem by distilling CLIP representations into lightweight multi-modal encoders and applying quantization-aware training (QAT) for efficient Open-Vocabulary Classification (OVC) on edge hardware. However, its two-stage optimization applies different objectives for distillation and QAT, and contrastive learning is performed within the quantized student space, which can result in inconsistent optimization and reduced training efficiency. Moreover, identical supervision across RGB and non-RGB modalities may lead to modality imbalance. We propose a unified framework for quantized semantic distillation tailored to edge deployment. By jointly optimizing distillation and quantization within a unified teacher-anchored framework, our method ensures consistent training under quantization, suppressing hard negatives and enlarging decision margins. Additionally, we design a lightweight cross-attention adapter that enhances non-RGB representations through RGB-guided semantic transfer, narrowing the modality gap. Extensive experiments demonstrate consistent improvements on non-RGB modalities while maintaining deployment efficiency.
Read the full abstract
Astrophysics of Galaxies
Probing the All-sky Distribution of Soft X-ray Emission Associated with the Milky Way
We present an all-sky analysis of soft X-ray emission associated with the Milky Way using HaloSat and ROSAT data, extending our previous study of five Galactic-plane regions to 330 fields across the sky. We performed uniform spectral fitting with a model including an unabsorbed Local Hot Bubble and two additional absorbed thermal components, representing emission from warm-hot and hot plasma, while accounting for solar wind charge exchange and the cosmic X-ray background. The warm hot component is often interpreted as emission from the circumgalactic medium, whereas the origin of the hot component remains uncertain. Individual-field fits generally favored the inclusion of the hot component, and the field-to-field temperature distributions had medians of kT = 0.19 and 0.74 keV, with 16th-84th percentile ranges of 0.17-0.21 and 0.61-0.90 keV, respectively. The corresponding 16th-84th percentile EM ranges were (1.0-8.2) x 10-2 and (0.5-4.1) x 10-3 cm-6 pc. Stacked spectra from fields within 60 deg. <= l <= 180 deg. supported the individual-field results. After excluding bright X-ray sources and large-scale Galactic structures, we modeled the EM distributions of 178 fields using a hybrid spatial framework comprising stellar emission and disk-like and halo-like diffuse-plasma components. The warm-hot emission was described mainly by the disk-like term, whereas the hot emission was described mainly by stellar emission with an additional halo-like term. These results support a widespread two temperature description and suggest a composite origin for the hot emission.
Read the full abstract
Human-Computer Interaction
NephoCodex: Exploring Bounded Material Agency in Weather Data Physicalization
Weather is a complex, continuously changing system in which uncertainty is intrinsic. Physicalizing this uncertainty introduces further variation because computational outputs cannot fully determine material behavior. We distinguish computational uncertainty from material variability and introduce bounded material agency: computation constrains material realization without fixing its exact appearance. We present NephoCodex, a data physicalization system informed by a formative study that constructs five artistic weather states and predicts probability distributions over them. Probability-weighted mappings translate these distributions into material control proposals, while entropy-based regulation, local sensing, and safety constraints bound their execution through mist, airflow, light, and transparent displays. A within-participant study found increased spatial presence and physical demand, while perceived data comprehensibility remained inconclusive after correction. These findings contribute to hybrid data physicalization by showing how variable material expression can be paired with stable digital annotations and how embodied experience can be evaluated separately from data comprehension.
Read the full abstract
Robotics
Differentiable Mesh State Estimation via Factor Graph Inference for Deformable Object Reconstruction
Estimating deformable object states remains a fundamental challenge in robotics and simulation. We propose a novel factor graph-based framework for probabilistic mesh state estimation of deformable objects. The method directly updates a tetrahedral mesh, a rich and physically-grounded representation of an environment, by combining physics priors, noisy sensor measurements, and temporal smoothness constraints within a unified probabilistic formulation. The estimation problem is posed as a nonlinear least-squares optimization and solved using Levenberg-Marquardt. Ex vivo central-airway obstruction experiments and simulations on deforming cube models demonstrate reliable and accurate reconstruction under both rigid motion and deformation, highlighting the potential of this probabilistic approach for principled, measurement-driven mesh state estimation in deformable object reconstruction.