Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 13 September
We study the conformal parametrisation of smooth star-shaped planar domains and its dependence on perturbations of the boundary. The boundary correspondence of the normalized Riemann map is described by the Theodorsen equation, which we formulate in weighted Wiener algebras. We derive an explicit representation of the inverse of the linearized Theodorsen operator through a canonical Wiener–Hopf factorisation and obtain quantitative a posteriori estimates that are stable under perturbations of the boundary function. For a collection of nonperturbative reference domains, rigorous computer-assisted estimates yield explicit neighborhoods in a weighted Wiener algebra such that every boundary function in these neighborhoods admits a uniquely determined conformal parametrisation in the validated ball, with quantitative control of the corresponding Riemann map. Thus the validation applies to open, infinite-dimensional families of star-shaped domains. As an application, we consider the semilinear Dirichlet problem \[ -\Delta v=v^3\quad\text{in }\Omega, \qquad v=0\quad\text{on }\partial\Omega. \] Pulling the equation back by the validated conformal maps yields a problem on the unit disk. Uniform a posteriori estimates then imply persistence of the elliptic solutions throughout explicit neighborhoods of the reference domains.
Numerical Analysis
On a class of supraconvergent Hermite-type methods for advection-diffusion equations
We develop and analyze a class of Hermite-type methods for linear advection-diffusion equations in the case of one-dimensional periodic domains. The methods evolve both nodal values and cell averages and are therefore referred to as hybrid-variable (HV) methods. Using Hermite interpolation theory, we construct the HV methods to arbitrary order of accuracy, and prove that the method is supraconvergent in the sense that the spatial order of accuracy can be up to two orders larger than the local truncation error. In the second part, we prove all central HV methods for linear diffusion equations and linear advection-diffusion equations are stable at the semi-discretized level. Next, we prove the convergence of all stable HV schemes and provide error estimate in the discrete $L^2$-norm of the semi-discretized solution, which extends the supraconvergence from a single mode to all sufficiently smooth initial data. The theoretical predictions on the accuracy and stability of the methods are verified by extensive numerical tests.
Read the full abstract
Number Theory
Critical Restricted Sumsets at the Boundary $\lvert A\rvert+\lvert B\rvert=p$
Let $p$ be an odd prime, and write $A\RS B=\{a+b:a\in A,\ b\in B,\ a\ne b\}$. We classify all pairs $A,B\subseteq\Fp$ satisfying $|A|+|B|=p$, $|A|>|B|=\ell\ge1$, and $|A\RS B|=p-2$. After normalizing the two missing sums to $\{0,1\}$, we obtain exactly $\ell+1$ explicit models. The classification forces $B\subseteq A$ and yields, for fixed $p,\ell$, exactly $\binom p2(\ell+1)$ ordered pairs and $1+\lfloor\ell/2\rfloor$ equivalence classes under simultaneous affine transformations. We determine when either set is an arithmetic progression and compute exact difference-set cardinalities. For $\ell\ge3$ and $p\ge4\ell-5$, the cardinality $|B-B|$ determines the equivalence class at fixed $p,\ell$. The proof uses punctured translates and cyclic component counting. We also exhibit a critical pair in $\mathbb F_{13}$, with size gap three and $|A|+|B|=p-2$, that contradicts a proposed inverse statement below the boundary.
Read the full abstract
Robotics
NavPatch: Evidence-Guided Object-Level Costmap Correction with Vision-Language Models
Mobile robots typically rely on geometric maps for obstacle avoidance and path planning, but the resulting obstacle representation does not always match how an object should affect navigation. A low lying cable may be missed, a flexible curtain may create spurious blockage, and a traffic cone may require an exclusion region larger than its observed footprint. We present NavPatch, an object level correction layer that assigns ADD, REMOVE, or EXTEND to navigation relevant object categories through periodic scene understanding with a vision-language model. Open vocabulary grounding localizes object instances, and LiDAR and RGB-D observations provide 3D support. Observation quality filtering and cross frame maintenance determine when each correction patch is committed, replaced, or revoked. In 50 real robot trials across five layouts, NavPatch achieves an overall success rate of 86.0%. An ablation study of four configurations with 200 runs in total shows that NavPatch improves the success rate from 70.0% to 86.0% and reduces the false commit rate from 68.4% to 40.7% compared with updates based only on the current observation.
Read the full abstract
Computation and Language
Neyshekar: An Open Persian Read-Speech Corpus for Automatic Speech Recognition
Neyshekar is presented as an open Persian read-speech corpus designed for coverage of both formal and informal language, named entities, and longer utterances. In version 6, 62,279 validated recordings totalling 99.02 hours are provided from 190 contributors, with 34,541 distinct recorded prompts. The prompt pool was assembled from human-written material, contextualised homographs, and reviewed language-model-generated text. Text entries were normalised with the shekar library, which supports both formal and informal Persian, and every submitted recording was reviewed against a common validation rubric. About 24% of released clips are classified as informal by an automatic classifier; these register labels are not human-validated. Item-level rater labels are provided for reproducible agreement estimation, opaque per-clip contributor identifiers make the speaker-disjoint partitioning auditable and support contributor-clustered uncertainty estimates, and a text-disjoint test subset is included for evaluation beyond previously seen prompts. Per-contributor recording load and reference-free signal quality are characterised for every released clip. Corpus characteristics are compared with Persian Common Voice under shared processing. Utility is assessed through two ASR architectures, three optimisation seeds, WER and CER, and independent evaluation on the public PSRB sample. Against duration-matched Common Voice training at approximately 32 hours, in-domain WER is reduced by 9.5 points for Whisper and 11.6 points for XLS-R, and by approximately eight points for both architectures on the independent PSRB sample. Transfer and mixture benefits are not consistently observed across architectures and training budgets. The corpus is released under CC0; code and data are made available through the project repository at https://github.com/amirivojdan/neyshekar.
Read the full abstract
Statistical Mechanics
Phase ordering kinetics in Light-Heavy-Vacancy model: unusual coarsening dynamics
We study a one dimensional lattice model of coupled driven system where two kinds of hardcore particle species, `light' and `heavy', move on a fluctuating landscape. Light particles prefer to move upward along the local height gradient of the landscape, and heavy particles prefer to move downhill. In addition, these particle species also exert bias on the local height profile. The unoccupied or vacant parts of the landscape experience no bias and undergo symmetric height fluctuations. In an earlier work, we had derived a phase diagram of the system consisting of different kinds of ordered and disordered phases. In the ordered phase, one or both particle species phase-separate, while the landscape forms a large hill or deep valley. Here we study coarsening by monitoring the development of long-range order in the particles and landscape from an initially disordered state. Unlike conventional phase-ordering systems, where coarsening proceeds through the formation and merger of ordered domains, here we find that domains formed at early times become unsustainable at later times. Instead of merging together, these early domains disintegrate and new domains emerge which finally give rise to large scale ordered structure in the long time limit, resulting a highly unusual coarsening behavior. For particle coarsening, the characteristic length scale grows with two distinctly different power law exponents at early and late times. The landscape coarsening is even more dramatic where the length scale decreases for brief time-intervals, instead of increasing continuously. The height fluctuations of the landscape shows periodic oscillations with time during the coarsening phase. Using linear hydrodynamics we explain that this is caused by three normal modes which move through the system like travelling waves. We calculate the propagation velocities of these modes within mean field approximation.
Read the full abstract
Soft Condensed Matter
Anisotropic Nanoparticle Rejamming Triggers Thermodynamic Cavitation in Elastomer Nanocomposites
Nanoparticles can dramatically reinforce elastomers while paradoxically causing cavitation at lower strains. Despite decades of research, the microscopic origin of this behavior has remained unsettled. Here, molecular dynamics simulations reveal that cavitation and failure arise from the nanoparticulate reinforcement mechanism itself. Initial jamming of the nanoparticulate network leads to a buildup of negative pressure in the elastomer matrix, reinforcing it and simultaneously driving it towards a cavitation limit. This crisis is initially averted by yield of the particle network. However, an anisotropic rejamming event of the nanoparticles ultimately drives a runaway negative pressure buildup that leads to cavitation and failure. These results identify nanoparticle-network-induced thermodynamic cavitation as the origin of void formation in elastomeric nanocomposites, and they establish collective filler dynamics as a potential point of control of ultimate failure.
Read the full abstract
Robotics
Fault Diagnosis for Underwater Vehicles using Moving Horizon Estimation and Gaussian Processes
This work proposes a model-based fault detection and diagnosis framework for underwater vehicles subject to actuator faults that explicitly accounts for the presence of unmodeled dynamics. To this end, a Moving Horizon Estimator (MHE) is developed to estimate the lumped disturbance, capturing both unmodeled and fault effects. Gaussian Processes (GPs) are employed to approximate the unmodeled dynamics, providing predictions of the corresponding mean and uncertainty across diverse operating conditions. During online operation, the residual between the MHE lumped disturbance estimate and the GP prediction is evaluated using a Generalized Likelihood Ratio Test. By incorporating GP-based predictions within the diagnostic framework, robustness to unmodeled dynamics is achieved, enabling effective fault detection and isolation as well as accurate quantitative estimation of fault magnitude. The proposed methodology is experimentally validated in a laboratory water tank, demonstrating reliable diagnostic performance under both open-loop and closed-loop control.
Read the full abstract
Number Theory
Asymptotic Formula for Biregular Overpartitions
Let $\bar{p}_{s,t}(N)$ be the number of overpartitions of $N$ into parts that are not divisible by $s$ or $t$. In this paper, we obtain asymptotic formulas for $\bar{p}_{s,t}(N)$ for relatively prime integers $s>t\ge 10$ via the saddle-point method. Our results cover different ranges of the parameters $s$ and $t$ relative to $N$. As an application, we show that $\bar{p}_{s,t}(N)$ satisfies higher-order Turán inequalities for all sufficiently large $N$ by using a result of Griffin, Ono, Rolen, and Zagier.
Read the full abstract
Quantum Physics
Controlling quantum state transfer in rooted products
Godsil and McKay (1978) showed that the rooted product is a powerful tool for constructing non-isomorphic cospectral pairs of graphs. Despite lacking a convenient tensor product structure, we show that the rooted product is useful for constructing graphs with good quantum state transfer properties. In particular, we prove a simple transference principle: if a graph $X$ has quantum state transfer and $Y$ is a controllable graph, their rooted product $X^Y$ has quantum state transfer (inherited from $X$). This complements a folklore property of Cartesian product which preserves perfect state transfer. However, the rooted product is a significantly sparser graph and, more importantly, can be easily used to construct efficient high-fidelity state transfer even if $X$ has no quantum state transfer. Our proof exploits the fact that a rooted product creates a large number of strongly cospectral pairs of vertices and that its condition number can be controlled by its pendant subgraph.
Read the full abstract
Plasma Physics
Ion-Acoustic-Like Modes in Ion-Loaded Pulsar-Wind Current Sheets: A Pressure-Balanced Existence Criterion
Pulsar wind electron–positron plasma lacks the heavy inertial species required for the conventional ion-acoustic-like compressive modes. However, if ions are mixed into the reconnecting striped-wind current sheet, a low-frequency compressive branch can appear. We develop a local, comoving-frame theory for such ion-acoustic-like modes in an ion-loaded, pressure-balanced pulsar-wind current sheet. The background model connects directly to pulsar observables through the light-cylinder magnetic field and Goldreich–Julian density, while the sheet structure is represented by a Harris-like field reversal and species-dependent compression factors. The pair species are treated as inertialess thermodynamic shielding populations, whereas the ions are described by a warm, nonrelativistic, magnetized fluid. Pressure balance fixes the pair and ion temperatures rather than prescribing them freely. This gives a closed expression for the pair-shielded ion-acoustic speed in terms of pulsar spin parameters. We derive the warm-ion electrostatic dispersion relation and discuss the conditions under which the ion-acoustic-like branch can exist in such a current sheet. We find that the ion-acoustic-like mode does not occur for all sheet parameters but is restricted to specific regions of parameter space. Thus, ion loading alone is not sufficient to sustain the mode; the local current-sheet conditions determine where an admissible ion-acoustic-like mode can exist. Consequently, any wave-driven anomalous dissipation or particle heating mediated by this mode must be highly localized rather than distributed uniformly across the striped wind. This framework provide the physical domain where the mode can exist, providing the necessary foundation for future studies of kinetic excitation and damping.
Read the full abstract
Astrophysics of Galaxies
Euclid: Data Release 1 (DR1) – Fornax-7, an ultra-faint companion to the Fornax dwarf spheroidal galaxy? A remote star cluster or dwarf satellite of the Fornax dSph
We report the discovery of an ultra-faint stellar system in the vicinity of the Fornax dwarf spheroidal (dSph) galaxy in Euclid DR1. This system, which we designate Fornax-7, is located $1.1$ deg from the centre of the Fornax dSph at about $145$ kpc, corresponding to a projected distance of $\sim 2.8$ kpc assuming the distance of the Fornax dSph. We characterise Fornax-7 using constraints from its colour-magnitude diagram (CMD), luminosity function (LF), and integrated optical colours from ground-based data. These observables are modelled jointly through a forward-modelling framework to constrain its distance modulus, stellar population properties, and total stellar mass. Assuming a low metallicity of $-2.2 \leq {\rm [M/H]} \leq -2.0$, similar to known ultra-faint systems around the Milky Way and the LMC, we derive a distance modulus consistent with that of the Fornax dSph. We estimate an age of $(10.4\pm1.9)$ Gyr and infer a stellar mass of $170^{+50}_{-62}$ solar masses. Relaxing the metallicity constraint and allowing for a wider range that covers the metallicity of the known old Fornax globular clusters (GCs), we find a metal-poor population but with a higher metallicity ${\rm [M/H]}=-1.4\pm0.3$, while the age, distance modulus, and mass remain mostly the same. These results suggest a likely physical association with the Fornax dSph. Fornax-7 may represent either an extremely remote star cluster associated with Fornax, a dwarf satellite of Fornax (i.e., a "satellite of a satellite"), or an independent ultra-faint satellite in the outer halo of the Milky Way. In all cases, it constitutes an exceptional system probing the lowest-mass regime of galaxy and star cluster formation, and the structure of dwarf galaxy haloes. Deeper photometric and spectroscopic follow-up observations are required to confirm both the nature of the system and its dynamical connection to Fornax.
Read the full abstract
Machine Learning
GNN4PPM: Multi-Target Predictive Process Monitoring with Relational Graph Convolutional Networks
Predictive Process Monitoring (PPM) aims at predicting at runtime and as early as possible the future states of a process execution. Common tasks include predicting the next event, the time to completion of a trace, and outcomes. Existing approaches typically consider an event from the perspective of the executed activities along with their timestamps and case identifiers. This leads to the disadvantage that in real-life settings, there is much more information recorded in the event log that is not captured or completely ignored when performing prediction tasks. We introduce GNN4PPM, an approach that predicts all next events along with their complete data payload at once. We represent event information in a heterogeneous knowledge graph that captures the event log as an RDF semantics, and train the embeddings with a Relational Graph Convolutional Network (R-GCN). Our approach is promising in comparison to existing solutions, and experiments with state-of-the-art solutions prove the accuracy and applicability of GNN4PPM in complex settings.
Read the full abstract
Quantum Physics
Proving olympiad geometry theorems on a superconducting quantum processor
Automated theorem proving seeks to use computational systems to prove or disprove mathematical and logical statements [1, 2]. It underpins a wide range of applications, and enhancing theorem-proving capabilities remains a central objective in artificial intelligence [3]. Although recent neuro-symbolic systems have achieved remarkable progress [4-7], their operation is ultimately constrained by classical computational architectures. Quantum computing [8], by contrast, enables information encoding and coherent parallelism beyond classical limits [9-14], raising the possibility of accelerating structured symbolic deduction [15]. Here we report the experimental realization of automated geometry theorem proving on a fully programmable superconducting quantum processor. We develop two complementary quantum proving frameworks. The first implements Wu's algebraic elimination method using quantum pseudo-division, with multivariate polynomials represented in superposition states, enabling quantum algebraic theorem proving. The second implements the full-angle method as backward symbolic reasoning through a hybrid quantum strategy-guided architecture, demonstrating a general route toward quantum symbolic proof search. As illustrative examples, we prove two theorems on a superconducting quantum processor: the perpendicularity of the diagonals of a square and a 1978 International Mathematical Olympiad geometry problem. Our results establish, at the experimental level, automated logical reasoning as a viable task for near-term quantum processors and provide a concrete pathway toward quantum-enhanced symbolic intelligence.
Read the full abstract
Analysis of PDEs
Linear ill-posedness of three-dimensional MHD boundary layer equations
We prove linear ill-posedness in tangential Sobolev spaces for the three-dimensional resistive MHD boundary layer equations. We assume that a suitable linear combination of the initial tangential velocity components has a non-degenerate critical point and that both initial tangential magnetic components have a double zero at the same point. Compared with the corresponding two-dimensional MHD result, our construction requires only this double-zero condition, rather than a higher-order degeneracy of the magnetic shear. The proof combines the three-dimensional Prandtl critical layer construction with a vector correction to the two-dimensional magnetic quotient. This correction cancels the leading terms in both induction equations while preserving the magnetic divergence constraint. The resulting approximate solutions grow like $\exp(\sigma t/\sqrt{\varepsilon})$, and their residuals have a prefactor of order $O(\varepsilon^{-3/8})$, up to logarithmic factors. A Duhamel argument then yields linear ill-posedness for every tangential derivative loss $\mu<\frac18$. Thus the three-dimensional Prandtl instability persists when the stabilizing tangential magnetic field degenerates.
Read the full abstract
Machine Learning (Statistics)
Multi-source conformal prediction: leveraging heterogeneity via localization
Many modern prediction tasks involve data from multiple heterogeneous sources, while the test distribution may differ substantially from any individual source. Although heterogeneity poses challenges, it also offers an opportunity: different sources may provide complementary information, with some regions of the feature space better represented in one source than another. We propose Multi-Source Randomly Localized Conformal Prediction (MS-RLCP), which builds on the local coverage properties of randomly localized conformal prediction (RLCP) (Hore and Barber, 2025) and extends it to multiple sources through data-adaptive source selection. Under the widely adopted assumption of a shared response distribution conditional on the features across sources and the test population, we establish finite-sample coverage bounds using an interpretable notion of envelope distribution that captures their aggregate feature-space representation. Our analysis allows the test feature distribution to be absolutely continuous with respect to the envelope, extending beyond mixtures of source distributions. Under additional regularity conditions, we also establish asymptotic test-conditional coverage. Simulations and real-world experiments demonstrate the effectiveness of MS-RLCP across varying levels of data heterogeneity.
Read the full abstract
Computer Vision
Sharing standardized image-derived data in computational pathology using DICOM
Development and evaluation of computational pathology methods require access to large and diverse datasets. Over the past decade, various initiatives invested significantly into collecting, centralizing, and sharing pathology imaging data. In contrast, sharing of image-derived data such as region-of-interest delineations or segmentation masks is less well developed. In this work, we describe our approach to encoding and sharing image-derived pathology data in a standardized manner within the National Cancer Institute (NCI) Imaging Data Commons (IDC), a platform that hosts and provides public access to de-identified radiology and pathology data. The IDC relies on the Digital Imaging and Communications in Medicine (DICOM) standard for data harmonization, yet the adoption of DICOM for pathology image-derived content has remained largely unexplored until now. Here, we present five representative datasets harmonized by conversion from their original representations into DICOM and shared publicly in the IDC. We demonstrate the benefits of this harmonization, describe contributions to critical open-source tooling, and discuss technical considerations relevant to broader adoption of DICOM for pathology image-derived data.
Read the full abstract
Quantum Physics
Parameter-Efficient Quantum NLP for Paraphrase Detection: Performance, Robustness, and Entanglement
Rigorous empirical validation of quantum machine learning on natural language tasks remains scarce. We evaluate a 10-qubit hybrid quantum-classical variational circuit (2,148 parameters) for paraphrase detection across three benchmarks: MRPC, Quora Question Pairs (QQP), and adversarial PAWS. On QQP (n = 10 seeds), the circuit achieves 75.53% +/- 0.75%. accuracy, statistically outperforming parameter-matched classical baselines (DeepMLP: p = 0.015, Cohen's d = 1.20; F1: p < 0.001, d = 2.32) and surpassing DistilBERT-4bit with 31,191 fewer parameters. On MRPC the optimal 2-layer variant reaches 92% of BERT-base accuracy at 54,000 lower parameter cost. Circuit depth analysis reveals a dataset-depth scaling effect; entanglement analysis via the Meyer-Wallach measure identifies multi-qubit entanglement as the primary performance driver (r = 0.85 across four variants). Adversarial evaluation on PAWS reveals emergent robustness: 98.2% recall versus 81.6% classical (+16.6 pp, d = 1.24, p < 0.001), without adversarial training. These results constitute the first systematic parameter-matched multi-benchmark empirical validation of hybrid variational circuits for NLP. All results are from classical simulation; hardware validation is future work.
Read the full abstract
Computation and Language
Theseus in the Graph: Towards Traceable Multi-Hop Graph Navigation
Multi-Hop Knowledge Graph Question Answering (KGQA) tasks require models to assemble relational evidence along paths in a KG to answer natural-language questions. However, existing KGQA systems typically focus on predicting the final answer without explicitly modeling or validating the intermediate reasoning steps, obscuring whether the correct answers arise from faithful multi-hop reasoning. To address this limitation, we re-frame multi-hop KGQA as a question-conditioned graph navigation problem. We refer to this formulation as THESEUS - Traceable Hop-wise Evidence SEarch in a Unified Semantics. In this setting, an agent receives a KG, a question, and a topic entity, and traverses a sequence of relations towards the answer, making the reasoning path explicit. To systematically study this formulation, we provide three key contributions. (i) We augment the existing KINSHIP and MQuAKE resources into navigation-ready KGQA datasets with annotated evidence paths and paraphrased questions. (ii) We design evaluation protocols to measure path fidelity, robustness to linguistic variation, and performance across multi-hop and multi-answer questions. (iii) We adapt established path-based KG completion agents - MINERVA, MultiHopKG, and SQUIRE - to operate on full question embeddings rather than symbolic single-relation queries, enabling their trajectories to be guided by natural-language semantics. Together, these contributions advance KGQA research toward systems where traceability is fundamental: answers are accompanied by explicit reasoning paths whose agreement with reference evidence can be systematically evaluated.
Read the full abstract
Programming Languages
Equality saturation theory exploration à la carte
Rewrite rules are critical in equality saturation, an increasingly popular technique in optimizing compilers, synthesizers, and verifiers. Unfortunately, developing high-quality rulesets is difficult and error-prone. Recent work to automatically infer rewrite rules does not scale to large terms or grammars. Users struggle to guide inference and incrementally construct rulesets because existing rule inference tools are monolithic and opaque. As a result, most equality saturation users still manually develop and maintain rulesets. This paper proposes Enumo, a new domain-specific language for programmable theory exploration. Enumo provides a small set of core operators that enable users to strategically guide rule inference and incrementally build rulesets. Short Enumo programs easily replicate results from state-of-the-art tools like Ruler, but Enumo programs can also scale to infer deeper rules from larger grammars than prior approaches. Enumo's composable operators even facilitate developing new strategies for ruleset inference. We introduce a new fast-forwarding strategy which does not require evaluating terms in the target language, and thus supports domains that were out of scope for prior work. Enumo is also easy to extend: two new operators suffice to incorporate large language models into rule inference, where they complement guided search. We evaluate Enumo and fast-forwarding across a variety of domains. Compared to state-of-the-art techniques, Enumo can synthesize better rulesets over a diverse set of domains, in some cases matching the effects of manually developed rulesets in systems driven by equality saturation.
Read the full abstract
Number Theory
Elimination of René Peschmann's 968 Remaining Hard Fibers for the Perfect Cuboid Problem
Recently, René Peschmann proved perfect-cuboid nonexistence on 1,072 explicit master-tuple fibers with $\max(m,n)\le100$, leaving 968 fibers in the same bounded parameter range. In this paper, I eliminate all 968 remaining fibers. Most fibers fall to fairly short rank-zero or covering arguments, while the final cases need the stronger local-global sieves. Together with Peschmann's theorem this excludes perfect cuboids on all 2,040 admissible fibers with $m\le100$; the result is still a bounded-fiber theorem rather than a proof of the full perfect-cuboid conjecture.
Read the full abstract
Combinatorics
Retained-Set Descent for Diagonal Ramsey Numbers
We study how far a fixed Ramsey upper bound can be improved by descending through blue neighborhoods in one vertex set while keeping a second set fixed. A weighted inequality in the two set sizes determines when the descent can stop. For the source bound specified here, the infimum diagonal exponent over all finite derivations lies in $[1.305,\,1.307]$. A finite derivation gives $R(k,k)\le3.69507^k$ for all sufficiently large $k$; a concave polygon proves the lower bound for every finite depth. We also characterize the infimum as a greatest fixed point and show that every larger exponent has a finite derivation valid uniformly for nearby clique-size ratios.
Read the full abstract
Quantum Physics
Preparation of Multimode NOON States via Floquet-Engineered Conditional Chiral Excitation
The NOON states possess Heisenberg-limited phase sensitivity and are crucial for quantum-enhanced metrology. In our work, we develop a Floquet-engineered conditional-routing framework in which a $d$-level quantum controller mediates the dynamics of $d$ bosonic modes. For an arbitrary odd dimension $d=2s+1$, the $d$-level system can act as a “quantum knob" by tuning its initial states to coherently control the direction of chiral excitation flow, such that different controller eigenstates generate distinct cyclic-routing branches of the bosonic excitations. By choosing $s$ harmonics, we construct an exact qudit-controlled cyclic permutation and use it to formulate a general protocol for preparing odd-$d$-mode NOON states. The same framework also enables programmable complex amplitudes through appropriate preparation of the controller state. As concrete realizations, we show that the three-mode case requires only a single harmonic and exhibits two oppositely directed chiral branches together with a stationary branch, whereas the five-mode case requires two harmonics and both nearest- and next-nearest-neighbor chiral hoppings. Meanwhile, taking the three-mode realization as a representative example, we assess the influence of systematic imperfections and dissipation on the conditional-routing dynamics and identify parameter regimes in which the routing operation remains accurate. Our results establish a systematic Floquet construction for controllable chiral routing and multimode NOON-state generation in arbitrary odd-dimensional networks, with potential applications in quantum information processing and quantum metrology.
Read the full abstract
Computer Vision
Selective Tool Use for Agentic Change Visual Question Answering in Remote Sensing
Change visual question answering (Change VQA) requires understanding semantic changes across bi-temporal remote sensing images. Although vision language models (VLMs) have shown promising performance on this task, they remain unreliable when answering questions that require explicit transition statistics, area measurements, or spatial information. To address this limitation, we propose a selective tool use framework in which a single VLM either answers directly or invokes a deterministic change analysis tool to obtain question specific evidence. Specifically, the selected tool operates on bi-temporal semantic maps and returns a structured observation, which the same VLM uses to generate its final answer. To support this framework, we construct a tool augmented extension of CDVQA covering eight question families and three tools for transition, spatial, and temporal analysis. Tool use supervision and observations are derived automatically from the original semantic annotations, without additional manual labeling. We then adapt Qwen3.5-4B using Low Rank Adaptation (LoRA) to jointly learn direct answering, tool invocation, and evidence conditioned answering. Experiments on 7,164 test questions show that selective tool use with reference semantic maps improves overall accuracy from 73.77% to 88.79% and average family accuracy from 69.11% to 89.65%. When the semantic maps are predicted automatically, the framework achieves 77.47% overall accuracy and 75.06% average family accuracy. These results demonstrate the benefit of question-specific semantic evidence for Change VQA, while highlighting the influence of semantic prediction quality on the resulting performance. Code and tool-augmented annotations will be made publicly available at https://github.com/yakoubbazi/ToolChangeVQA.
Read the full abstract
Geometric Topology
Delta-Unknotting Number for Montesinos Knots
The $\Delta$-unknotting number for a knot is defined as the minimum number of $\Delta$-moves needed to deform the knot into the trivial knot. In this paper, we determine the $\Delta$-unknotting numbers for certain families of Montesinos knots. Using results on pretzel knots and two-bridge knots, we prove that for these families the $\Delta$-unknotting number equals the absolute value of the second coefficient of the Conway polynomial. In particular, every positive pretzel knot belongs to these families, and certain two-bridge knots also belong to them.
Read the full abstract
Computer Vision
CGGT: Curve-Grounded Geometry Transformer for 3D Parametric Curve Reconstruction
Recovering editable 3D parametric curves from 2D images is a fundamental challenge in computer graphics, bridging pixel-based perception and vector-based CAD modeling. Existing NeRF- and 3DGS-based methods often rely on dense calibrated views, precomputed 2D edge maps, and costly per-scene optimization, limiting their applicability to casually captured real-world inputs. We propose CGGT, a Curve-Grounded Geometry Transformer that directly grounds 3D-consistent 2D curve instances in the image space from sparse, unposed multi-view images. CGGT combines a geometry-aware transformer encoder for multi-view feature learning with a curve-aware masked-attention decoder for cross-view instance association. In a single forward pass, it predicts camera parameters, dense depth maps, and instance-level 2D curve masks, which are then lifted into 3D and refined through a fast parametric optimization stage to recover compact, editable 3D curve primitives. To support structured curve learning, we introduce Wireframe-100K, a large-scale dataset comprising 100,000 CAD models with diverse topologies, realistic multi-view renderings, and accurate parametric curve annotations. Extensive experiments show that our framework achieves substantial improvements in both reconstruction accuracy and efficiency, particularly under challenging sparse-view settings and in separating persistent 3D structural edges from view-dependent image edges caused by silhouettes, textures, and appearance variations. Despite being trained solely on synthetic data, CGGT generalizes well to real-world images, demonstrating its potential for practical CAD-style wireframe reconstruction from unconstrained visual inputs.
Read the full abstract
Geometric Topology
Unknotting number and L-space satellite operations
We give a lower bound for the unknotting number under the L-space satellite operations. In the case of braided L-space satellite operations, including cabling operations, we obtain a stronger bound. The proof uses a lower bound for the unknotting number in knot Floer homology due to Alishahi-Eftekhary. The computational tool is a formula for computing the knot Floer complex under the L-space satellite operations, which was defined in the authors' previous work.
Read the full abstract
Quantum Physics
Robustness of Hidden-Variable Theories and Matrix Scaling
Motivated by quantum foundations and complexity theory, Aaronson formalized a hidden-variable theory inspired by a proposal by Schrödinger. To any quantum state and unitary, this Schrödinger theory assigns a joint probability distribution via the Sinkhorn algorithm: rescale the columns and rows of the entrywise modulus of the unitary so that the marginals match the Born rule for the initial and final quantum states, respectively. He conjectured that this map is robust, i.e., inverse polynomially small perturbations in the inputs lead to inverse polynomially small perturbations of the joint distribution, which is important for complexity theoretic applications. We present a counterexample to this conjecture: We construct a pure state and two unitaries that are exponentially close, yet the joint probability distributions assigned by the Schrödinger theory differ by at least an inverse-linear term in at least one entry, and by a constant in total variation distance. We also propose a modified version of Schrödinger's theory that satisfies robustness, while retaining all of its other desirable properties. This yields a complete picture of which axioms of Aaronson can be simultaneously satisfied by hidden-variable theories.
Read the full abstract
Solar and Stellar Astrophysics
Stripped helium stars in UV
The model of Galactic population of stripped helium stars, the remnants of $5 \lesssim M/M_\odot \lesssim 24$ primary components of close binaries after RLOF is presented. These stars emit in the UV range of the spectrum and may be observed by detectors aboard planned "Spektr-UV" (WSO-UV) space telescope. For the current star formation rate in the Galaxy 2$\mathrm {M_\odot yr^{-1}}$, the estimate of the number of 1 to 7 $M_\odot$ objects with $T_{\rm eff} \gtrsim$25,000\,K ranges from 14700 to 28500. The number of 2 to 7 $M_\odot$ objects is 3200 to 5500. The main evolutionary factor influencing the estimate is possible formation of common envelopes and merger of components in them. Detection of candidate stripped helium stars by UV-excess is hampered by the dominance of main-sequence companions to stripped helium stars in the combined spectra of binaries. This effect of observational selection may reduce the number of candidate stripped helium stars potentially detectable by photometry to $\lesssim 1000$.
Read the full abstract
Networking
Toward a Layer-2 Trigger for AI/ML Lifecycle Management in 6G
3GPP has progressively expanded AI/ML lifecycle management in the radio access network, from one-sided model control to Release 20 support for two-sided CSI-feedback model pairing. Yet a basic control question remains: when monitoring detects degradation, how quickly must a corrective action take effect? To expose this dependency, we stress-test three activation and rollback strategies in a surrogate regime-shift environment using 150 independently trained PPO candidate policies, each evaluated over 20 matched noise realizations. We add 0-40 control-step delay only to corrective lifecycle commands. With no added delay, stability-gated blending reduces mean post-shift cumulative SLA deficit from 47.02 to 7.57 violation-steps relative to hard cutover; at 40 steps, the deficit rises to 44.38, only 5.6% below the hard-cutover baseline. KPI-threshold rollback loses its advantage within only a few control intervals, while blending degrades more gradually. These results do not set a physical 6G latency bound. They show why timing requirements matter for corrective actions: lifecycle performance depends on when the command takes effect. Motivated by Layer-1/Layer-2 Triggered Mobility, we examine a standards split in which Layer 3 retains lifecycle configuration while a compact Layer 2 trigger is considered only for the latency-critical subset, together with pair-consistency, local-fallback, and security/freshness requirements.