Number Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Thursday 10 September
Recently, Li obtained a mean Lindelöf estimate for the cubic moment of the central values of Maass form symmetric square $L$-functions over short intervals $(T-H, T+H)$ of length $H \ge T^{18/19+\epsilon}$. We improve this result by showing that the estimate holds for $H \gg T^{6/7+\epsilon}$. The key ingredient in our proof is a new asymptotic formula for the second twisted moment of Maass symmetric square $L$-functions. Based on this formula, we also improve the lower bound for the proportion of non-vanishing central $L$-values in short intervals. Previously, even under the assumption of the Lindelöf hypothesis for Dirichlet $L$-functions, the proportion of non-vanishing values in intervals of length $H = T^{\beta}$ was only known to be at least $\frac{3\beta-1}{4}$. We establish an unconditional lower bound of $\frac{7\beta-2}{8}$.
Optimization and Control
Minimal null control time of some 1D linear hyperbolic balance laws with constant coefficients and properties of related kernel equations
In this work, we study the null controllability by one-sided boundary controls of one-dimensional hyperbolic balance laws with constant coefficients. Our first result shows that, when the system has only one negative or positive speed, the minimal null control time of such systems depends on some orthogonality conditions for a particular sequence. This sequence is explicit in function of the coefficients of the system but it is defined by a nonlinear recurrence relation. Our second result then completes the previous one by giving explicit bounds on the number of orthogonality conditions that have to be checked in two nontrivial situations. The proofs rely on a careful analysis of the so-called kernel equations associated with the system, including a new well-posedness result. Our results are also valid for the finite-time stabilization property.
Read the full abstract
Computation and Language
Overview of the NLPCC 2026 Shared Task 11: Agent-Based Experiment Reproduction from Scientific Papers
Reproducibility is essential to scientific progress, yet the growing volume and complexity of scientific publications make exhaustive manual verification increasingly impractical. Although recent advances in large language model (LLM) agents enable automated experiment reproduction, existing evaluations largely focus on final repositories and are typically limited to machine learning (ML). We introduce AgentActionBench, a process-oriented benchmark for evaluating agent-based experiment reproduction across ML and AI4Science domains. Our framework uses an MCP-based Action Recorder to capture agents' behaviour throughout the reproduction process and evaluates the resulting traces with paper-specific rubrics. AgentActionBench contains 150 papers, including 120 ML papers and 30 AI4Science papers. A human-annotated subset covering 10% of the benchmark provides validation data, while model-assisted augmentation expands the full benchmark to more than 10,000 rubric items. Experimental results show that current systems remain limited, with execution as the primary bottleneck. Meanwhile, the strong Pearson and Spearman correlations between model-generated and human-annotated rubrics validate the reliability of our scalable rubric-generation approach.
Read the full abstract
Optimization and Control
Cooperative Integer Programming Games: Core Stability and Optimal Coalition Structures
We introduce cooperative integer programming games (CIPGs), in which agents pool budget constraints to accomplish indivisible tasks jointly and the characteristic function maps every coalition to the optimal value of a pooled integer program. Our goal is to identify an optimal coalition structure (OCS) and a stable one (OSCS). We derive a stability inequality that keeps each formed coalition in the Core with respect to itself, and present two mixed-integer OCS formulations, aggregated and disaggregated, proving that the disaggregated formulation is integer-equivalent yet yields a tighter LP relaxation. Building on the stability inequality we develop lifted stability cuts, several separation strategies inside a cutting-plane algorithm, an SCS-feasible primal heuristic that constructs warm starts with guaranteed stability, and a payoff-refinement step computing the Shapley value and the nucleolus of every formed coalition. On benchmark cooperative knapsack games, the method certifies optimality with up to 16 players and reaches MIP gaps below 1% at 30 players while evaluating 766 of the roughly $10^9$ coalition values.
Read the full abstract
Artificial Intelligence
Benchmark Radar: A Living Database and Search Engine for AI Benchmarks and Evaluation
Benchmark researchers and developers of large language models (LLMs) and other AI systems need to find relevant evaluations, locate their benchmark datasets and code, and understand the settings behind reported scores. We present Benchmark Radar, a living database and search engine for retrieval and discovery of AI benchmarks, covering LLM evaluation, agentic and tool-use benchmarks, coding, reasoning, safety, and domain-specific evaluations. The system combines daily discovery of benchmark papers, repositories, datasets, and releases with a searchable benchmark catalog, mentions in model cards and technical reports, and score histories. It retains source identities and citations so readers can inspect candidate benchmarks and their evaluation evidence. Daily discovery draws on 37 sources: 13 direct connectors and 24 first-party research and engineering feeds. The catalog contains 1,283 source records drawn from 4 benchmark catalogs and 12,916 numeric observations on 790 records. We describe collection and retrieval, audit the full catalog, and examine benchmark saturation, adoption trends, and the limits of score comparisons. A worked example walks through a complete prior-art search, showing how to query the catalog and inspect benchmark evidence when designing a new evaluation. We release the web dashboard with a benchmark leaderboard, a Pareto frontier view of score against measured use, saturation and trend views, daily feeds, downloadable evidence, a command-line interface (CLI) for offline queries, and reproducible analysis.
Read the full abstract
Materials Science
High-Performance Scaled P-Type SnOx Transistor by Atomic Layer Deposition with CFET Integration
The development of high-performance p-type oxide semiconductors is essential for realizing complementary logic for monolithic 3D integration, yet p-type oxide semiconductors still exhibit substantially inferior performance compared with their n-type counterparts. In this work, we demonstrate high-performance p-type SnOx transistors by atomic layer deposition (ALD), as back-end-of-line compatible devices for monolithic 3D integration. The SnOx transistors exhibit high field-effect mobility of 6.9 cm2/Vs, low subthreshold swing (SS) of 185 mV/dec, decent on/off ratio (ION/IOFF) of 1.8*104 and high bias stability. By scaling the channel length down to 80 nm, a high on-current of 38.7 mA/mm at VDS of -1 V is achieved. It is understood that precursor and reaction engineering to suppress Sn4+ component in SnOx film are the key for performance enhancement. Furthermore, a complementary field-effect transistor with ALD SnOx p-FET vertically stacking on ALD In2O3 n-FET is also demonstrated, achieving maximum voltage gain of 21 V/V at VDD of 4 V. These findings suggest ALD SnOx as a promising candidate for scaled high-performance BEOL p-type transistors.
Read the full abstract
Applied Physics
Scattering-robust Imaging of Azimuthal Features with Enhanced Resolution
Imaging through scattering media remains a long-standing challenge in numerous real-world applications, ranging from medical imaging to long-distance sensing. Recently, illumination consisting of a single orbital angular momentum (OAM) mode, which is structured in the azimuthal coordinate, has been shown to provide enhanced resolution for imaging objects with azimuthal features, with the resolution becoming maximum at an optimal OAM value. However, in the presence of scattering, single-mode fields, which are spatially fully coherent, cause the imaging resolution to decrease significantly due to speckle formation. In this work, we employ azimuthally partially coherent fields and experimentally demonstrate imaging of azimuthal features with enhanced resolution in the presence of scattering. We show that lower degree of azimuthal coherence in such illumination leads to increased robustness against scattering while the azimuthal structure of the illumination ensures enhanced resolution. We derive the condition for best imaging resolution, and we report increase of imaging contrast in scattering from about 7% to 50% as the illumination is changed from a single-mode fully coherent field to that of an azimuthal partially coherent field.
Read the full abstract
Fluid Dynamics
A Novel Multi-fidelity Surrogate for Efficient Turbine Design Optimization
To solve the turbine design optimization problems efficiently, surrogate-based optimization (SBO) algorithms are frequently used. To further reduce the cost of turbine design, the multi-fidelity surrogate (MFS) based optimization is proposed by the researchers, who resort to augmenting the small number of expensive high-fidelity (HF) samples by a large portion of low-fidelity (LF) but cheap samples in surrogate modeling and optimization process. Nonetheless, according to our observations, the MFS based optimization sometimes can only have better convergence rate at the early stage of optimization process, but yielding worse final solution than the single-fidelity surrogate (SFS) based optimization that uses high-fidelity samples alone. The reason behind can be explained as follows. With the increase of HF samples in the optimization process, the LF samples can cause negative effect and therefore misleading the optimization search. To address the above issue, an ensemble weighted multi-fidelity surrogate (EMFS) is proposed. Specifically, the density-based spatial clustering of applications with noise (DBSCAN) is used to detect the region where the MFS cannot build a more accurate surrogate, and a local SFS is built there. Then, an EMFS is built by combining the MFS and SFS with adaptive weights, which is used to guide the optimization process. The related algorithm is named as multi- and single-fidelity surrogate fused optimization, i.e., MSFO. Through tests on GE-E3 blade optimization and the film cooling layout design of a turbine endwall, the effectiveness of proposed MSFO is well demonstrated.
Read the full abstract
Fluid Dynamics
A Novel Multi-fidelity Surrogate for Turbomachinery Design Optimization
Turbomachinery design optimization involves expensive black-box problems. Sample-efficient multi-fidelity optimization (MFO) offers an efficient solution. By utilizing multi-fidelity surrogates (MFS), the MFO algorithm can use fewer high-fidelity samples aided by low-fidelity samples to establish an accurate surrogate model. However, when MFS is used in sequential sampling optimization, it has been observed that the final optimal solution obtained by single-fidelity optimization (SFO) is better than that of MFO, even though MFO performs better at the early stages. This can be attributed to the assumption of an even and nested distribution of samples, which is incorrect when using a sequential adding strategy. To address these issues, we propose a novel algorithm called multi-single-fidelity optimization (MSFO) to overcome the limitations of the conventional MFO procedures. In the surrogate establishment of MSFO, we use the density-based spatial clustering of applications with noise (DBSCAN) method to detect local areas where low-fidelity samples are no longer effective. A combination of both global MFS and local single-fidelity surrogate model, built using high-fidelity samples alone, is used to establish an ensemble, which improves the anti-interference ability of the algorithm against misleading low-fidelity data. The effectiveness of the MSFO algorithm is verified first on numerical benchmark functions. Then, the algorithm is used to optimize the aerodynamic profile of a turbine and the film cooling layout design of a turbine endwall. Here, high-fidelity sample sources are obtained from fine-mesh CFD simulations, whereas low-fidelity sample sources are obtained from the same simulations run on a coarser mesh. The results demonstrate that our MSFO algorithm performs significantly better than the conventional SFO and MFO processes, with a higher level of robustness.
Read the full abstract
Audio and Speech Processing
Low-Latency State Space Voice Activity Detection with Robust Onset Time Evaluation
Voice Activity Detection (VAD) systems are commonly evaluated using metrics such as the area under the receiver operating characteristic curve (AUROC), but these metrics do not account for temporal responsiveness. For low-latency applications, however, accurately measuring speech onset delay is essential. This is particularly challenging because onset latency evaluation is affected by noise and systematic misalignment in annotation timestamps. In this work, we introduce a probabilistic framework for evaluating VAD onset time under noisy temporal labels. We model annotated onset times as noisy observations of latent acoustic onsets and estimate the resulting discrepancy distribution from data. We show that this approach provides a more stable and robust estimate of algorithmic latency. In addition, we introduce S4VAD, the first state-space-model-based (SSM-based) VAD architecture. S4VAD supports efficient streaming inference while directly controlling the decay of past acoustic evidence, enabling fast and responsive speech-onset detection. We evaluate VAD onset latency across several low-latency architectures, including CNN, Transformer, and RNN models. Our proposed VAD achieves the lowest latency while maintaining a competitive AUROC.
Read the full abstract
Human-Computer Interaction
How AI Coders Discuss, Disagree, and Reach Consensus: Challenges and Opportunities for LLM-Based Qualitative Coding
The utility of AI in multi-coder qualitative coding has been widely discussed, yet little empirical evidence exists to delineate the contexts in which it performs reliably. We address this gap by quantifying the effectiveness of multi-agent LLM coding across varied qualitative datasets, revealing key contextual and structural factors that mediate coding outcomes. We developed a literature-informed baseline pipeline that enables AI agents to independently code, debate, and reconcile disagreements. Results revealed that coding accuracy depends on factors such as codebook length, qualitative data similarity, and agent disagreement. Notably, intense and unresolved debates between agents led to higher accuracy. Our analysis showed that while LLMs emulate many human discussion behaviors, they lack adaptive responsiveness to context. From these findings, we offer design recommendations for building automated coding systems. Our open-source AI discussion dataset and methodological framework lay the groundwork for advancing the design of AI-mediated automated thematic analysis.
Read the full abstract
Multiagent Systems
But How Would AI Agents Run a Town's Economy?
We placed 100 memory-equipped large language model (LLM) agents in charge of a closed, money-conserving spatial economy on real Pokhara Lakeside geography (earning wages, running businesses, setting prices) and ran this multi-agent simulation for up to 26 simulated weeks, well past the 1-2 weeks typical of agent-society studies. Across 91 validated runs (2.44M agent decisions, 21.5B tokens), the money stops moving, in a specific and measurable way. A 12x tourist demand shock raises business revenue 4.62x ($p<0.001$), which we decompose exactly into a 1.50x extensive margin (more businesses trading) and a 3.07x intensive margin (more revenue each). Monetary transmission stops there. Wages move 1.03x ($p=0.42$); 0.3% of 3,981 menu items are ever repriced ($p=0.47$). A randomized cash transfer (NPR 5,000 to 20 of 100 agents) shows the same pattern from the opposite direction: 96.7% is still held 311 pulses later, marginal propensity to consume 3-4% by two independent measures, indistinguishable from zero. The wealth distribution is consequently near-frozen at the horizon this literature uses ($\rho=0.964$ over 2 simulated weeks), but not frozen. $\rho$ falls to 0.832 at 12 weeks and 0.752 at 26, a horizon-dependence no short study can see. Matched ablations show which knob actually matters. Swapping the backing LLM moves every outcome we measure ($p=0.0039$); deleting agents' memory moves none of them detectably. A purely social tool fails 94-97% of the time across two model families, compared with ~96% success on economic tools, with no measurable shift away from it. Every headline number is verified twice, by a live validator and by an offline recomputation that reconciles each agent's wealth against its own signed transaction history, and we release the full run corpus for reanalysis.
Read the full abstract
Algebraic Geometry
Coupled Pklt Tuples and Varieties of Pklt Type
We introduce asymptotic multiplier ideal sheaves and log canonical thresholds associated with tuples of pseudoeffective divisors on a projective klt pair. We prove that the threshold of a coupled potentially klt tuple is computed by a quasi-monomial valuation. For varieties of potentially klt type, we prove that every big divisor admits a birational Zariski decomposition with semiample positive part. We also prove finite generation of multisection rings of big divisors and give a criterion for a variety of potentially klt type to be a Mori dream space.
Read the full abstract
Number Theory
A $p$-adic monodromy theorem for curves
We prove that every de Rham $p$-adic local system on a smooth projective curve over a $p$-adic field is potentially semistable; that is, it becomes semistable after pulling back along a finite cover of the curve. This establishes a relative version of the classical $p$-adic monodromy theorem of Berger and André–Kedlaya–Mebkhout. Along the way, we show that every $p$-adic differential equation near a type I\!V point on a curve becomes trivial after a finite étale extension.
Read the full abstract
Optimization and Control
The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case
We extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is, for the first time, the ability to consider more than two sets, a task which has been in the mind of researchers for many years without much success in fulfilling it because of a certain theoretical obstacle related to cycles and minimizers of general functionals. The other direction is the ability to handle each set as an intersection of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to these extensions is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fejér monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.
Read the full abstract
Astrophysics of Galaxies
Nitrogen-Loud Quasars from the Dark Energy Spectroscopic Instrument. I. Sample Selection and Basic Properties
We present the largest sample to date of nitrogen-loud (N-loud) quasars with strong broad N IV] $\lambda1486$ and/or N III] $\lambda1750$ emission lines over the redshift range $1.6 < z < 4.3$, selected from the Dark Energy Spectroscopic Instrument (DESI) Data Release 1. The final sample contains 1,993 N-loud quasars, corresponding to about 1.2% of the parent quasar sample. The $L_{1450}$ distribution of the N-loud quasars is broadly similar to that of the DESI parent sample, but their redshift distribution is distinct, with a stronger concentration around $z \sim 2.5$–3. Their composite spectrum displays a broadly similar UV continuum shape to that of the parent quasars, while showing significantly enhanced broad nitrogen emission features, including N V, N IV], and N III]. Other metal emission features also show a moderate enhancement. Relative to a control sample matched in redshift and UV continuum luminosity, the N-loud quasars show systematically narrower broad C IV and Mg II emission lines, lower single-epoch virial black hole masses, and higher Eddington ratios, suggesting that N-loud quasars may preferentially appear during a relatively rapid black hole accretion phase. The radio-loud fraction is 10.1%, with the highest fraction among objects exhibiting both N III] and N IV] emission. The catalog provides a statistical baseline for future studies of nitrogen enhancement and its physical origin.
Read the full abstract
Nuclear Theory
Classification of fission modes in $^{236}$U using a six-dimensional Langevin approach
Thermal neutron-induced fission of $^{235}$U is studied using a six-dimensional Langevin approach based on the Cassini shape parametrization. Scission events are classified into Asymmetric 1 (AS1), Asymmetric 2 (AS2), and Superlong (SL) fission modes by applying the $k$-means algorithm to the fragment mass and the quadrupole deformations of both fragments. For each mode, proton and neutron single-particle levels are calculated for representative fragments to examine their shell structures. The AS1 heavy fragment exhibits proton gaps at $Z=50$ and 52 and neutron gaps at $N=82$ and 84, whereas well-developed gaps appear at $Z=56$ and $N=88$ in the AS2 heavy fragment. The mass splits of AS1 and AS2 are close to those of the conventional Standard I and Standard II modes, respectively. However, the average total kinetic energy is lower for AS1 than for AS2, opposite to the conventional ordering of Standard I and Standard II. This reversal reflects the more elongated shape of the AS1 light fragment. The SL mode is conventionally interpreted in terms of macroscopic liquid-drop effects, whereas the pronounced proton shell gap at $Z=46$ suggests that proton shell effects also contribute to the elongated symmetric configuration. The classification based on fragment mass and the quadrupole deformations of both fragments provides a basis for distinguishing fission modes and examining the corresponding fragment shell structures at scission.
Read the full abstract
Complex Variables
The two-dimensional Matkowski–Sutô equation with holomorphic and strictly increasing generators
We study the two-dimensional Matkowski–Sutô equation, which asks for two quasi-arithmetic means whose sum is twice the arithmetic mean, in two settings. For holomorphic injective generators with convex images on a convex domain in the complex plane, the solutions are exactly the affine pairs and the exponential pairs with a nonzero complex exponent, up to affine changes of the generators. The admissible exponents depend on the shape of the domain and are described by a curvature criterion for its boundary. In the monotone-operator framework of Tóth, we construct an infinite-dimensional family of non-affine shear pairs on the whole plane. Their generators are strictly increasing in the sense of monotone operators and need not be differentiable. These pairs solve the weighted equation for any number of variables. The rigidity of the one-dimensional problem, due to Daróczy and Páles, persists under holomorphy but not under monotonicity.
Read the full abstract
Computation and Language
ProMediConv: Benchmarking Proactive Conversational Agents in Legal Dispute Mediation
Dispute mediation is essential for maintaining social harmony and resilience, yet developing skilled mediators is costly and time-consuming. Existing LLM-based mediation research remains limited by unrealistic task formulations, low-fidelity datasets, and coarse evaluation metrics that obscure turn-by-turn dynamics. To address these gaps, we introduce ProMediConv, a novel benchmarking framework that models mediation as a proactive, multi-stage, and party-aware dialogue process incorporating 11 mediation strategies and four party behavior pattern (BP) states. Using 972 complete real-world cases, we construct a high-fidelity mediation dataset with utterance-level annotations of strategies and BP states. Furthermore, to better assess agent impact, we propose MAD (Mean Attribute Difference), a fine-grained metric that captures BP shifts throughout the dialogue. Leveraging this framework, we establish a comprehensive benchmark by evaluating diverse models alongside our tailored baseline ProMediAgent. Extensive empirical analyses reveal critical behavioral phenomena and underscore the persistent challenges current models face in dynamic, multi-party mediation. Ultimately, ProMediConv provides a rigorous foundation and a vital quantitative standard for advancing AI-assisted conflict resolution. Our dataset and codebase are accessible at https://github.com/ZsWei66/ProMediConv_repo.
Read the full abstract
Nuclear Theory
Fission Modes and Fragment Shell Structures in $^{258}$Md$^*$ from Six-Dimensional Langevin Calculations
The fission of $^{258}\mathrm{Md}^{*}$ is calculated in the excitation energy range of $E^{*} = 6$–$36$~MeV using a six-dimensional Langevin framework with the Cassini shape parametrization. The calculated events are classified into two symmetric and two asymmetric fission modes based on the fragment mass and the quadrupole deformations of the two fragments at scission. The symmetric modes are the short mode with high total kinetic energy (TKE) and the superlong mode with low TKE, whereas the asymmetric modes differ in mass asymmetry. With increasing excitation energy, the yield of the short mode decreases, whereas the combined yield of the two asymmetric modes increases, as observed in the in-beam prompt-fission study of $^{258}\mathrm{Md}^{*}$. From an analysis of the fragment shapes and associated single-particle levels, the short mode and the dominant asymmetric mode with the smaller mass asymmetry are found to involve a compact fragment characterized by deformed shell gaps at $Z = 52$ and $N = 84$, while the complementary fragment is compact in the short mode and strongly elongated in the asymmetric mode.
Read the full abstract
Fluid Dynamics
Correlative effects of induced magnetic field-buoyancy on reactive solute dispersion dynamics in couple-stress fluids
We investigate the dispersion of a reactive solute in a couple-stress fluid flowing between two parallel plates under the combined effects of pressure-driven flow, buoyancy, and an induced magnetic field. The model incorporates first-order heterogeneous reactions at both channel walls alongside a bulk reaction. Using Mei's multiscale homogenization technique accurate to third order, we develop a higher-order asymptotic formulation to determine the effective longitudinal dispersion coefficient and concentration field. Analytical predictions are complemented by Brownian dynamics simulations and finite-difference solutions, while the Aris method of moments quantifies transient mean displacement, spatial variance, and effective dispersivity. The hydrodynamic analysis reveals a singular branch in the velocity solution when the Hartmann number equals half the couple-stress parameter and identifies a characteristic quarter-power scaling between the Hartmann number and couple-stress parameter, separating couple-stress- and magnetically dominated regimes. The model recovers classical Taylor-dispersion behavior in the non-reactive Newtonian limit and agrees well with experimental measurements. Couple-stress rheology and magnetic damping suppress shear-induced dispersion, whereas buoyancy enhances dispersion through additional transverse velocity gradients. A distinct saturation regime of the dispersion coefficient emerges with an increasing couple-stress parameter, while unequal wall absorption induces persistent transverse asymmetry, and stronger absorption enhances solute removal near the source. Numerical and stochastic results validate the analytical framework while resolving higher-order concentration structures and particle-scale wall adsorption.
Read the full abstract
Numerical Analysis
Neumann-Neumann Waveform Relaxation Method for Hyperbolic PDE with Time Delay
Hyperbolic PDEs with time delay are essential for modeling a wide range of real-world applications. Since closed-form solutions are often not attainable, developing accurate and efficient numerical methods becomes crucial. In this work a novel substructuring waveform relaxation method namely Neumann-Neumann Waveform Relaxation (NNWR) has been implemented for numerically solving hyperbolic delay PDEs in the case of non-uniform subdomain partitioning. The convergence behavior is first analyzed using Fourier analysis to obtain an estimate, followed by a demonstration of finite-step convergence through Laplace transform techniques. Various test cases are presented as numerical illustrations.
Read the full abstract
Numerical Analysis
Additive reduced basis preconditioners for large-scale parametrized PDEs
We introduce a class of additive reduced basis preconditioners designed to accelerate the iterative solution of large-scale linear systems arising from discretized parametrized PDEs. The main idea is to regularize the inherently singular reduced-order approximation by adding simple correction terms: either a scaled identity correction or a projected correction based on a basic preconditioner. This yields nonsingular preconditioners under explicit and easily checked conditions. The construction and application of the preconditioners are integrated into an FGMRES framework through an offline strategy that dynamically builds the reduced-basis component by proper orthogonal decomposition at each FGMRES step. We establish sufficient conditions for the nonsingularity of the preconditioners and derive error bounds for the preconditioned Richardson iteration. Numerical results for convection-diffusion, anisotropic vortex, Stokes, and Helmholtz problems are provided to verify the efficiency and convergence of the proposed ARB preconditioners. The method consistently converges in a few iterations and substantially reduces online solve time, supporting its efficiency for multi-query engineering scenarios.
Read the full abstract
Pattern Formation and Solitons
Self-similar vector solitons for the coupled higher-order nonlinear Schrodinger equations in inhomogeneous optical fibers
We prove the existence of two kinds of self-similar vector solitons in an inhomogeneous optical fiber medium, where light propagation is governed by a pair of coupled higher-order nonlinear Schrodinger equations with varying second- and third-order dispersions, self- and cross-phase modulation non linearities, self-steepening, and linear gain/loss effects. The newly found self-similar waves comprise bright-W-shaped and kink-antikink waveforms with nonvanishing amplitudes. As a practical exam ple, we discuss the propagation dynamics of these soliton structures in a periodically distributed fiber system as well as an exponential dispersion-decreasing fiber. The results demonstrate that the parameter functions of gain/loss and third-order dispersion serve as a key factor in determining the nonlinear dynamics of self-similar vector solitons. In particular, we find that precise control over the shape and dynamic evolution of self-similar pulses can be achieved through a proper choice of the distributed third-order dispersion parameter, while the gain/loss coefficient controls their intensity.
Read the full abstract
Analysis of PDEs
Modified wave operators for nonlinear Schrödinger equations in the full subcritical long range regime
We construct modified wave operators for the nonlinear Schrödinger equation $i\partial_tu+\frac12\Delta u=|u|^pu$ in the full subcritical long-range case $0<p<2/d$, with small, nonvanishing, analytic final data $W(x)$ with bounded logarithmic gradients. Previous results established large-time asymptotics for selected classes of Cauchy data. Moreover, the exact asymptotic expansion for $p<1/d$ remained unknown. When $1/d<p<2/d$, our result gives the approximation $$\frac{1}{(it)^{\frac{d}{2}}} e^{\frac{i|x|^2}{2t}} W\left(\frac{x}{t}\right) \exp\left[ -i\frac{t^{1-\frac{dp}{2}}-1}{1-\frac{dp}{2}} \left|W\left(\frac{x}{t}\right)\right|^p \right]$$ The wave operator is constructed by an iteration in the analytic spaces with decreasing radius. When $p\le 1/d$, we construct the profile from a finite truncation of a Fuchsian equation coupled with a transport equation. This profile still leaves a long-range triangular coupling whose terminal integral does not preserve the required fast decay class. The construction yields quantitative $L^q$ asymptotics for $2\le q\le\infty$ and uniqueness in the prescribed analytic asymptotic classes. The central new ingredients are a nonlinear final-state normal form that removes this long-range coupling and a mixed iteration in particular analytic spaces.
Read the full abstract
Astrophysics of Galaxies
SPURS: An Ultra-deep View Inside the Compact, Nitrogen-Enriched Nuclei of Little Red Dots
We present the first ultra-deep rest-UV spectroscopy of four UV-bright Little Red Dots (LRDs), obtained from the SPURS Cycle 4 Large Program. The spectra reveal broad CIV (FWHM $\approx2700-2800$ km s$^{-1}$) in two LRDs, alongside narrow-line densities elevated above star-forming galaxies ($n_e\sim10^4-10^5$ cm$^{-3}$, reaching $10^6$ cm$^{-3}$ in the most extreme source) and nitrogen-enhancements in all four LRDs. We detect broad HeII emission (FWHM $\approx930$ km s$^{-1}$) in one LRD, and two others with fast P-Cygni absorption ($\gtrsim2200$ km s$^{-1}$). Strong interstellar absorption lines and Ly$\alpha$ damping wings reveal the UV continuum is deeply embedded in neutral gas ($N_{\rm HI}\gtrsim10^{22}$ cm$^{-2}$) in all four LRDs. Detections of fluorescent FeII and OI emission and fine-structure absorption indicate this gas lies close to the UV-emitting region. In archival $z>4$ samples, we find nitrogen and strong CIII] emission are significantly more common in LRDs than in the galaxy population. The transmission of broad CIV, tracing the broad-line region or cocoon, depends on rest-optical color within our sample, consistent with an orientation-dependent picture in which bluer, less obscured sightlines offer a more direct, polar view of the central engine and its outflows. We find several potential signatures of very massive stars, whose winds may contribute to nitrogen enhancement. We investigate other abundance patterns expected from supermassive stars but our results are inconclusive. Our results place the UV-emitting region within $\lesssim8$ pc of the LRD nucleus, consistent with an actively assembling nuclear star cluster. Dynamical interactions in this extremely dense environment, including tidal disruption of stars, may explain the high incidence of nitrogen enhancements in LRDs.
Read the full abstract
Combinatorics
Recursive-Line Zarankiewicz Numbers with Four Columns
The recursive-line Zarankiewicz number maximizes the number of squares in a structured irreducible sum-of-squares representation encoded by an augmentation of an extremal $C_4$-free bipartite graph. We determine its four-column behavior under the strengthened recursive definition in the manuscript of Löfberg and Qi dated 9 September 2026. Combining AI-assisted discovery with exact certificate verification and finite exclusion computations, we determine eighteen of the nineteen values for $2\le m\le20$ and isolate the only unresolved case to $37\le\zr(14,4)\le38$. More significantly, we prove the first eventual exact formula in the four-column setting: \[ \zr(m,4)=\floor{\frac{5m+6}{2}}\qquad(m\ge15). \] The upper bound follows from the classical identity $z(m,4)=m+6$ and a sharp cell count. For the matching lower bound, we construct a two-row extension chain from an explicit $20\times4$ seed and derive the odd orders by a fixed deletion. Analytic propagation, together with two independently audited symbolic certificate tables, proves the construction for arbitrary chain length rather than merely for a finite computational range. Thus every extremal configuration has no holes when $m$ is even and exactly one hole when $m$ is odd, and the same exact formula holds for the second-order number $z_2(m,4)$.
Read the full abstract
Audio and Speech Processing
Downstream-Task-Aware Unified Source Separation
Task-aware unified source separation (TUSS) enables a single model to handle diverse separation tasks by conditioning on input prompts. However, conventional TUSS does not account for downstream task requirements, such as whether the enhanced speech will be used for human listening or automatic speech recognition (ASR). In this paper, we propose a prompt extension framework for TUSS that incorporates downstream task information into the input prompts and switches the loss function according to the given prompt during training, enabling outputs with different signal characteristics at inference time. Specifically, we introduce an ASR-dedicated prompt paired with a regularized loss function that reduces speech artifacts to improve ASR robustness, while the standard prompt is paired with the conventional SNR loss function. Experiments on the LibriSpeech and JNAS corpora demonstrate that the proposed joint-training scheme enables a single model to improve ASR performance over noisy input across a wide range of SNR conditions by selecting the ASR-dedicated prompt, while maintaining general speech enhancement quality when the standard prompt is used.
Read the full abstract
Statistical Methodology
Is the Linear Threshold Good Enough? A Scale-Free Parameter and Adequacy Test for Curvature-Induced Threshold Displacement
Applied work often locates a threshold by linearizing a smooth function about a reference point and solving for the crossing. When the function is curved, the linear crossing can be substantively displaced even when standard errors are valid. We introduce the curvature-overstatement parameter $\Theta_{COT}=\log(|h_2^*|/|h_1^*|)$, the log ratio of second- to first-order threshold displacement. On the quadratic branch continuous with the linear solution, $|h_2^*/h_1^*|=2/(1+\sqrt{1-u})$, where $u=2qa/b^2$ is a dimensionless index formed from the local gap, slope, and curvature. Thus $\Theta_{COT}$ is scale-free, depends on the local parameters through one scalar, and has regular-domain range $(-\infty,\log 2)$, with boundary limit $\log 2$ at tangency. We derive regular asymptotic inference, characterize local-to-tangency and weak-slope failures, and give a remainder bound linking the second-order crossing to the true threshold. The main practical contribution is an adequacy test that can affirm that the linear threshold is accurate within a prespecified proportional tolerance, rather than treating failure to detect curvature as evidence of adequacy. Monte Carlo results confirm regular-case calibration, the predicted nonstandard behavior near tangency, and failure under weak slope, while bootstrap diagnostics identify regimes in which regular inference should not be used. COT therefore provides an effect-size scale, adequacy test, and diagnostics for deciding whether a first-order threshold is accurate enough to report.
Read the full abstract
Quantum Physics
Bargmann Invariants Are Insufficient for Complete Local-Unitary Orbit Discrimination
Bargmann invariants constructed from a bipartite density operator and its two lifted marginals are polynomial invariants of local-unitary conjugation. We determine the precise information encoded in these invariants. Whenever one subsystem is a qubit, the ordinary marginal-word family determines the full spectrum of the partial transpose and hence decides whether the state has the positive-partial-transpose property. In $2\otimes2$ and $2\otimes3$ systems, this yields complete separability criteria. For the two-qubit system, a finite subfamily additionally separates local-unitary orbits, and a finite extension generates the polynomial invariant ring. These three tasks already diverge for qubit-qutrit states: we exhibit full-rank, locally maximally mixed states that agree on all ordinary marginal-word invariants yet have different operator-Schmidt ranks, together with a quartic correlation invariant that separates them. When both local dimensions are at least three, the analogous collapse on the locally maximally mixed sector produces isospectral pairs consisting of one separable state and one entangled state with negative partial transpose. The ordinary Bargmann algebra therefore coincides with the full local unitary invariant ring if and only if both subsystems are qubits. The missing data are geometric: they encode the placement of global eigenspaces relative to the tensor-product decomposition