Functional Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Friday 11 September
Motivated by the wide applications of the quadratic phase integral transform in signal processing, optics, and time frequency analysis, in this paper we develop a new integral transform called the quaternion quadratic phase Dunkl transform (QQPDT). We present a detailed study of its fundamental properties. In particular, we establish continuity, linearity, scaling, modulation, Riemann Lebesgue result, inversion formula, and Parsevals identity. In addition, we estab lish Heisenberg and Donoho-Stark-type uncertainty principles for the QQPDT. Finally, we develop a signal recovery algorithm in the QQPDT domain. The proposed method enables the reconstruction of missing signal information from partial observations under suitable localization conditions.
Mathematical Finance
Arbitrage in Estimate Nothing: an example
We give a two-period counterexample to the absence of arbitrage for the posterior-weighted pricing rule in Estimate nothing by Duembgen and Rogers. Both physical models have strictly positive transition densities, and each model is equipped with an equivalent martingale measure. Nevertheless, the mixed price of a single derivative falls deterministically from $5/2$ to $2$ between two trading dates. If these prices are tradable, shorting the derivative and closing the position one period later yields a certain profit. A finite-state appendix also illustrates the failure of recursive consistency.
Read the full abstract
Probability
The distributions of convex body functionals of the Poisson polyhedron
This note presents new findings on the distribution of the volume and surface area of both the Poisson polyhedron and the Crofton polyhedron. It also considers the distribution of the area of the Poisson polygon and the Crofton polygon in the plane. This note motivates the modeling of the distributions of these convex body functionals as mixture distributions and the essential inclusion of the generalized gamma distribution therein as mixture components. Finally, model parameters are estimated and models are selected based on extensive stochastic simulations of these random polytopes. This includes that for the first time, this note gives very accurate estimates of the side number probabilities for both the Poisson polyhedron and the Crofton polyhedron, as these are used as mixing weights in the distribution models.
Read the full abstract
Machine Learning (Statistics)
A Splitting Method for SDE Terminal-Law Estimation
In many settings involving stochastic differential equations (SDEs), including diffusion based generative AI, our aim is to accurately generate samples from a distribution. Typically, this is done by generating i.i.d. samples of the SDE. Given a fixed simulation budget, a reasonable way to gain efficiency may be to instead generate a tree of paths through appropriately split partial paths. This suggests improved performance, but one worries about the injected dependence. In this paper, we study this issue comprehensively. We develop a general method to construct the splitting design and analyze its performance for a broad class of error measures, giving insight into the elegant underlying structure in the problem. For the Kolmogorov-Smirnov (KS) distance and maximum mean discrepancy (MMD), we identify the limiting errors of the associated empirical distributions as the simulation budget increases to infinity. We characterize a splitting strategy motivated by a corresponding asymptotic optimization problem. Overall, we observe a 12-26% improvement in mean KS over i.i.d. samples in many settings. On CIFAR-10 and FFHQ, splitting lowers the MMD by 17-26% relative to i.i.d. samples.
Read the full abstract
Superconductivity
Critical current anisotropy of practical superconductors: analysis methods and application cases
The analysis of critical current anisotropy is important for improving superconductor-based devices. This article critically evaluates contemporary techniques for analyzing the angular dependence of critical current in practical superconductors, focusing on second-generation high-temperature superconducting tapes (coated conductors). These techniques are based on the scaling model, vortex path model, or anisotropic pinning model. We present empirical findings on critical current angular dependencies in coated conductors of different chemical compositions. Distinctive features are highlighted: the complex effect of rare-earth substitution in the HTS composition on the pinning landscape, peak asymmetry, and the dependence of critical current on Lorentz force direction at fixed magnetic field direction. The described techniques are then applied to the experimental dataset. A refined anisotropic pinning model is introduced to accurately describe certain observed phenomena. Approximation accuracy of the models is assessed using the coefficient of determination adjusted for the number of fitting variables. The fundamental disparity in interpreting angular dependencies with different models is emphasized. No universal methodology yet comprehensively explains all features or links them to the defective structure of the HTS material. This is a critical gap in understanding superconductor behavior under varying conditions and highlights the need for further research.
Read the full abstract
Systems and Control
Computing at Sea: Floating and Offshore Data Centres as a Pathway to Sustainable AI Infrastructure
The rapid expansion of artificial intelligence is transforming data centres into one of the world's fastest-growing sources of electricity demand. As AI systems scale in size and capability, the physical infrastructure supporting computation is approaching critical limits in energy availability, cooling capacity, land use, freshwater consumption, and carbon management. Conventional land-based data centres are increasingly constrained by urban land competition, grid congestion, environmental pressures, and lengthy permitting processes, raising fundamental questions about where future computing infrastructure can sustainably exist. This article examines floating and offshore data centres as an emerging alternative model for digital infrastructure. By relocating computation to marine environments, offshore systems can exploit the ocean's natural cooling capacity, reduce freshwater dependence, and enable direct integration with offshore renewable energy resources such as wind, wave, and tidal power. Early deployments have demonstrated the potential for significantly improved energy efficiency and operational reliability compared with conventional facilities, while also opening new possibilities for distributed and resilient computing architectures. The article explores how offshore computing may reshape the future relationship between electrification, renewable energy, and large-scale AI infrastructure. It analyses the opportunities and trade-offs associated with marine deployment, including environmental impacts, engineering design challenges, economic feasibility, and regulatory governance. Rather than treating offshore data centres as experimental novelties, the article presents them as part of a broader systems-level transition in how society may power, cool, and sustain the next generation of computational growth.
Read the full abstract
Neural and Evolutionary Computing
Signed Sensitivity of Expected Hitting Time to Mutation Rate in the (1+1) EA: Per-State Sign Theorems and Verifiable Certificates for Non-Lumpable Families
For the (1+1) evolutionary algorithm with standard bit mutation, we study the sensitivity of the expected hitting time $H_p=\mathbb{E}_x T$ to the mutation rate. We first point out an easily overlooked formalization pitfall: the improvement event is not monotone in the mutation mask, so the unsigned (total-influence) form of the Margulis-Russo formula does not apply; the correct object is the signed endpoint difference. Second, we give an exact three-dimensional separation: two fitness functions share the entire one-step success-rate curve, yet their expected hitting times are two different exact rational numbers; hence one-step success-rate quantities do not determine the expected hitting time. Building on the runtime derivative $H'_p=(I-Q_p)^{-1}Q'_p H_p$, we construct computable double-residual sign certificates, prove a per-initial-state sign theorem on OneMax (for every non-optimal initial state, $\partial_c H<0$ on $0<c<1$, where $p=c/n$; at $c=1$ only the distance-one state is stationary), and extend the framework to non-lumpable positive linear families: an explicit non-lumpability witness, a block-interval double-residual certificate that covers all states without enumerating them, a uniform sign bound $\partial_c\mathbb{E}T\le -9n/16$ over the whole interval $c\in[1/4,1/2]$ for an explicit family at all even scales $n\ge 8$, and a heterogeneous instance certificate $H'_x\le -1/6$ on 57 of 63 states across $c=1$. All finite verifications use exact rational arithmetic. A bounded systematic literature search did not uncover this exact combination, although the underlying tools are well established; we therefore make no novelty claim beyond the stated combination.
Read the full abstract
Computer Vision
ChitraMiti: Benchmarking Visual Grounding and Modality Reliance in Bengali Geometric Reasoning
Evaluation of vision-language models (VLMs) for multimodal mathematical reasoning remains limited for low-resource languages and for geometry problems that require reading a diagram and a question together. We introduce ChitraMiti-12.8k, a synthetic benchmark of 12,874 Bengali planar geometry problems paired with structured 15-attribute descriptions, and NCTB-500, a complementary set of 500 diagrams manually extracted from Bengali school textbooks. Using a three-phase protocol that separates diagram-only, diagram-plus-description, and description-only inputs, we show across five open-weight and closed-source VLMs that description-only performance is statistically indistinguishable from diagram-plus-description performance, establishing structured descriptions as a sufficient textual proxy for controlled evaluation. Despite this, models remain poor at cross-modal verification, frequently misled by a swapped spatial relation even when they answer the unmodified item correctly. We further evaluate supervised adaptation on ChitraMiti-12.8k, finding that fine-tuning improves performance on both ChitraMiti-1k and NCTB-500, although a substantial gap to the strongest zero-shot model remains. Together, ChitraMiti-12.8k, NCTB-500, and our evaluation protocol offer a standardized way to study Bengali multimodal geometry reasoning and, more broadly, whether VLMs actually check their text against what they see. Our dataset and code are publicly available on Hugging Face at https://huggingface.co/datasets/RaiyanKhaan/ChitraMiti.
Read the full abstract
Data Structures and Algorithms
Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds
We study combinatorial optimization problems under the constraint of $\epsilon$-differential privacy ($\epsilon$-DP). Given the strong lower bounds for explicitly outputting solutions, we work within the implicit representation framework of Gupta et al. (SODA 2010), where a private polynomial-time randomized "encoder" generates a representation of a solution, and a "decoder" uses this representation along with the input to extract a valid final solution. In this work, we generalize this framework by allowing the encoder to run in fixed-parameter tractable time. This circumvents approximation barriers inherent to polynomial-time algorithms and obtains improved guarantees for many fundamental combinatorial optimization problems. Finally, we establish the first representation-independent lower bounds for our framework. Assuming a non-uniform variant of the Gap Exponential Time Hypothesis, for sufficiently small $\epsilon > 0$, we prove that no $\epsilon$-DP encoder-decoder pair can achieve certain approximation guarantees, if the decoder runs in subexponential time. We further provide representation-dependent lower bounds that hold even for larger $\epsilon$.
Read the full abstract
Algebraic Geometry
Hodge-Deligne and Poincaré polynomials of $\overline{\mathcal M}_{1,n}$
By studying wall crossings of Hassett moduli spaces of weighted pointed curves, we prove a recursive formula that reduces the computation of the cohomology of $\overline{\mathcal M}_{g,n}$ to that of the moduli space $\overline{\mathcal M}_{g,(0^+)^n}$ of stable pointed curves of minimal weights. For $g=1$, we further prove an explicit formula for the Hodge-Deligne and Poincaré polynomials of $\overline{\mathcal M}_{1,(0^+)^n}$. Combining these, we prove formulas that enable us to compute the cohomology of $\overline{\mathcal M}_{1,n}$ efficiently.
Read the full abstract
Numerical Analysis
Normal Equations and Discrete Energy Structures for High-Order Streamline Diffusion
We analyse fully discrete Streamline Diffusion finite element methods, also known as SUPG methods, for time-dependent first-order systems with skew-symmetric spatial operators. To the best of our knowledge, this is the first stability and a priori error analysis of strongly consistent Streamline Diffusion finite elements combined with linear multistep schemes of order greater than two for multidimensional first-order hyperbolic systems. Local-in-time $L^2$-residual minimisation singles out $\delta=b_0\tau$, where $\delta$ is the stabilisation parameter, $\tau$ the time step, and $b_0$ the current-time coefficient in the method average. For this choice, each implicit linear system is a symmetric positive definite normal equation in a graph norm. A direct dual-residual estimate yields errors of order $O(h^{k+1/2}+\tau^\nu)$ when $\delta$ is proportional to $h$ and $\tau=O(h)$, where $h$ is the mesh size, $k$ the polynomial degree, and $\nu$ the temporal order. Stability is established for the $\theta$-method and the Adams-Moulton methods AM3-AM5. The general-degree AM3 and AM4 estimates use strengthened CFL conditions; for continuous piecewise affine elements, an elementwise cancellation recovers the standard hyperbolic regime. AM5 and the explicit Adams-Bashforth methods AB3 and AB4 are stable under a standard hyperbolic CFL condition, though the explicit schemes do not have normal-equation structure. Order-matched acoustic tests recover orders two through five and material-residual rates one half-order lower. In a d'Alembert test with discontinuous initial data, normal-equation SUPG recovers second-order local $\mathbb P_1$ convergence away from the wave fronts, whereas the unstabilised error is close to half order. A two-dimensional compact-wave test shows improved localisation with modest dissipation.
Read the full abstract
Computer Vision
LettuceVisSim: A Simulator That Generates Lettuce Image Time-series for Vision-Based Reinforcement Learning
Vision-based reinforcement learning holds strong potential for decision-making in controlled environment agriculture (CEA). However, its development is hindered by the scarcity of labelled crop images. To address this gap, LettuceVisSim, a lettuce growth simulator that generates labelled time series of crop images, was developed and validated. The simulator contains a process-based model (PBM) for shoot dry weight dynamics, a canopy layout algorithm for deriving canopy layout representations from shoot dry weight, and a Unity rendering engine for image generation. Five findings support the simulator. First, the PBM reproduced shoot dry weight under dynamic plant-density management with $\mathrm{R}^{2}=0.84$. Second, a piecewise cubic regression mapped shoot dry weight to potential projected area with $\mathrm{R}^{2}=0.94$. Third, the canopy layout representation was validated using 12 experimental datasets each having different dynamic environmental and spacing conditions. It reproduced the ground coverage ratio dynamics observed in measured images, achieving $\mathrm{R}^{2}=0.84$ when driven by measured shoot dry weight and $\mathrm{R}^{2}=0.40$ (0.76 excluding one outlier) when driven by PBM-simulated values. Fourth, the Unity rendering engine converted canopy layout representations into RGB and segmentation images at less than 10~ms. Fifth, a demonstration showed that a lighting-control policy can be learned and applied by observing only crop images that were generated with LettuceVisSim, providing a proof of concept of vision-based reinforcement learning in CEA using LettuceVisSim.
Read the full abstract
Mesoscale and Nanoscale Physics
Spin-polarized Superconductivity and High-Chern Insulators in Twisted Rhombohedral Graphene Family
Rhombohedral multilayer graphene has emerged as a remarkably versatile platform for exploring strong correlation driven quantum states arising from low-energy topological flat bands. When reconstructed by the moire superlattice, these bands host a wide range of emergent novel states, including integer and fractional Chern insulators and unconventional superconductivity. Here, we firstly report the simultaneous emergence of widespread spin polarized SC and high Chern insulators in twisted bilayer multilayer RMG system 2+n where n=4,5,6. The SC states in 2+n system exhibit different responses to the in plane magnetic field, with SC being suppressed, enhanced and induced by in plane magnetic field . The latter two are consistent with spin-triplet pairing. Along with SC, angle and layer dependent HCIs with tunable Chern numbers emerge. Moreover, the fractional high Chern insulator in the system survives under high in plane magnetic field which can induce SC in the same device. Our work not only establishs twisted bilayer multilayer rhombohedral graphene as a unified platform for studying SC and high Chern insulators, but also opens a pathway towards multiple copropagating chiral Majorana channels by coupling spin-polarized SC to high Chern insulators.
Read the full abstract
Human-Computer Interaction
When2Talk: When Should a Proactive In-Car Agent Talk?
Proactive in-cabin agents can help passengers understand automated-vehicle (AV) behavior, but communicating every ride event may introduce unnecessary interruptions. We investigated how communication should adapt to event priority and passenger activity. In a mixed-methods within-subject study, 41 participants rode as passenger in a VR simulated fully-automated vehicle. We compared an event-triggered (ET) policy that communicated immediately at every event with a context-sensitive (CS) policy that selected Immediate, Delayed, or Silent communications. CS increased communication appropriateness and substantially reduced perceived interruption. Perceived trust did not differ between policies, although baselines dispositional trust differentiated communication preferences. Findings highlight event consequence, passenger activity, continuing information value, and confirmation need as key considerations for selective in-cabin communication.
Read the full abstract
Robotics
Communication-Constrained Multi-Robot Exploration With Adaptive Communication Windows
Exploring unknown environments with multi-robot teams can improve efficiency by allowing robots to explore in parallel. However, realizing these gains requires effective information sharing. When communication is intermittent, robots must balance the benefits of sharing information against the cost of diverting from exploration to establish communication. This paper introduces MACE, a decentralized exploration framework that actively evaluates whether establishing communication is worthwhile. At scheduled communication windows, robots estimate the cost of reaching previously identified communication locations. By formulating this decision as a variant of the Vehicle Orienteering Problem, robots evaluate routes based on the travel required to establish communication and the exploration that can be completed along the way. This approach enables robots to communicate more frequently than under purely opportunistic strategies while reducing the unnecessary travel associated with fixed rendezvous strategies. Across a set of simulated environments with varying size and geometry, we demonstrate that MACE reduces the total exploration time by up to 23% compared to existing communication-constrained exploration strategies.
Read the full abstract
Computers and Society
Mindspeller Neuroprofiling. How task performance, EEG, and association evidence support O*NET-based role guidance
Mindspeller produces a Neuroprofile from three sources: rational self-report, association-based semantic positioning, and performance recorded during cognitive tasks together with EEG. The task-and-EEG stream is the only source used to create occupational evidence. A result can enter role matching only after the participant's task performance supports the intended construct and the corresponding EEG data pass the required quality and evidence checks. The current pilot uses four EEG electrodes, twelve scored tasks, 23 O*NET abilities, and an internal bank of 376 occupations. Self-report and association evidence help explain motivation, preference, and alignment, but do not generate roles. The output is intended to support discussion about cognitive fit. It is not a hiring decision, a measure of practical job skill, or a prediction of job performance. Role confidence is currently capped at Moderate, and external psychometric and job-outcome validity have not yet been established.
Read the full abstract
Quantum Physics
Quantum neural network equipped with backpropagation on a qudit processor
Quantum neural networks (QNNs), one of the fundamental algorithms in quantum machine learning, have been widely used in classification and identification tasks. However, the capabilities of QNNs are constrained by their size, which is determined by the dimension of the Hilbert space of the underlying quantum processor. Multi-level quantum digits (qudits) offer access to a higher-dimensional Hilbert space compared to two-level qubits, enabling the construction of more expressive QNNs. In this work, we report an experimental demonstration of qudit-based QNN using a trapped $\rm ^{40}Ca^+$ ion. We train the QNN using a hybrid quantum-classical implementation of backpropagation and achieve an experimental classification accuracy of $95.7\%$ on a test image set. This demonstration highlights the potential of qudit-based processors to QNN architectures and provides a framework for implementing qudit-based QNNs across various quantum devices.
Read the full abstract
Number Theory
A Generalization of Sárközy's theorem in function fields
Sárközy's theorem says that if $A \subset \mathbb{Z}$ has positive upper asymptotic density, then there are distinct $a_1, a_2 \in A$ and $n \in \mathbb{Z}$ such that $a_1-a_2 = n^2$. The same is true if $n^2$ is replaced by $F(n)$ for any polynomial $F \in \mathbb{Z}[x]$ with constant term zero. Green proved an $\mathbb{F}_q[t]$-analog of Sárközy's theorem with strong quantitative bounds, but required a technical condition on the number of roots of the polynomial $F \in \mathbb{F}_q[x]$. This condition was recently removed by Li and Sauermann. In this paper, we generalize Green's argument to accommodate equations in more variables in $\mathbb{F}_q[t]$, while pointing out that the technical condition can be removed by means of a simple observation.
Read the full abstract
Robotics
ArtManip: Category-Level Articulated In-Hand Manipulation
Category-level in-hand manipulation of articulated objects is a formidable yet underexplored challenge for dexterous robotic hands. This difficulty stems from two core bottlenecks: first, controlling an object's internal degrees of freedom is tightly coupled with maintaining grasp stability on a free-floating base; second, acquiring diverse object models and functional grasps at scale is highly labor-intensive, yet vital for generalization given the system's sensitivity to initial configurations. In this work, we present ArtManip, the first category-level articulated in-hand manipulation method that generalizes across object instances and diverse initial grasps. For initial configuration construction, we develop an automated pipeline that procedurally generates diverse articulated objects and synthesizes task-oriented functional grasps. For policy learning, we propose a robust two-stage training strategy that incorporates articulation physics randomization, reward curriculum, and latent representation distillation to handle complex contact and joint dynamics during deployment. Extensive experiments across four object categories demonstrate that our policy generalizes to unseen instances and varied configurations in simulation, and achieves zero-shot transfer to 12 real-world objects featuring diverse shapes and joint mechanics.
Read the full abstract
Computer Vision
RoES: Rotational Equivariant Selective-frequency Fusion for Multimodal Images
Infrared-visible image fusion facilitates robust multimodal perception by integrating complementary textural nuances from visible sensors with thermal signatures from infrared systems. Due to the task's inherently ill-posed nature, existing methods heavily rely on structural priors but typically enforce rotation equivariance uniformly across all features. Such a holistic approach overlooks a critical distinction where low-frequency shared structures strictly adhere to equivariant constraints while high-frequency modality-specific details require greater flexibility to preserve unique information. To bridge this gap, we propose RoES, a Rotational Equivariant Selective-frequency fusion network. Instead of employing static decomposition, we introduce a trainable rotation-enhanced updater/predictor module to dynamically decouple low- and high-frequency components. The resulting representations are then processed through a dual-branch fusion module tailored for spectral consistency. Specifically, a rotation-equivariant Mamba is employed to capture long-range structural dependencies in the low-frequency domain, while a polar spectral attention-based Dual-Fourier block refines high-frequency details under explicit low-frequency guidance. Extensive experiments demonstrate that RoES consistently achieves state-of-the-art performance in both fusion quality and downstream object detection, establishing a robust solution for multimodal fusion by reconciling frequency-selective features with equivariant constraints. The source code is available at https://github.com/BryceLosky/RoES-Fusion.
Read the full abstract
Computational Engineering
TailWeather: from tail to extremes, a global climatological dataset for machine-learning weather forecasting
Weather forecasting models commonly use the average forecast skill for short-range forecasts. However, it does not necessarily imply skill in the tails of the weather distribution. Evaluating tail events requires a consistently defined target with broad spatial and temporal coverage. Disaster catalogs record societal consequences, but are sparse and reporting-dependent; climatological tails describe unusual weather without necessarily implying harm. We present TailWeather, a global 0.25-degree, land-only dataset derived from ERA5, covering 1981-2022 and extending into January 2023. It labels heatwaves, cold waves, heavy precipitation, and extreme wind daily, and meteorological drought monthly. Each event has an ordinal severity tier and a numerical intensity score referenced to the local 1991-2020 climate. The scores support alternative thresholds within their stored resolution and valid domain. Comparison with documented disasters shows greater impact enrichment towards stricter tails, with differences among hazards and substantial gaps in catalog coverage. Forecast examples illustrate how low average errors can coexist with weak event detection, particularly for wind. TailWeather provides a reusable physical target for studying and evaluating extremes, while complementing the information in disaster catalogs.
Read the full abstract
Artificial Intelligence
Information Specialization and Constrained Synthesis in Multi-Agent LLM Forecasting: A Prospective Live-Study of the 2026 FIFA World Cup
Large language models are being organized into multi-agent systems with specialized roles, but whether such specialization produces distinct forecasts and whether subsequent synthesis improves utility remains unclear. In this study, we carried out a live, prospective evaluation over the final 56 matches of the information-dense 2026 FIFA World Cup, keeping a frontier foundation model constant while assigning two primary forecasting agents contrasting specialist roles: a quantitative specialist focusing on structured performance statistics and a news specialist focusing on current injuries, tactics and information from press conferences. Their forecasts were then reviewed by a separate critic before being combined by a meta-agent, resulting in a sequential four-agent model. Forecasts from the betting market served as an external benchmark. The news specialist obtained the highest mean probability-weighted Top-3 utility and matched the betting market in Top-3 exact-score hits. Nevertheless, the two specialist forecasters agreed on at least two of the three scorelines in 50 out of 56 matches, and the meta-agent never generated more than one scoreline outside the specialists' forecast set. These findings show that rapidly changing, unstructured information can provide a valuable forecasting signal alongside structured statistics, whereas adding critic and meta-agent stages does not necessarily create complementary information or improve on the strongest specialist.
Read the full abstract
Earth and Planetary Astrophysics
Terminal instability of the Solar System triggered by stochastic solar mass loss
From its birth, celestial mechanics has been deeply intertwined with the question of the Solar System's dynamical stability. For the inner planets, this question is now statistically settled: Mercury's orbit carries a $\sim$1% chance of destabilization before the Sun leaves the main sequence. The outer Solar System has seemed more secure, with its intrinsic dynamical lifetime estimated at $\sim10^{18}$ years. Even accounting for the Sun's mass loss and stellar flybys, the orbital architecture of the giant planets had been expected to persist for $\sim$100 Gyr. Here we show that these estimates rest on the assumption that solar mass loss is smooth. The recently measured white dwarf recoil demands asymmetric mass loss that is most readily attributed to discrete, independently directed ejections that impulsively perturb stellar motion. As the Sun sheds its envelope in such parcels, the planets' orbits random-walk with amplitude set by the mass-loss granularity. At a coarseness corresponding to observationally permitted kicks, this stochastic forcing restructures the outer Solar System concurrently with the Sun's death. In particular, our numerical experiments reveal that orbit crossings can commence on the red giant branch, with $\sim$40% of realizations undergoing disruption or violent scattering before the white dwarf forms and $\sim$90% self-destructing within 3 Gyr. The outer Solar System's dynamical lifetime thus collapses from $10^{18}$ years to approximately a gigayear after white dwarf formation.
Read the full abstract
Statistical Methodology
Recoverability Is a Subspace Property: A Benchmark for Certified State Estimation from Partial PDE Observations
When reconstructing the hidden state of a partial differential equation (PDE) system from partial observations, aggregate prediction error measures performance on a given data distribution but does not reveal how strongly the observations constrain each predicted direction. We introduce UniPDE-Bench, a direction-wise evaluation protocol that incorporates local observation geometry into state-estimation assessment, providing a reference for prediction recovery and confidence-based selection that is independent of the estimator. The protocol whitens the joint observation Jacobian by the noise covariance and normalizes it by a state metric. Its complete right singular basis represents joint variations of the state, which a relative sensitivity threshold partitions into retained and below-threshold directions. In this common basis, the protocol evaluates recovery and the agreement between prediction claims and the geometric partition, while recovery and abstention curves describe confidence-based selection at different claim coverages. In the simulated tasks and observation configurations studied here, confidence rules whose overall ranking exceeds chance can still exhibit below-random abstention on below-threshold directions at some high claim coverages. By separating empirical recovery from direction-selection quality, the protocol relates prediction performance to local observation sensitivity and provides an evaluation of partially observed state estimators beyond aggregate error.
Read the full abstract
General Topology
Common Fixed Points of Co-Cyclic and Sub-Cyclic Mappings in Complete Metric Spaces
In this paper, we introduce two new classes of cyclic-type mappings, namely, co-cyclic mappings and sub-cyclic mappings, defined on the union of two subsets of a metric space. Under suitable Jungck-type contractive conditions and compatibility assumptions, we establish unique common fixed point theorems for these mappings in complete metric spaces. The proofs are based on the construction of appropriate sequences, the associated contractive conditions, and the completeness of the underlying metric space. Examples are provided to illustrate the proposed concepts and to demonstrate the applicability of the main results. Finally, some open questions and possible directions for further research concerning co-cyclic and sub-cyclic mappings are presented.
Read the full abstract
Computer Vision
PhysioAI: Clinical Knowledge-Guided Semantic Supervision for Skeleton-Based Physiotherapy Action Recognition
Skeleton-based action recognition can support automated tracking of physiotherapy exercises, particularly in remote rehabilitation settings where continuous in-person supervision is impractical. However, most existing methods are developed for large-scale daily-action benchmarks rather than rehabilitation scenarios. Public rehabilitation exercise datasets are typically small, with only subtle kinematic differences between exercise classes. For participants with motor impairments, exercise execution may also deviate from standard movement patterns in amplitude, speed, and coordination, increasing intra-class variability and making reliable recognition more difficult for skeleton-based models. We propose PhysioAI, a clinical knowledge-guided semantic supervision framework that injects structured physiotherapy knowledge into skeleton representation learning. PhysioAI combines graph-based spatiotemporal modelling of human movement with training-time semantic anchors derived from a structured Clinical Knowledge Dictionary (CKD). The CKD descriptions are encoded using a frozen Contrastive Language-Image Pre-training (CLIP) model and projected into an anchor space, where they provide class-specific semantic targets for skeleton representation learning. The resulting CKD-derived anchors are used only during skeleton-model training; inference requires only skeleton inputs. Under subject-disjoint evaluation, PhysioAI achieves $99.03\pm1.34\%$ on KiMoRe Overall, $94.64\pm7.36\%$ on the Hard-67 stress test, and $87.44\pm7.69\%$ on UI-PRMD Overall. These results exceed the strongest comparator for each endpoint by $0.27$, $2.87$, and $1.33$ percentage points (pp), respectively. These findings demonstrate that structured clinical knowledge can serve as an effective source of training-time supervision for physiotherapy action recognition.
Read the full abstract
Optimization and Control
Internal controllability of first order quasilinear hyperbolic systems with a reduced number of controls
In this paper we investigate the exact controllability of $n \times n$ first order one-dimensional quasilinear hyperbolic systems by $m<n$ internal controls that are localized in space in some part of the domain. We distinguish two situations. The first one is when the equations of the system have the same speed. In this case, we can use the method of characteristics and obtain a simple and complete characterization for linear systems. Thanks to a linear test this also provides some sufficient conditions for the local exact controllability around the trajectories of semilinear systems. However, when the speed of the equations are not anymore the same, we see that we encounter the problem of loss of derivatives if we try to control quasilinear systems with a reduced number of controls. To solve this problem, as in a prior article by J.-M. Coron and P. Lissy on a Navier-Stokes control system, we first use the notion of algebraic solvability due to M. Gromov. However, in contrast with this prior article where a standard fixed point argument could be used to treat the nonlinearities, we use here a fixed point theorem of Nash-Moser type due to M. Gromov in order to handle the problem of loss of derivatives.
Read the full abstract
Artificial Intelligence
Confidence-Gated Transductive Test Generation for Code Reranking
Test case synthesis is crucial for evaluating and ranking programs generated by large language models (LLMs). However, constructing high-quality test cases remains challenging because reliable expected outputs are often difficult to obtain. We propose Confidence-Gated Transductive Test Generation (CoTT), which first uses an efficient inductive procedure and invokes transductive generation only when inductive confidence is low. This adaptive design improves output reliability while allocating extra computation only when needed. On code reranking benchmarks, CoTT outperforms prior baselines across the reported metrics while reducing cost relative to applying transductive generation to every input. These results show that confidence-based allocation of test-time computation provides a favorable efficiency-effectiveness trade-off with a single efficient LLM.
Read the full abstract
Cryptography and Security
Access Control as Verified Parse Constraints
Commercial security gateways repeatedly ship implementation bugs in the code path between the network and the policy decision: hand-written enforcement logic that diverges from the policy author's intent, and ad-hoc request parsers at the network boundary that introduce memory-safety flaws of their own. In both cases the bug is in the deployed enforcement code, not in the policy. Existing approaches either leave the enforcement runtime unverified or connect a formal model to a hand-written engine only by differential testing. Our contribution is a class result: a forward-only, backtrack-free EverParse validator is a verified recognizer for a bounded, finite-state class, and access-control decision functions with fixed-offset fields and bounded disjunction belong to it, so one machine-checked proof transfers to every policy in the class rather than being re-established per policy. Concretely, we encode a bounded policy language's decision function into a fixed-size byte buffer and verify the enforcement code once—covering all byte values—with an SMT solver, proving the validator accepts if and only if the decision function accepts, for every policy, request, and session. Editing rule content over a fixed endpoint set then needs no new proof; adding endpoints reruns the toolchain; extending the language needs new proofs. We establish faithful enforcement of a policy, not that a policy is itself secure. The verified gate is platform-independent, requiring only EverParse/Z3 and a C compiler, whose correctness we assume. We demonstrate a deployment on the seL4 microkernel, which ensures every request passes through the gate and that unverified components cannot corrupt the verified enforcement chain.
Read the full abstract
Mathematical Physics
Large $N$ expansions of the partition function for Coulomb systems on the surface of a cylinder
The two-dimensional one-component plasma forms a droplet in the case that the one-body potential is proportional to the number of charges. Our interest is in studying the large $N$ form of the corresponding partition function, with the plasma confined to the surface of the cylinder. The one-body potential is (up to technical restrictions) allowed to be arbitrary in the direction of the axis of the cylinder, whereas the coupling is restricted to the exactly solvable value $\beta = 2$. It is demonstrated that a change of variables can be made to an annular droplet plasma model, up to a certain Jacobian factor. The latter can be interpreted as the characteristic function of a certain linear statistic, which generalises the original aim of our study to also analysing the large $N$ form of the characteristic function for the annular droplet plasma model. While this is well known in the case of soft wall boundary conditions, our analysis (based on Laplace's method applied to certain integrals, and the Euler-Maclaurin summation formula) covers the case of one or two hard walls at the boundary, or inside, of the droplet for which the soft edge formulas are shown to no longer hold. Use of this to study the large $N$ expansion of the cylinder partition function requires knowledge of the same expansion in the annular case. This is not available in the case of two hard walls inside the droplet, which we treat instead via a direct analysis. In distinction to the case of the annular partition function, the large $N$ expansion of the logarithm of the cylinder partition function is found to always have no term proportional to $\log N$, independent of the presence of hard walls.