Distributed Computing
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Tuesday 1 September
In the application of incomplete Cholesky preconditioning to the incomplete Cholesky-conjugate gradient (ICCG) method, forward and backward substitutions exhibit sequential dependencies that constitute a major bottleneck for parallelization in multicore environments. To alleviate this bottleneck, the algebraic block multi-coloring (ABMC) method achieves both parallelism and data locality through block-wise coloring. However, ABMC requires the number of blocks to be specified as an input parameter in advance. This study evaluates the Leiden method as an alternative blocking approach for parallel preconditioning in the ICCG method. As a community detection technique that maximizes a quality function for graph partitioning, the Leiden method automatically generates blocks that reflect the matrix structure without requiring the number of blocks a priori. We partition the adjacency graphs of sparse matrices using the Leiden method and utilize the resulting blocks for parallel preconditioning. We implement the Leiden method using modularity and the constant Potts model as quality functions and compare its performance with that of the ABMC method in terms of the number of iterations, execution time, and L2 cache efficiency across eight symmetric positive definite matrices. The experimental results demonstrate that the Leiden method with the constant Potts model achieves performance comparable to that of the ABMC method configured with an optimized number of blocks.
Number Theory
Distribution of Kaneko's val function
Kaneko's val function is defined as the normalized cycle integral of the elliptic modular $j$-function along closed geodesics on the modular surface. We prove that, when primitive hyperbolic conjugacy classes are ordered by geodesic length, its values concentrate at the single point 720. More generally, an analogous concentration result holds for every weakly holomorphic modular function $f$ of weight 0, with the concentration point given by Atkin's inner product $(f, 1)_{\mathrm{At}}$. The proof combines an equidistribution theorem following Pollicott with the ergodicity of a continued-fraction suspension flow and uses the decomposition formula of Bengoechea-Imamoḡlu to construct a bounded continuous observable.
Read the full abstract
Signal Processing
Delay-Doppler Sensing Performance Analysis for MIMO-OFDM ISAC Systems
In communication-centric integrated sensing and communication (ISAC), delay-Doppler sensing reuses data-bearing orthogonal frequency division multiplexing (OFDM) signals rather than dedicated radar probing waveforms. Consequently, the resulting range-Doppler map (RDM) is shaped not only by target parameters, but also by communication-symbol randomness and, in multi-antenna transmissions, by spatial beamforming. While existing analyses have largely focused on single-antenna OFDM-ISAC, the delay-Doppler sensing behavior of multi-antenna OFDM-ISAC remains insufficiently understood. This paper analyzes a multi-input multi-output (MIMO)-OFDM-ISAC system in which multiple data streams jointly illuminate a sensing target. We derive second-order moment expressions for the RDM under matched filtering (MF) and reciprocal filtering (RF), and use them to characterize the dynamic range (DR). The analysis reveals two key multi-stream effects. First, under MF, the random superposition of multiple beamformed streams creates an additional RDM floor beyond the modulation-dependent and receiver-noise terms; therefore, constant-modulus signaling no longer eliminates the data-induced pedestal as in single-antenna OFDM-ISAC. Second, under RF, the matched-angle data-induced floor is removed, but the noise floor is amplified according to the reciprocal-power statistics of the beamformed target illumination. These results show that the user-target angular geometry directly governs the MF/RF tradeoff: MF is more robust under weak illumination, whereas RF can achieve a higher DR when reciprocal-noise amplification is mild. Numerical results validate the analysis and demonstrate the distinct geometry-dependent behaviors of MF and RF.
Read the full abstract
High Energy Physics (Theory)
Iso-$\mu/T$ holographic entropy and its attractor for a strongly coupled quantum fluid
Numerical evidence has shown that a period of vanishing entropy production during far-from-equilibrium stages induces subsequent violations of the dominant energy condition in strongly coupled plasmas. This behavior also appears to hold for a Bjorken-expanding, hot and dense strongly coupled quantum fluid. In this context, it has been established that the chemical potential-to-temperature ratio ($\mu/T$) in the medium increases with higher initial charge density, $\rho_0$, and/or lower initial energy density, $\varepsilon_0$. Here, we present a numerical method to evolve Bjorken R-charged plasmas by varying $(\varepsilon_0,\rho_0)$ in order to generate a curve that preserves a constant $\mu/T$. This allows us to address the case in which all Bekenstein-Hawking entropy densities evolve towards configurations with the same $\mu/T$. This approach enables a more direct comparison with the $\mathcal{N}=4$ SYM plasma case ($\mu/T=0$) and, consequently, provides clearer evidence of the correlation between entropy production and violations of the dominant energy condition. Moreover, this procedure offers a characterization (albeit numerical and partial) of the iso$-\mu/T$ entropy density hydrodynamic attractor for hot and dense strongly coupled quantum fluids.
Read the full abstract
Group Theory
Accessible CAT$(-1)$ groups of critical exponent less than one
Let $X$ be proper CAT$(-1)$ and let $\Gamma\le\Isom(X)$ be finitely generated and discrete. The sharp structural theorem states that, if $\Gamma$ is accessible over finite subgroups and $\delta_X(\Gamma)<1$, then $\Gamma$ is geometrically finite and virtually free, has a finite graph of groups with finite edge groups and virtually cyclic infinite vertex groups, and $\partial\Gamma\to\Lambda_\Gamma$ collapses exactly their conjugate two point boundaries. The result is hereditary, and below $1/2$ every finitely generated subgroup is convex-cobounded (\cref{thm:accessible-main}). Hence non-virtually-free accessible groups have $\delta_X(\Gamma)\ge1$ (\cref{cor:accessible-gap}). Consequences cover finitely presented groups, groups with uniformly bounded finite-subgroup orders, characteristic-zero linear groups, and Kleinian groups, also infinite parabolic-free Kleinian groups have finite-index classical Schottky subgroups (\cref{cor:accessibility-extension,cor:linear-groups,cor:kleinian-classical}). Hence we cover substantial larger class than \cite{LiuWang2023},\cite{Hou2001}, also see \cref{rem:strictness-sharpness}. Finally, we also state consequences for finite JSJ representatives and hierarchies (\cref{thm:JSJ,thm:hierarchy,cor:hierarchy-dimension}).
Read the full abstract
Differential Geometry
Higgs-Demailly System and Positivity of Higgs Bundles
We prove that the Higgs–Demailly system on a compact Riemann surface admits, for suitable fixed parameters, a smooth admissible solution at its terminal parameter if and only if the Higgs bundle is H-ample. Here H-ampleness is understood in the modified sense of Biswas–Misra–Ray. In particular, the argument gives an analytic proof of the equivalence between this H-ampleness and Griffiths-positive Hitchin–Simpson curvature. The proof extends the Demailly–Pingali–Murakami approach using a priori estimates and Leray–Schauder degree theory. The missing scalar lower bound follows from a Higgs-compatible quotient construction: a blow-up sequence produces a nonzero Higgs quotient of nonpositive degree, contradicting H-ampleness.
Read the full abstract
Robotics
Potential-Guided Particle Steering for Negation-Constrained Dexterous Grasping
Language-driven dexterous grasp models, such as DextER, perform well when instructions specify where to grasp, but we find they fail systematically when an instruction also specifies where not to grasp (e.g., "grasp the handle but avoid the body"). Existing training corpora, DexGYSNet among them, contain virtually no avoidance instructions, and collecting examples for every possible constraint is impractical. Moreover, because every part mentioned during training denotes a contact target, models may interpret a forbidden part as another region to grasp rather than one to avoid. We therefore introduce an inference-time framework for negation-constrained dexterous grasping that requires no negation-specific training examples. Combining Sequential Monte Carlo with classifier-free guidance, our method guides sampling toward the instructed part while pruning candidates headed for the forbidden region, without any negation examples during training. A frozen 3D part-grounding model localizes the forbidden region from the language instruction. To evaluate this setting, we construct NegGrasp, a benchmark of paired positive/negative instructions with constraint-aware metrics that credit a grasp only if it both accomplishes the task and respects the stated constraint. On NegGrasp, our method reduces the violation rate of the strongest baseline from 57.9% to 17.2% while improving both constraint-aware and physical success.
Read the full abstract
Operator Algebras
Operator-valued maximal $f$-divergences for completely positive maps
We introduce an operator-valued maximal $f$-divergence for completely positive (CP) maps between von Neumann algebras, associated with an operator convex function $f$ on $(0,+\infty)$. The construction takes values in the extended lower-semibounded self-adjoint part of the codomain von Neumann algebra. We prove independence of the common CP upper bound used in its computation, joint subadditivity, monotonicity under unital precomposition and normal postcomposition, a martingale convergence theorem for normal CP maps, and joint lower semicontinuity in the point-$\sigma$-weak topology. For normal positive functionals, our construction recovers Hiai's maximal $f$-divergence. As a consequence, we establish its joint weak lower semicontinuity for arbitrary von Neumann algebras, answering a question left open by Hiai. For $\eta(t)=t log t$, we obtain an operator-valued Belavkin–Staszewski (BS) relative entropy. Moreover, for normal channels with $\sigma$-finite codomain, we prove that the BS channel divergence of Hollands and Ranallo coincides with the extended norm of our operator-valued divergence. Finally, we give finite-dimensional examples and obtain an explicit formula for a finite-index conditional expectation. In the BS case, this formula reduces to the logarithm of the Jones–Kosaki index.
Read the full abstract
Numerical Analysis
Spectral Bounds for Kernel Quadrature
A bottleneck in the theory of kernel methods in machine learning is the storage requirement. To ameliorate this, a standard trick is to replace the kernel with an explicit feature map. Perhaps, the most well known example is the Gaussian kernel which can be expressed in terms of the Fourier features. Analytically, the kernel $K$ can be expressed in terms of an integral expression that involves a possibly asymmetric kernel $G$ representing the feature map. Numerically, one needs to approximate this integral by a suitable numerical integration scheme, typically Monte Carlo. In this paper, we demonstrate that the eigenvalues of $K$ are approximated much better by the eigenvalues of the kernel obtained by discretizing the integral using suitable quadrature formulas instead. We illustrate this fact in the case of the Gaussian kernel and neural tangent kernels on the unit sphere of a four-dimensional Euclidean space corresponding to the sigmoid and ReLU activation functions.
Read the full abstract
Machine Learning
Manifold-Aware General Coded Computing for Straggler-Resilient Distributed Computing
Existing coded-computing designs do not explicitly exploit the intrinsic structure of the input data. In communication systems, statistical structure and redundancy are often removed through source coding (or compression) before channel coding is applied. This principle, however, does not transfer directly to coded computation. In many computational tasks, particularly in machine learning, the structure of the data is precisely what the computation seeks to exploit to infer outputs or learn meaningful patterns. Consequently, coded-computing schemes should preserve and leverage this structure in their code design, rather than ignoring or eliminating it through source coding. This observation motivates a different perspective on code construction. In many channel-coding schemes, such as Reed-Solomon codes, coded symbols are generated by evaluating a low-dimensional algebraic representation at selected points. In contrast, many high-dimensional datasets naturally concentrate near low-dimensional manifolds. In this paper, we exploit this intrinsic geometry by designing coded samples that follow the natural manifold of the data, rather than imposing an artificial low-dimensional structure unrelated to the data distribution. Inspired by graph-based manifold learning, we propose a manifold-aware encoding strategy for general coded computing (GCC). Experiments on neural network inference and high-dimensional polynomial evaluation demonstrate that the proposed strategy consistently and significantly reduces the mean squared recovery error under straggling compared with standard GCC.
Read the full abstract
Computation and Language
EM^2Mem: Event-Centric Multimodal Memory for Large Language Models
Multimodal memory offers a scalable interface for long-video question answering, but existing methods often retrieve captions, frames, transcripts, summaries, or graph facts as isolated fragments. Although searchable, such fragments are not generation-ready: language models must reconstruct cross-modal and temporal alignments at inference time, when context is limited and attribution is difficult. We propose EM^2Mem, an event-centric multimodal memory framework that binds heterogeneous evidence to event anchors during memory construction. Each event-indexed memory cell aligns multimodal records, temporal context, graph-linked relations, semantic facts, and provenance, enabling compact evidence readout over grounded multimodal events rather than modality-specific fragments. Across three long-video QA benchmarks, EM^2Mem improves average accuracy over the strongest memory baseline by 2.0, 2.4, and 3.7 points, improves strict event-level Top-5 evidence recall by 7.0 points, and reduces per-query latency by 4.67 times and total inference tokens by 63.66% (The code will be integrated into https://github.com/zjunlp/LightMem).
Read the full abstract
Computation and Language
Same Semantics, Different Outcome: On the Modality Robustness of Multimodal LLMs under Knowledge Conflict
Multimodal large language models (MLLMs) are increasingly provided with contextual evidence in heterogeneous forms: as a text passage, as a rendered image of the same passage, or as both together. However, it remains unclear how consistently these surface forms are processed, especially when the evidence conflicts with the model's parametric knowledge. We study modality robustness under knowledge conflict across 13 MLLMs and two datasets, and find them far from robust. (1) Contrary to common belief, models favor a context that contradicts parametric knowledge more readily in image form than in text form; (2) when a contradicting text and image are presented together, the preferred modality is essentially arbitrary, varying with input order, model, and dataset. We further demonstrate that this instability has practical consequences: it degrades performance in multimodal RAG and can be exploited by adversarial attacks. To alleviate this brittleness, we examine several simple techniques—prompting, steering, supervised fine-tuning (SFT), and direct preference optimization; the majority prove ineffective, whereas SFT achieves moderate success. We therefore call for greater awareness of this inconsistency and argue that it is fundamental, demanding attention at multiple training stages.
Read the full abstract
Computation and Language
Skill Following: Evaluating Actual Skill Use in Retrieval-Enabled LLM Agents
Large Language Model (LLM) agents increasingly rely on external skills, yet standard evaluations obscure whether retrieving these skills actually helps. Aggregate metrics often compare retrieved versus non-retrieved tasks, introducing severe selection bias and failing to isolate the true effect of skill use. To measure this actual-use capability-which we formalize as Skill Following (SF)-we introduce the Retrieval-Invoked Actual-Use Effect (RAE). RAE computes the same-task outcome difference between matched skill-enabled and skill-disabled executions, conditioned exclusively on tasks where the agent actively retrieved a skill. Evaluating 17 LLMs across coding and mathematical domains, we uncover a stark evaluation paradox: models frequently show positive aggregate retrieval lift but negative RAE. On MBPP+, multiple models that appear to benefit system-wide actually harm their own performance on the exact tasks where retrieval occurred. These findings demonstrate that aggregate averages can create a misleading illusion of tool-use proficiency, whereas RAE directly measures whether the retrieval-to-answer pipeline genuinely rescues more outcomes than it harms.
Read the full abstract
Databases
Time-Decayed Vector Search in the Rhythm of TANGO: Jointly Modeling Semantic Similarity and Temporal Freshness
Vector search typically measures relevance through semantic similarity under a fixed scoring function. However, in a growing range of applications, relevance may evolve over time, making temporal freshness an additional signal beyond semantic similarity. In this paper, we formalize time-decayed vector search (TDVS), which incorporates continuous temporal decay into the search objective so that relevance is jointly determined by semantic similarity and temporal freshness. We design Score-Preserving Temporal Reduction (STR) that enables existing Maximum Inner Product Search indexes to directly support TDVS. We further present Chronos, a TDVS-native framework that derives an exact metric formulation and introduces Query-Orthogonal TimeLift to control data–data geometry while preserving all query–data scores and rankings. Building on Chronos, we propose TANGO, a hierarchical graph index that adopts layer-specific TimeLift geometries to preserve temporal locality at the base layer while strengthening long-range semantic connectivity in upper layers. TANGO traverses the hierarchy using the exact TDVS score, caches temporal factors to reduce computation, and supports efficient online insertion. Extensive experiments show that TANGO achieves up to 3.5$\times$ higher query throughput and 4.05$\times$ faster index construction than state-of-the-art graph-based competitors. TANGO also maintains its advantage over all competitors across diverse temporal settings and enables efficient online insertion, demonstrating its robustness and practicality.
Read the full abstract
Systems and Control
A Bayesian Adaptive Spectral Surrogate Model for Efficient Probabilistic Optimal Power Flow Evaluation
This paper presents an adaptive stochastic spectral embedding (ASSE) method to solve the probabilistic AC optimal power flow (AC-OPF), a critical aspect of power system operation. The proposed method can efficiently and accurately estimate the probabilistic characteristics (e.g., mean, variance, median, and quantile-based metrics) of AC-OPF solutions while minimizing power losses. Based on estimated AC-OPF decisions (i.e., generator outputs), the confidence interval (CI)-based production cost index can be determined. Specially, an adaptive domain partition strategy is adopted to guide refinement domain selection and partition. The Bayesian compressive sensing-based coefficient calculation algorithm is integrated to enhance its performance. Numerical studies on modified IEEE 9-bus and IEEE 118-bus systems demonstrate that the proposed ASSE method offers accurate and fast evaluations compared to Monte Carlo simulations. Comparisons with a sparse polynomial chaos expansion, Gaussian process regression, and deep neural networks, further illustrate its efficacy in accurately assessing the responses with strongly localized behavior and non-symmetric distributions, providing practical decision-making bounds for generator outputs and operating costs under uncertainty.
Read the full abstract
Software Engineering
Runtime-Independent Persistent Agents: Preserving Identity, Memory, and Code Across Models, Harnesses, and Servers
Long-lived AI agents may replace their models, orchestration harnesses, interaction surfaces and hosts while retaining identity, memory and executable body lineage. We present a runtime-independent architecture that separates a continuity-bearing substrate $P_t=(I_t,M_t,B_t)$ from replaceable execution and interaction bindings. Six continuity invariants and a quiesce–checkpoint–validate–bind–rehydrate–resume protocol govern state preservation, capability changes and continuation authority. Enoch implements the design through a reusable software body, private installed state, provider contracts and fenced migration. We report complementary evidence from frozen implementation snapshots and three kinds of live study. An operational case retains an established instance's identity, nonempty memory, body revision and historical task IDs across host, joint Codex-to-Claude model/harness, and chat-surface substitutions. A separate cross-host task resumes from a verified artifact checkpoint. A supervised Codex–Muse–Codex study completes five ordinary round trips and five matched same-runtime controls on their first attempts after a separate qualification run. A planned worker interruption recovers through the native task API with the checkpoint preserved, a stale reply rejected and one task completion recorded. These results support mechanical continuity for the tested deployments and bounded workflows. They do not establish behavioral equivalence, arbitrary-task portability, general exactly-once external effects or unattended reliability.
Read the full abstract
Statistical Mechanics
Parafermions in plain sight
We show that for any potential with a discrete energy spectrum, the well-known interpolation between ideal boson and fermion partition functions at discrete values of $\xi=-1/m$ yielded zero temperature ground state energies corresponding to $m$ fermions occupying a single quantum state. The grand canonical partition function in this case can be a result from genuine parastatistics.
Read the full abstract
Machine Learning
GenONet: A Generative operator Network for High-Resolution Precipitation Nowcasting
High-resolution precipitation nowcasting is critical for reducing the impacts of severe weather but remains difficult because of rapid storm evolution. Deep learning models have shown great promise for this task, but their predictive skill often deteriorates over longer forecast horizons. This leads to increasingly blurry forecasts that fail to capture the complex, non-linear evolution of storm systems. In order to address these limitations, we introduce Spatio-Temporal U-DeepONet (GenONet), a novel architecture for long-range precipitation forecasting up to 3 hours, specifically designed to produce sharp and physically consistent results. GenONet's architecture pioneers the use of a Deep Operator Network (DeepONet) as a generator within a Generative Adversarial Network (GAN) framework for this task. The DeepONet learns the continuous-time dynamics of precipitation, ensuring stability over long forecast horizons. Adversial training against a spatio-temporal discriminator compels the model to produce sharp, coherent forecasts, while a physics-informed loss regularizer, derived from the Moisture Conservation Equation, improves physical plausibility in our ablation setting. Quantitative evaluations show that our model achieves consistently higher scores on most of the metrics, especially for highintensity events and at longer lead times. Qualitatively, GenONet produces structurally coherent forecasts that maintain their integrity, whereas baseline models degrade into indistinct patterns. Finally, an ablation study confirms the benefit of this physics-informed loss, highlighting the strength of combining operator learning with adversarial training.
Read the full abstract
Artificial Intelligence
Feedback-Assisted Trust Propagation over Document Relation Graphs for Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) systems rely on external corpora that may contain outdated, contradictory, noisy, or unreliable documents, introducing reliability risks. Prior work has leveraged document relations to improve the answer reliability of RAG. To propagate reliability signals beyond directly compared document pairs, we propose TrustPropRAG, which structures document relations as a graph and estimates document reliability through multi-hop propagation across the graph. TrustPropRAG anchors this propagation with a limited set of human feedback on document reliability, extending these costly-to-collect feedback-based reliability signals across the whole corpus. Specifically, based on the constructed document relation graph, TrustPropRAG estimates a trust score for each document by formulating and solving an optimization problem that jointly captures pairwise document relations and user feedback. These scores are then used to improve the selection of reliable documents and support trust-aware answer generation. Evaluation results show that TrustPropRAG improves both retrieval quality and exact match over baselines, and remains robust under sparse and noisy feedback.
Read the full abstract
Superconductivity
Heavily Sr-Doped La$_{2}$SrNi$_{2}$O$_{7-{\delta}}$ as a Tetragonal Ruddlesden-Popper Phase at Ambient Pressure
High-temperature superconductivity has been found in bilayer Ruddlesden-Popper (RP) nickelates in bulk samples under high pressure, or in thin films via compressive strain. In the superconducting state, a tetragonal structure with a straight Ni-O-Ni bond along c-axis has been commonly observed, together with the suppression or diminishing of the density-wave orders. Therefore, it remains an open question whether these factors are sufficient for achieving superconductivity at ambient pressure. Here we report the first successful synthesis of heavily Sr-doped La$_{2}$SrNi$_{2}$O$_{7-{\delta}}$ under high-pressure and high-temperature (HPHT) conditions with a flux method. X-ray diffraction and scanning transmission electron microscopy (STEM) confirm that the material adopts a tetragonal (I4/mmm) structure with an 180$^{\circ}$ Ni-O-Ni bond angle along c-axis. Resistance measurements reveal metallic behavior with a low-temperature upturn and no density-wave features are observed. However, neither pressure nor oxygen variation induces superconductivity. Density functional theory calculations indicate that the holes introduced by Sr doping are predominantly doped into the Ni-3d$_{z^2}$ orbital, leading to the appearance of a very large ${\gamma}$ pocket on the Fermi surface at ambient pressure and significantly reducing the occupation of the Ni-3d$_{z^2 }$ orbital. Combining the experimental observations with theoretical calculations, we attribute the absence of superconductivity to the serious deviation from the half-filling state of the Ni-3d$_{z^2 }$ band, which is crucial for the interlayer antiferromagnetic interaction and thus for pairing. Our work unravels important issues for achieving superconductivity in bilayer nickelate system.
Read the full abstract
Systems and Control
Optimal Uniform Pricing for Multi-Interval Dispatch without Make-Whole Uplifts
In a network with ramp-limited generators and inaccurate net-demand forecasts, practical rolling-window dispatch can drive locational marginal prices (LMPs) below generators' bid-in offers. In such cases, out-of-market (OOM) settlements are used to compensate generators and maintain dispatch-following incentives, but OOM can have negative consequences, including nontransparent real-time price signals, discriminatory compensation, and incentives for untruthful bidding. This paper presents an optimal uniform pricing rule that minimizes demand payments, eliminates OOM make-whole payments, preserves LMP-based congestion charges, and ensures revenue adequacy. We derive the proposed pricing rule in closed form and relate it to existing pricing schemes. Numerical comparisons demonstrate favorable generator profits and reduced price volatility. However, higher generator profits are accompanied by increased demand payments, reflecting the in-market, uniform allocation of ramping costs while preserving the LMP-based congestion charges widely used in real-time market settlements. The numerical results also show that, under LMP with OOM settlement, a price-taking generator has an incentive to inflate its offer, whereas this incentive is absent under the proposed pricing rule within the tested bid range.
Read the full abstract
Optimization and Control
Projected Gradient Method on Hadamard Manifolds
We study constrained smooth optimization problems on Hadamard manifolds with closed geodesically convex feasible sets. We analyze two projected gradient schemes: one with a constant stepsize and another with a backtracking line search. The constant-stepsize scheme is analyzed under the assumption that the objective function has a Lipschitz continuous Riemannian gradient, whereas the backtracking variant does not require this assumption to establish stationarity of accumulation points. For both schemes, we prove that every accumulation point of the generated sequence is first-order stationary under the respective assumptions, without requiring compactness of the feasible set; compactness is needed only to ensure the existence of accumulation points. When the objective function has a Lipschitz continuous Riemannian gradient, we derive iteration-complexity bounds of order \(O(1/\sqrt{N})\) for projection-based stationarity measures for both schemes, together with the corresponding \(\varepsilon\)-complexity estimates. For the backtracking scheme, the complexity analysis additionally requires the trial line-search stepsizes to be uniformly bounded away from zero. Under the same respective assumptions, the generated sequences are also asymptotically regular. Finally, we illustrate the practical performance of the methods by solving constrained Karcher mean problems on the manifold of symmetric positive definite matrices.
Read the full abstract
Robotics
Exploring Nonlinear Body Oscillations for Natural Quadruped Gaits
Animals' body morphology shapes the gait patterns they can perform, where mechanical resonance reduces the need for active control. By tuning posture and muscle stiffness, they leverage their embodied intelligence to achieve effective gaits for different speeds. In contrast, most quadruped robots are not specifically designed to exploit mechanical resonance due to the complexity of nonlinear dynamics and require dedicated locomotion controllers. To provide an alternative, we present a proof of concept framework making the nonlinear dynamics of a robot predictable in the design process and show how this knowledge can be leveraged such that multi-gait locomotion can emerge from nonlinear resonances, shaped by gravity, inertia, and elasticity. We present the highly compliant quadruped robot eBert, on which we identify six nonlinear normal modes (NNMs) using our new theoretical tools and validate their existence in simulation and hardware. With black-box optimization to determine step length, simulations show how each NNM naturally develops into a distinct gait, manifesting different speeds, which also largely transfers to the robotic hardware. Our experiments show that eBert can exploit its mechanics to generate task-specific movements which may serve as foundation for designing a new generation of agile and efficient robots leveraging embodied intelligence.
Read the full abstract
Earth and Planetary Astrophysics
Doubling Sunlight for a Human Mars Base With Orbiting Solar Reflectors
The Sun's faintness at Mars' orbit makes producing energy, melting ice, and staying warm more difficult. Orbiting solar reflectors (OSRs) can augment sunlight at Mars, but the area of OSRs needed to double sunlight at a Mars base is not known. Here, we analyze Sun-synchronous Mars orbits to find the OSR area that doubles insolation to a Mars base. We show that the reflectors can deliver sunlight and maintain a stable orbit via attitude control and solar-sail propulsion, with no propellant. We also show that these Mars orbits can be reached via solar sailing from low Earth orbit, reducing delivery cost. Doubling sunlight is viable with an orbiting solar reflector areal density of $20 {\rm g/m^2}$, a 7-fold improvement over flight-proven solar sails. However, designing a spacecraft with low areal density, agile maneuverability (for accurate pointing), high tension in the sail membrane (to smooth wrinkles), and mass-manufacturability (to enable a constellation of reflectors) would be challenging. Still lower areal density of $<5 {\rm g/m^2}$ would be needed for more ambitious applications, such as sublimating the CO$_2$ ice at Mars' south pole to aid in terraforming.
Read the full abstract
Number Theory
Explicit Exponential Sum Estimates and Approximate Functional Equations for the Zeta Function
We show an explicit version of the Van der Corput truncated Poisson summation formula (B-process). By using refined explicit exponential sum estimates, this improves the error term of previous explicit results by Patel and Yang (2024) and Arias de Reyna (2024). As an application, we obtain fine explicit estimates for the error terms in approximate functional equations for the Riemann zeta function, improving on previous explicit results of Simonič (2020) in certain ranges.
Read the full abstract
Statistical Methodology
Anytime-Valid Distribution Shift Detection via Predictive Rank Martingales
Many sequential distribution shift detectors update a growing reference set with incoming observations. After a change, this update contaminates the reference set with post-change observations and can weaken subsequent evidence. Keeping the calibration sample fixed mitigates this contamination, but repeated reuse induces dependence among fixed-reference ranks, so arguments based on independent conformal \(p\)-values do not apply. We derive the exact conditional null distribution of the next rank given the preceding ranks and use it to construct a predictive rank martingale (PRM). Thresholding a PRM gives distribution-free, finite-sample anytime marginal type I error control. To target specific departures, we apply a pre-specified feature to each rank, center the resulting payoff under the predictive null law, and use Online Newton Step (ONS) to adapt the bet. Order and dispersion features target directional and center-versus-tail changes, respectively. For any Lipschitz feature with nonzero induced contrast under the alternative, we establish a finite-window detection guarantee and show that the test is consistent as the initial calibration size increases. At a fixed calibration size, however, we derive a power ceiling for every distribution-free detection procedure. Across synthetic and real data, our PRM methods achieve better detection performance than conditional conformal test martingale (CCTM).
Read the full abstract
Fluid Dynamics
Spectral element lattice Boltzmann method for non-ideal gases with partial wetting boundary condition
We present a spectral element lattice Boltzmann method (LBM) for partial wetting on curved geometries. A non-ideal gas phase-field model is incorporated into the LBM framework to enable phase separation with a constant interface thickness and the potential form of surface tension force is used. We adopt the force-splitting approach, yielding significantly improved stability and accuracy. Complex boundaries are naturally handled using a flux bounce-back scheme, which resolves inconsistencies in normal vectors across adjacent elements. Additionally, a general wetting boundary condition is implemented to capture static contact line in a thermodynamically consistent manner. The method is validated through simulations of droplets on flat surfaces, 2/3-dimensional curved surfaces, and equilibrium droplets without boundaries. Results demonstrate that parasitic currents are significantly reduced on unstructured meshes with complex geometries, reaching residual kinetic energy levels on the order of $10^{-24}$ for wetting configurations and $10^{-30}$ for isolated droplets.
Read the full abstract
Quantum Physics
Imaginarity witnessing enhancement via spectral norms of witnesses
Quantum imaginarity is an essential physical resource that underpins key functionalities of modern quantum technologies. We improve imaginarity witnessing via the prior knowledge of imaginarity-witness operators. To this end, we derive a rigorous upper bound on the maximum expectation value of an imaginarity witness operator over the set of all free (real) quantum states, which is given by the spectral norm of the real component of the corresponding witness operator. We demonstrate via detailed examples that this bound substantially improves imaginarity detection. We further classify all imaginarity-witness operators into four distinct families based on this bound. For these four witness classes, we perform a comprehensive analysis of their completeness and finite completeness, the joint detection of shared imaginary quantum states by different witnesses, and the conditions for distinct witnesses to identify identical imaginary states. Our results advance the fundamental understanding of imaginarity detection and offer useful insights for both theoretical studies and experimental implementations of quantum imaginarity.
Read the full abstract
Rings and Algebras
Singular Cholesky Fibers over Finite Fields
For a finite field $\F_q$, consider the triangular Cholesky map $\Gamma_{n,q}(U)=U^TU$ from upper triangular matrices to symmetric matrices. Generalized Cholesky theory describes the regular locus on which all leading principal minors are nonzero, but it does not determine the multiplicities or root ranks in a fiber over a singular target. We develop a fixed-target fiber theory for this singular boundary and answer three questions posed by Cooper and Whitlatch. Our principal results concern the zero fiber. Over $\F_2$ we construct an explicit, invertible, rank-preserving recursive bijection between square-zero upper triangular matrices and upper triangular matrices satisfying $U^TU=0$. Over every finite field we determine the entire rank distribution of this zero fiber: in even characteristic the square-zero recurrence, and hence the rank-refined equinumerosity, persists over every $\F_{2^e}$, whereas in odd characteristic its failure is measured by an explicit quadratic-character correction. We place these results in a uniform framework by proving an exact first-pivot recursion for the fiber cardinality over an arbitrary symmetric target. Its regular specialization gives the constant fiber sizes on leading-principal-minor cones, while its zero-pivot branch explains the new singular behavior. For binary diagonal targets we further compress the rank-refined count to $O(n^2)$ integer-arithmetic transitions and show that it depends on the order, not merely the number, of the diagonal entries. Executable implementations and exhaustive low-order checks are collected in an appendix.
Read the full abstract
Information Theory
Solutions to Three Conjectures and an Open Problem on Binary BCH Codes
BCH codes are among the most important classes of cyclic codes and have played a central role in coding theory and its applications. One of the fundamental problems in the study of BCH codes is to determine their exact minimum distances, which directly govern their error-correcting capability. Although the BCH bound provides a general lower bound, determining the exact minimum distance is often difficult, and many parameter families remain unresolved. In this paper, we investigate three conjectures and an open problem on binary BCH codes proposed by Chen, Xie, and Ding in \cite{Chen59}. We settle these conjectures on the exact minimum distances of three families of binary BCH codes by constructing codewords attaining the BCH bound. Beyond these conjectures, we further study the more difficult family codes and determine its minimum distance for some cases. We further study Open Problem 8.4: affirmative answers are obtained for the first two length families, while for the third family a sufficient condition is established and a counterexample shows that the unrestricted assertion does not hold in general.