Functional Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 12 September
We prove that every separable infinite-dimensional Fréchet algebra $X$ admits a continuous linear operator $T$ supporting a dense invariant hypercyclic algebra, giving an affirmative answer to a question of Bayart, Costa Jr. and Papathanasiou. In fact, every dense countable-dimensional subalgebra $\mathcal A$ of $X$ can be prescribed as an invariant hypercyclic algebra. When $X$ admits a continuous norm, the operator can additionally be chosen in the form $T=I+K$, where $K$ is nuclear, so that $\mathcal A = \operatorname{span} \operatorname{Orb}(a,T)$ for any prescribed $a\in\mathcal A\backslash\{0\}$.
Robotics
Rethinking the Implications of Human Feedback for Preference Learning in Human-Robot Collaboration
In Human-Robot Interaction, the standard approach to learn a reward model that represents human preferences for robot behavior consists of three steps. First, the robot collects limited direct evidence from human feedback (e.g., positive or negative binary feedback). Then, the robot utilizes the direct evidence to derive accepted or rejected labels to feasible but unchosen actions using fixed implication rules. Finally, the robot updates the reward model with both the direct and derived evidence. Unfortunately, the fixed rule can hinder preference learning: in a user study with two collaborative simulation environments, human-provided implication labels often differed from the standard fixed rule, and using the human labels substantially improved reward learning with the Preference Learning from Implicit and Explicit Feedback (PIE) algorithm. Consequently, we propose IMPLIED, an implication modeling method that treats fixed-rule implications as an initial guide while learning to infer and revise accepted and rejected action labels over time. Across evaluations on recorded human-robot interaction trajectories and a physical robot pizza-making study, IMPLIED predicts human implications more accurately than the fixed rule approach and LLM baselines, approaching the performance of a human-label oracle. In turn, IMPLIED reduces preference-estimation error and leads to robot actions that are more often rational with respect to a combined reward (which includes the true preference reward and a task-specific reward) compared to baselines. By learning to reason about the implications of human feedback, this work enables more faithful and efficient robot behavior adaptation during human-robot collaboration.
Read the full abstract
Numerical Analysis
Chronological stability for nonstationary matrix refinement
A matrix cascade is an iterative refinement process in which vector-valued data are repeatedly filtered by matrix-valued masks across successively finer scales. Such cascades arise in multichannel subdivision, Hermite refinement, multiresolution synthesis, and exponential-spline constructions, and in nonstationary schemes the masks may vary with scale. We develop a chronological stability framework for this setting, allowing both the transition operators and the associated matching spaces to change from level to level. If the chronological radius satisfies $\rho_{\rm ch}<1$ and the matching defects are summable, then the cascade converges uniformly and, for every $q\in(\rho_{\rm ch},1)$, \[ \|F_n-\Phi\|_\infty \lesssim q^n+\sum_{j=1}^n\delta_j q^{\,n-j} +\sum_{j>n}\delta_j . \] The time-weighted defect term records the level at which each perturbation is inserted, and the matching spaces need not converge; they may even alternate indefinitely. For compact piecewise-linear seeds, every finite ordered matrix cascade admits an exact fixed-width ReLU realization with $O(n)$ depth and parameters, and this linear depth order is worst-case optimal at fixed width. Consequently, exponentially decaying defects yield certified approximants of size $O(\log\varepsilon^{-1})$. We further construct stable two-channel classes in which the chronological radius and the leading metric-entropy coefficient are independent invariants, showing that stability does not determine finite-accuracy description complexity. The framework therefore provides tolerance-controlled finite representations for nonstationary multiresolution and exponential-spline refinement.
Read the full abstract
Computation and Language
Mizan: A National Benchmark for Evaluating Large Language Models on Iraqi Arabic and the Iraqi Civic Context
Arabic large-language-model (LLM) evaluation has matured around Modern Standard Arabic (MSA): aggregated leaderboards such as the Open Arabic LLM Leaderboard (OALL), HELM Arabic, and BALSAM rank models across dozens of MSA tasks, and frontier systems increasingly saturate them. Dialectal Arabic, the language Iraqis actually speak, remains nearly invisible to this infrastructure. We introduce Mizan ("the balance"), Iraq's national benchmark for evaluating LLMs on Iraqi Arabic and the Iraqi civic context: an MSA baseline track paired with an Iraqi track across six axes (dialect comprehension, dialect generation, bidirectional MSA-Iraqi translation, Iraq-specific knowledge, official-document field extraction, and safety), built from 340 originally authored, dually reviewed items with statistically audited answer positions and Wilson intervals on every published score. A pilot evaluation of 27 systems, spanning closed frontier models three days after release, open weights across size tiers, and an Arabic trio of commercial, open-specialized, and sovereign systems, yields four findings. The MSA track saturates while the Iraqi track discriminates, with a consistent 14-18-point per-model gap and statistically tied leaders. Official-document extraction confines every system to 32-56. Arabic-focused specialization behaves as MSA specialization: two dedicated Arabic models score below a size-matched generalist on the Iraqi track. And the safety-hardened tier of the newest model family deterministically refuses innocuous dialect-comprehension items as policy violations, an over-refusal mode invisible to MSA benchmarks. The platform enforces an integrity protocol of immutable snapshots, verification certificates, a human publication gate, and public retraction, all exercised during this study. Code and the public development set accompany the paper.
Read the full abstract
Analysis of PDEs
The hedgehog uniquely minimises every $p$-energy
We prove that for every dimension $n \geq 2$ and parameter $p \in ]1,n[$, the hedgehog $u_0(x) = x/|x|$ is the unique minimiser of the $p$-energy $\mathcal{E}_p [u]:=\int_{\mathbf{B}^n}|\nabla u|^p\,{\rm d}x$ in the class of $W^{1,p}$-mappings from the $n$-dimensional unit ball $\mathbf{B}^n$ to the $(n-1)$-dimensional unit sphere $\mathbf{S}^{n-1}=\partial\mathbf{B}^n$ whose trace equal to the identity on $\mathbf{S}^{n-1}$. This answers in the affirmative an open question on p.29 in [Robert M. Hardt, Singularities of harmonic maps, Bull. Amer. Math. Soc. (N.S.) 34 (1997), 15–34].
Read the full abstract
Materials Science
Sodium Incorporation in CsPbBr$_{3-x}$I$_x$ Nanocrystal Electrodes: Lattice Contraction and the Suppression of Field-Driven Iodine Expulsion
Mixed-halide perovskite nanocrystal electrodes fail in supercapacitors through field-driven halide segregation. In undoped $\mathrm{CsPbBr_2I}$, this appears as a capacitance that climbs to 218% of its first-cycle value by cycle 1378 and then collapses to 39% by cycle 2500, with complete loss of the iodine signal from the cycled electrode. This work tests whether sodium incorporation suppresses that failure mode. Na-doped $\mathrm{CsPbBr_{3-x}I_x}$ ($x = 0, 1, 2$) nanocrystals were prepared by ligand-assisted reprecipitation at a Na/Pb precursor ratio of 1.25:1.00 and compared with undoped analogues in 0.1 M tetrabutylammonium tetrafluoroborate in anhydrous dichloromethane. Sodium contracts the pseudocubic lattice parameter of $\mathrm{CsPbBr_3}$ from $5.908 \pm 0.029$ to $5.851 \pm 0.019$ $\mathring{\mathrm{A}}$ after correction for specimen displacement. Specific capacitance at 0.3 A g$^{-1}$ rises for every composition, from 42 to 75, from 63 to 96, and from 56 to 84.5 F g$^{-1}$. Na-$\mathrm{CsPbBr_2I}$ gives the lowest charge-transfer resistance at 175 $\Omega$ and the highest ion diffusion coefficient at $1.6 \times 10^{-16}$ m$^2$ s$^{-1}$, and power-law exponents between 0.33 and 0.45 at all potentials examined show that charge storage is limited by ion transport through the pore network rather than by the interfacial process. In the sodium-containing (Na-$\mathrm{CsPbBr_2I}$) electrode, the capacitance rise reaches only 115% at cycle 600, no collapse follows, and 97% is retained at 2500 cycles, the excess above the first-cycle value being reduced by a factor of 7.9. Iodine is retained at unchanged binding energy, and the Br:I ratio measured by elemental mapping is 2.30 after cycling against 2.25 before.
Read the full abstract
Quantum Algebra
Quantum supersymmetric pairs and the Serre relations via $\mathrm i$Hopf algebras
We study iHopf algebras associated with quantum supergroups of basic type. For a quantum supersymmetric pair $(\mathbf{U}, \mathbf{U}^\imath)$, we realize $\mathbf{U}^\imath$ and $\mathbf{U}$ as the iHopf algebras of the Borel quantum group ${\hat{\mathbf{U}}}_q^{\geq0}$ and the tensor product algebra ${\hat{\mathbf{U}}}_q^{\geq0}\otimes {\hat{\mathbf{U}}}_q^{\geq0}$, respectively, while the coideal subalgebra structure is encoded by an embedding between the iHopf algebras. Moreover, we derive an explicit conversion formula between the iHopf multiplication and the original multiplication, which provides a general mechanism transforming the defining relations of quantum (super)groups into relations of iquantum (super)groups. In particular, all the Serre relations that occur in quasi-split iquantum supergroups of basic type are characterized.
Read the full abstract
Statistical Methodology
From priors to performance: enhancing statistical efficiency with Bayesian dynamic borrowing
One of the main advantages of the Bayesian approach to statistical inference is the flexibility in incorporating information from various sources, from expert opinion to historical data. Whereas the literature on Bayesian dynamic borrowing is rich, practical guidance for how to implement such methods is comparatively sparse. We thoroughly review the most common dynamic borrowing approaches for external data, including how to incorporate multiple historical data sets. We then show how these techniques can be used in practice, using publicly available software, to perform important statistical tasks such as model selection, average treatment effect estimation and prior sensitivity analysis. The aim is to make analysts more confident in their use of Bayesian methods to incorporate external data. All code is made publicly available in a companion GitHub repository (https://github.com/EzequielEBS/hdbayes-tutorial).
Read the full abstract
Software Engineering
Introspective Uncertainty Estimation for LLM-Based Code Generation
Large Language Models (LLMs) are increasingly used for code generation but can produce fluent yet functionally incorrect outputs, which limits trust in their usage for practical software engineering workflows. This thesis investigates whether Introspective Uncertainty Estimation (IUE), based on internal hidden-state representations of LLMs, can reliably indicate correctness at the response and line levels for code generation tasks. The objective is to determine the extent to which hidden states encode information about functional code correctness and how this can be leveraged for practical risk assessment and fault localization. Methodologically, this thesis combines response-level evaluation on LiveCodeBench (LCB) and BigCodeBench (BCB) with an augmentation pipeline that derives token- and line-level labels from incorrect programs. In this setup, it compares static and dynamic response-level features, evaluates generalization across tasks, programming domains, and token positions, and studies line-level fault localization. The results show that hidden states contain a strong response-level correctness signal. Static single-token probes perform best, while more elaborate dynamic strategies yield no consistent gains. While generalization across tasks, domains, and token positions is feasible, setting-dependent degradation largely remains for real-world software projects. At a fine granularity, line-level prediction is substantially harder than response-level estimation. However, in a conditional localization setup with known-incorrect programs, Top-K point-of-failure ranking remains effective. Overall, the findings suggest that hidden states are a robust and informative resource for estimating functional code correctness, supporting a two-stage workflow that combines response-level risk screening with targeted line-level prioritization.
Read the full abstract
Cell Behavior
Fragmented uptake drives lipid accumulation in macrophage cannibalistic efferocytosis
Efferocytosis, the clearance of dying cells typically by macrophages, is essential for tissue homeostasis and the resolution of inflammation. Previous experiments by Ford et al. (Proc. R. Soc. B, 2019) showed that cannibalistic efferocytosis redistributes endogenous lipid from dying macrophages into the surviving population, but existing mathematical models do not reproduce the observed population dynamics and lipid distributions. Here, fifteen candidate models are compared, combining three mechanisms of apoptotic material uptake with five forms of the macrophage death rate. Model comparison is guided by the Akaike Information Criterion and qualitative agreement with the observed lipid distributions. Numerical solutions show that whole-cell uptake models predict internal maxima that are absent from the data, whereas nibbling uptake produces distributions that are too concentrated about their means. By contrast, intermediate "fragmented" uptake models provide substantially improved agreement when combined with either linear lipid-dependent or exponential time-dependent death rates. The fitted models predict that smaller fragments from dying cells are ingested at higher frequency than larger ones. This analysis provides new insight into how efferocytosis shapes the distribution of lipid within macrophage populations and highlights the importance of distribution-level data for distinguishing between mechanistic models that reproduce similar population-average dynamics.
Read the full abstract
Software Engineering
Towards a faithful stochastic model for brain digital twins
Twinning the brain means reproducing its electrical activity with fidelity. This activity arises from many neuronal mechanisms across several scales, from a single neuron to whole brain regions. Current large initiatives rely on models that each capture only a few of these mechanisms. Some act at the scale of a single neuron, others at the scale of neuronal populations. No single model captures both scales with fidelity. We propose a new stochastic model, based on a combination of Random Neural Networks and Markov-Modulated Poisson Processes, that would improve the fidelity of a brain digital twin. We map the model to the Discrete Event System Specification. This yields an initial executable simulation model suitable for incorporation into a brain digital twin.
Read the full abstract
Combinatorics
Large solution-free sets via combinatorial degenerations
Consider the linear form $L(x,y,z,w) = 3x+y-2z-2w$. For a positive integer $N$, denote by $r_L(N)$ the largest size of a subset of $\{1,2,\dots,N\}$ that avoids nontrivial solutions to $L = 0$. We show that $r_L(N) = \Omega(N^{0.5608687})$, improving the lower bound for Problem 16 in Green's list of open problems. Our proof uses the method of combinatorial degenerations to turn a finite certificate into large solution-free sets. In fact, we can improve Ruzsa's lower bound of $N^{1/2-o(1)}$ for many four-variable equations. Consider $L(x,y,z,w) = ax+by-cz-dw$ with $a,b,c,d\in \mathbb Z_{>0}$, $a+b=c+d$, $\{a,b\} \neq \{c,d\}$ and $abcd$ not a square. We show that there is $\varepsilon_L > 0$ such that $r_L(N) = \Omega_L(N^{1/2 + \varepsilon_L})$. Furthermore, we show that for primitive translation-invariant linear forms $L$ in $s$ variables, the lower bound $\Omega_s(N^{1/(s-1)})$ coming from a greedy construction is never optimal.
Read the full abstract
Probability
Fractional Wiener chaos: Part 2. Interface spectral chaos
We construct a product spectral decomposition from power-normalised parabolic-cylinder functions. At noninteger real orders, these functions are not square integrable with respect to the corresponding full-line Gaussian measure. Bringing the admissible half-line branches into the same Gaussian space and matching them at the origin gives a corrected orthonormal eigenbasis. A unitary transformation to a weighted probability space makes the eigenfunction corresponding to the lowest eigenvalue constant and permits consistent countable products. The resulting law is non-Gaussian under deformation, and the decomposition recovers classical Wiener chaos when the deformation is removed. We identify the associated closed gradient, adjoint divergence and deformed number operator. The Rodrigues formula covers all orders occurring in the spectral branches, including negative orders. Under deformation, however, changing both branch orders by the same nonzero amount breaks the required relation between them. Fractional evolution defined through spectral calculus preserves the basis. After unitary identification, the one-coordinate fractional evolution operators converge in operator norm to Gaussian and three-dimensional radial Ornstein–Uhlenbeck fractional evolutions at the respective parameter endpoints. Convergence is uniform on compact time intervals away from zero. An application example with inverse stable clock is provided in the accompanying github repository.
Read the full abstract
Game Theory
Revisiting EFX and fPO Allocations for Binary Chores
We study fair and efficient allocations of indivisible chores under binary additive costs, with a focus on unequal entitlements and best-of-both-worlds guarantees. While binary valuations have been extensively studied for goods, their chore counterpart remains much less understood. A notable exception is due to Tao et al. (TCS 2025), who established that EFX and fPO are compatible for binary chores with equal entitlements. We revisit binary chores under unequal entitlements and establish the computation of allocations that satisfy WEFX and fPO. Our key technical contribution is a new lexicographic potential function tailored to chores: any allocation minimizing this potential ensures both WEFX and fPO. This potential further guides a polynomial-time local-search algorithm for computing allocations with such fairness and efficiency guarantees. For best-of-both-worlds guarantees, we show that unequal entitlements create a sharp obstruction: even with two agents and identical binary additive costs, no lottery can simultaneously satisfy ex-ante WEF and ex-post WEF1. In contrast, for equal entitlements, we construct in polynomial time a lottery that is ex-ante EF and fPO, while every realization is both EFX and fPO.
Read the full abstract
Computer Vision
Zero-Shot Cross-Material Ptychographic Phase Reconstruction Using Deep Learning
Ptychographic phase reconstruction is commonly formulated as an iterative inverse problem, requiring repeated object-probe updates and resulting in substantial computational cost for large-scale 4D-STEM data. We present a direct local-to-global learning framework that reconstructs full-field phase maps from diffraction measurements without iterative refinement during inference. The proposed network predicts local wrapped-phase patches from individual diffraction patterns using a sine-cosine representation, and the predictions are assembled into a full-field reconstruction using calibrated scan positions and Gaussian-weighted stitching. To evaluate generalization beyond the training domain, the model is trained on one material and directly applied to another in a zero-shot setting without target-domain fine-tuning. Experiments on AuPd and MoS$_2$ demonstrate consistent cross-material transfer in both directions, with the proposed method achieving the best full-field MSE, PSNR, and MS-SSIM among the evaluated learning-based methods. Compared with the iterative ePIE approach, the proposed direct local-to-global pipeline reduces end-to-end reconstruction time by approximately 10$\times$, demonstrating its potential for efficient and transferable ptychographic reconstruction.
Read the full abstract
Information Theory
A Novel Approach to Counterexamples of the Polujan-Pott Conjecture via Set-Partition Permutations
In this paper, we settle a conjecture of Polujan and Pott by constructing an explicit, infinite family of Maiorana–McFarland bent functions $f_t$ in $2(2^t-1)$ variables with algebraic degree $\deg(f_t) = t + 1$ for any integer $t \ge 2$. Our construction builds upon a minimal commutative algebra $I_t$, which naturally induces a triangular set-partition polynomial permutation $P_t$. By identifying an elementary abelian subgroup within the direct sum $ I_t \oplus I_t^*$, we establish an explicit nonlinear coordinate transformation that pulls $f_t$ back to a canonical quadratic form. This linearizes the translation development $\operatorname{Dev}(D_{f_t})$ under an exotic group structure and proves that it is isomorphic to the classical symplectic design $S^\pm(2(2^t-1))$, thereby fully resolving the conjecture.
Read the full abstract
Number Theory
Modular and Shimura curves $X_0^D(N)$ embedded in $\mathbb P^1 \times \mathbb P^1$
We classify the modular curves $X_0(N)$ that admit a smooth embedding in $\mathbb P^1 \times \mathbb P^1$ and obtain a partial classification for the Shimura curves $X_0^D(N)$. We also prove that, for $D>1$, a Shimura curve $X_0^D(N)$ admits a smooth plane model if and only if its genus is at most one.
Read the full abstract
Computer Vision
SGWIB:Sliced Gromov-Wasserstein Information Bottleneck for Video Highlight Detection
Video highlight detection aims to identify temporally important segments that capture the most informative or engaging events in a video. Reliable prediction therefore requires not only discriminative segment representations but also preservation of the temporal relationships among neighboring and distant segments. The information bottleneck principle has proven effective for learning compact and task-relevant representations, yet it has not been explored for video highlight detection, and applying conventional formulations directly would overlook inter-segment relational structure and distort highlight relevant temporal organization during compression. We therefore introduce the Sliced Gromov-Monge Gap (SGMG), a structure aware regularizer that measures the excess relational distortion induced by a prescribed source-to-bottleneck mapping relative to an optimal sliced structural correspondence. Building on SGMG, we develop SGWIB, an information-bottleneck framework for single-modal video highlight detection that learns compact bottleneck representations while preserving inter-segment temporal structure. We further introduce Home-Away-Related Contextual Pseudo-Labels and a contextual disentanglement module that reduce sports-specific contextual bias by separating highlight oriented information from contextual patterns. Experiments on MrHiSum and MoSu show that SGWIB attains the best Kendall's tau, Spearman's rho, mAP@50, and mAP@30 among the compared single-modal methods on both datasets. On MrHiSum, the visual model improves the strongest previous results by 0.031, 0.031, 0.87, and 0.75 on these four metrics, respectively. These results show that structure-aware information-bottleneck regularization combined with contextual disentanglement improves segment-level highlight prediction.
Read the full abstract
Combinatorics
Orbit span of a design and some saturation theorems in commutative Schurian association schemes
Orbit-span and dimension problems for designs have been studied in several classical association schemes using a variety of methods. Recently, through a detailed analysis of total trades, Ghorbani et al. showed that the orbit of a fixed combinatorial design asymptotically attains the full dimension permitted by the design equations. Analogous dimension-saturation results for the global spans of index-one designs in the bilinear forms and Grassmann schemes were obtained via laborious eigenvalue computations. In this paper, we work with the top fiber $X$ of a graded poset carrying a compatible transitive action of a finite group $G$, and assume that the induced Schurian association scheme on $X$ is commutative. For the multiplicity-free decomposition $\mathbb{C}^{X}=U_{0}\oplus U_{1}\oplus\cdots\oplus U_{m}$, we prove that, under explicit spectral and quantitative conditions, the $G$-orbit of the characteristic vector of any $t$-design spans the maximal submodule $U_{0}\oplus U_{t+1}\oplus U_{t+2}\oplus\cdots\oplus U_{m}$ allowed by the $t$-design definition. We verify these conditions asymptotically for the Hamming, bilinear forms, Johnson, and Grassmann schemes. This recovers the fixed-orbit saturation theorem of Ghorbani et al. for combinatorial designs, gives a new result for orthogonal arrays, and asymptotically extends the previous bilinear forms and Grassmann results to orbit spans of individual designs of arbitrary fixed index.
Read the full abstract
High Energy Physics (Phenomenology)
Probing Neutrinophilic Scalars in Muon Decays
The non-standard self-interactions of neutrinos could be induced by (light) scalars that couple primarily to neutrinos. In this work, we investigate the effects of neutrinophilic scalars $\phi$ on muon decays at the tree, 1-loop and 2-loop levels, considering both Dirac and Majorana neutrinos. The most phenomenologically interesting processes are the 1-loop decay $\mu \to e \phi \phi$ and $\phi$-induced decay $\mu \to e \gamma$ at the 2-loop order from the same coupling $g_{\rm eff}$, and the 1-loop corrections of $\phi$ to the SM muon decay and the four-body muon decays $\mu^- \to e^- \nu_\mu \nu_\mu \phi,\, e^- \bar\nu_e \bar\nu_e \phi$, both induced by the coupling $h_{e\mu}$ of $\phi$ to Majorana neutrinos. The current experimental bounds on $\mu \to e \gamma$ provide the most stringent limits on the coupling $g_{\rm eff}$, up to roughly 0.064, for the scalar mass $m_\phi \gtrsim 8.7$ MeV. The precise $G_F$ measurements constrain the coupling $|h_{e\mu}|$ down to roughly $0.027$, with the scalar mass $m_\phi$ constrained up to roughly $5.9$ TeV. For $m_\phi \gtrsim {\cal O}({\rm GeV})$, the $G_F$ measurements are more stringent than other existing laboratory, astrophysical and cosmological constraints. Some other $\phi$-induced processes are also possible, which are, however, heavily suppressed by the tiny neutrino masses and/or the loop factor.
Read the full abstract
Probability
Non-blowup of stochastic heat equations by noise
Consider the heat equation: \begin{equation}\label{eq:00} \begin{cases} \displaystyle du(t,x)=\frac12\Delta u(t,x)\,dt+b(u(t,x))\,dt, &t>0,\ x\in D,\\[1mm] u(t,x)=0,&t\ge0,\ x\in\partial D, u(0,x)=u_0(x),&x\in D. \end{cases} \end{equation} It is well known that superlinear growth of the coefficient $b$ may lead to finite-time blow-up. In this paper, we show that, for every locally Lipschitz reaction coefficient $b:\R\to\R$, there always exists a locally Lipschitz noise coefficient $\sigma:\R\to\R$ such that the stochastic heat equation \begin{equation}\label{eq:01} \begin{cases} \displaystyle du(t,x)=\frac12\Delta u(t,x)\,dt+b(u(t,x))\,dt+\sigma(u(t,x))\,dB_t, &t>0,\ x\in D,\\[1mm] u(t,x)=0,&t\ge0,\ x\in\partial D, u(0,x)=u_0(x),&x\in D. \end{cases} \end{equation} has a unique global solution for every $u_0\in C_c(D)$. Here $(B_t)_{t\ge0}$ is a real-valued Brownian motion. In particular, if $b=0$, the equation has a global solution for every locally Lipschitz $\sigma$, without any growth restriction at infinity. The proof uses reflected scalar barriers, a Lyapunov estimate, truncation, and comparison techniques.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Measuring the spatio-temporal variation of fundamental physical constants using the OH sum rules
In this paper, we introduce a method to constrain the variation of fundamental physical constants predicted by grand unified theories. This approach utilizes OH sum rules, which exhibit different forms depending on the physical conditions of the OH gas. Employing a least-squares technique, we can directly derive the relative velocity offsets among four OH lines in each ground state. This circumvents the need for spectral profile fitting, which is often unfeasible for spectra with complex profiles. Moreover, this method remains robust even when portions of the spectra are contaminated by radio frequency interference (RFI). Applying this method to a Galactic source G035.1+0.5, we obtained a stringent constraint of $\Delta X/X=(-1.8\pm5.1)\times10^{-6} $, where $X=\mu^{-1}\alpha^{2}g_{p}^{0.54}$. This method is expected to play a crucial role in extracting fundamental physics from large datasets of upcoming Square Kilometre Array (SKA) telescope.
Read the full abstract
Pricing of Securities
Yet another asymptotic formula for implied volatility
We derive a first-order representation of Black-Scholes implied variance in a continuous local martingale model. Total implied variance is the conditional expectation of the quadratic variation of the log price given its terminal value, up to a smaller-order term, for bounded standardized log-strikes. The framework incorporates small volatility-of-volatility, fast mean-reverting, and short-maturity asymptotics.
Read the full abstract
Number Theory
A Local Proof of Langlands's Second Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields
We give a local proof of Langlands's Second Main Lemma for local epsilon factors over nonarchimedean local fields. The lemma compares the induction expressions attached to compatible characters of distinct intermediate fields of prime degree in a bicyclic extension of prime-square degree. It is one of the main identities used in Langlands's construction of epsilon factors of local Weil representations. The proof builds on the work of Dwork, Lakkis, and Langlands. The main new point in the present paper is the wild dyadic case, i.e. biquadratic extensions over a nonarchimedean local field of residue characteristic two. This completes the proof of the Second Main Lemma, including the equal-characteristic case. Finally, together with the local proof of the First Main Lemma and Langlands's remaining reductions, we obtain a purely local construction of local epsilon factors envisioned by Langlands.
Read the full abstract
Probability
Majorizing Measures for Canonical Processes with Log-Concave Tails
Let $Y_1,\ldots,Y_n$ be independent symmetric random variables with log-concave tails. We give a dimension-free characterization of the expected supremum of the canonical process $X_x=\sum_{i=1}^n x_iY_i$ without any $\Delta_2$ or regular-growth assumption on the coordinate tails. The characterization is governed by scale-dependent intrinsic costs determined directly by the convex tail potentials. It has an information-theoretic rate-distortion formulation as well as two equivalent majorizing-measure formulations on the original index set, one multiscale and one based on a single probability measure. More strongly, the comparison holds for every prescribed law of the index. In particular, the Gaussian majorizing-measure theorem of Talagrand and the Bernoulli theorem of Bednorz-Latała are recovered from the same formula, through quadratic and truncated quadratic costs, respectively. The new geometry is necessary: once the $\Delta_2$ growth condition is removed, the usual chaining functional based on increment moments can exceed the expected supremum by an unbounded factor. The proof is based on a uniform convex-order truncation principle for symmetric exponentials and a dyadic decomposition of the tail slopes that transfers simultaneously the random process and its intrinsic cost, with universal constants.
Read the full abstract
Analysis of PDEs
The Shubin–Vakilian–Wolff Uncertainty Principle at Half Density
Shubin, Vakilian, and Wolff proved a Fourier uncertainty principle for sets of sufficiently small local density at the reciprocal scale and asked whether every density below one is admissible. We answer this question negatively in dimension one by constructing sequences of pairs of $1/2$-density thin sets and unit vectors whose total position and Fourier mass outside these sets tends to zero. This obstruction persists for every scaled reciprocal profile $\rho_\kappa(x)=\min\{1,\kappa/|x|\}$, $\kappa>0$. On the other hand, for $0<\kappa\le1$, the uncertainty estimate holds whenever the density $$ \varepsilon<\frac{1}{2(1+32\kappa)}. $$ Thus the critical density tends to $1/2$ as $\kappa\downarrow 0$. The obstruction uses odd Gaussian packets to transfer norm bounds from a free-group model. The positive estimate uses a Fourier-complementary anti-Wick operator and quadratic straightening of the reciprocal geometry.
Read the full abstract
Functional Analysis
Convergence of Random Products of Projections Under Infinite-Periodic Selections
Let $\{P_j\}$ be a sequence of projections onto the closed subspaces $\mathcal{M}_j$ of a Hilbert space $\mathscr{H}$. Consider an infinite sequence $P_{i_1}, P_{i_2}, \ldots$ with each $P_{i_n} \in \{P_1, P_2, \ldots\}$, possibly repeating in some order or randomly. The question is: Under what conditions does the sequence $\{P_{i_n} \cdots P_{i_2} P_{i_1} x\}_{n=1}^{\infty}$ converge strongly or weakly to $Px$ for every $x \in \mathscr{H}$, where $P$ is the projection onto the intersection $\mathcal{M} = \bigcap_{i=1}^{\infty} \mathcal{M}_i$? In this paper, we present some results concerning random products of countably infinitely many projections $\{P_j\}_{j=1}^{\infty}$ that incorporates the notion of an infinite-periodic function. More precisely, we introduce a new class of functions $\sigma \colon \mathbb{N} \to \mathbb{N}$, called infinite-periodic functions, and rigorously show that the sequence $\{T_n x\}$ defined by \[ T_1 := P_{\sigma(1)}\quad \mbox{and} \quad T_n := P_{\sigma(n)} T_{n-1} \quad \text{for all } n \geq 2, \] for $x \in \mathscr{H}$, converges weakly to $Px$, where $P$ is the projection onto $\bigcap_{j=1}^{\infty} \mathcal{R}(P_j)$. We also provide some technical examples to illustrate our results.
Read the full abstract
Machine Learning
Tabby: An Open Pretraining Recipe for Time Series Foundation Models
In this report, we release Tabby, a long context probabilistic time series foundation model, together with a complete and open recipe of how it was built. Tabby adopts an encoder-only patch Transformer architecture and concentrates the contributions on the data and the training procedure. The pretraining corpus combines an extended real-world collection, GIFT-Eval-Pretrain+ and BLAST, with synthetic data from KernelSynth and CauKerV2, an online generator that composes temporal dynamics through randomly sampled structural causal models. Training couples a progressive convergence schedule, which yields reusable intermediate checkpoints, with a deep quantile supervision objective for intermediate layers. The resulting 145M parameter backbone supports contexts of up to 8,192 observations and serves forecasting, classification, and anomaly detection, while a prompt-tuning module further improves in-distribution forecasting performance with the pretrained weights frozen. Tabby achieves competitive zero-shot forecasting performance on GIFT-Eval and the out-of-distribution TIME benchmark, while the same pretrained backbone also supports classification on the UCR Archive and zero-shot anomaly detection on TSB-AD-U. We release training pipeline and model as open source at huawei-noah/trustworthyAI.
Read the full abstract
Solar and Stellar Astrophysics
Investigating Variability in Long-lived Protoplanetary Disks (>10 Myr) using NEOWISE
We present the mid-infrared variability study of 120 long-lived disk candidates (ages 10-100 Myr) and 13 confirmed "Peter Pan" disks using NEOWISE to constrain the longevity of dynamic disk processes beyond the standard 10 Myr dispersal threshold. We identified 32 sources exhibiting significant variability by combining stochastic flux metrics and the Stetson $J$ index. The majority of these variables belong to the 10-25 Myr age range, suggesting a sharp decline in disk brightness variability after 25 Myr. Morphologically, the variability is characterized by irregular fluctuations with mean amplitudes of $\Delta W2 \approx 0.5$ mag, consistent with variable extinction or inner disk warping induced by embedded planetesimals. We also report a strong correspondence between mid-infrared and optical variability for the Peter Pan disks, with all 9 mid-IR variables confirmed as optical variables in the literature. Our findings reveal a population of 23 new long-lived disk candidates that retain active, gas-rich environments, supporting the existence of a rarefied class of systems that survive well into the debris disk era.
Read the full abstract
Machine Learning
Linear Ensemble Sampling with Smaller Ensembles
Ensemble sampling offers a practical approach to randomized exploration by maintaining a collection of models, but how small an ensemble can be while retaining strong regret guarantees remains unresolved. In particular, the existing guarantees use an ensemble size of $\Theta(d\log T)$, leaving a logarithmic gap in the horizon $T$ relative to the intrinsic $\Omega(d)$ ensemble-size barrier. We aim to narrow this gap by proposing an ensemble sampling algorithm that refreshes the ensemble only when the regularized Gram matrix changes substantially. This mechanism localizes the perturbation analysis to epochs with controlled Gram-matrix drift and reduces the sufficient ensemble size to $\Theta(d\log d+d\log\log T)$, while preserving the state-of-the-art $\tilde O(d^{3/2}\sqrt T)$ regret for ensemble sampling with arbitrary bounded arm sets. We further show that, when the arm set is finite of cardinality $K$, the proposed algorithm achieves the sharper regret bound $\tilde O(d\sqrt{T\log K})$. To the best of our knowledge, this is the first ensemble-sampling guarantee that simultaneously recovers both canonical regret scalings known for randomized linear bandit algorithms: the $\tilde O(d^{3/2}\sqrt{T})$ rate for arbitrary bounded arm sets and the $\tilde O (d\sqrt{T\log K})$ rate for finite arm sets. The algorithm also admits an anytime implementation without resetting past data, and experiments show that it remains competitive with baselines while using substantially smaller ensembles.