Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 10 March

Numerical Analysis

An accelerated direct solver for scalar wave scattering by multiple transmissive inclusions in two dimensions

This paper discusses a fast direct solver using boundary integral equations for Helmholtz transmission problems involving multiple inclusions in two dimensions. Efficiently addressing scattering problems in the presence of numerous inclusions remains a key challenge for various practical applications. For problems involving a large number of scatterers, the number of iterations in Krylov subspace methods is known to increase significantly. This occurs even when using second-kind boundary integral equations, which are typically recognized for their rapid convergence. We consider a fast direct solver as an alternative, an approach that has been less commonly explored for transmission problems with disjoint multiple inclusions. The low-rank approximation based on the proxy method achieve speedup by calculating interactions between disjoint scatterers without the terms derived from the internal integral representation. Notably, this advantage applies to the Poggio–Miller–Chang–Harrington–Wu–Tsai (PMCHWT) formulation but breaks down in the Burton–Miller case. Numerical examples demonstrate that the proposed solver can compress the system of linear algebraic equations to a size of $O(\omega D)$, where $\omega$ is the frequency of the incident wave and $D$ is the diameter of the (smallest) bounding box enclosing the multiple inclusions. The total computational cost scales as $O(N^{1.5})$ $(= O(\sqrt{N}^3))$ at most for a fixed $\omega$ when the inclusions are arranged on a grid. Moreover, the PMCHWT formulation, that omits the interior term in the proxy method, is approximately six times faster than the Burton–Miller formulation when treating each inclusion as a cell. Furthermore, in the same setting, the former can compress the size of the system of linear algebraic equations by half compared to the latter.
Read the full abstract

Mathematical Physics

On Fermi's model for the scattering of a slow neutron from a bound proton

We consider a model Hamiltonian, introduced by Fermi in 1936, describing a two-particle system made of a neutron and a harmonically bound proton, where the neutron-proton interaction has the form of a $\delta$-potential. For such Hamiltonian we prove the Limiting Absorption Principle and describe the stationary scattering theory. Finally, we derive Fermi's formula for the scattering cross-section valid in the Born approximation.
Read the full abstract

Group Theory

On Zappa's question in the case of alternating groups

In 1962, Guido Zappa asked whether a non-trivial coset of a Sylow $p$-subgroup of a finite group could contain only elements whose orders are powers of $p$. Marston Conder gives a positive answer to this question in the case of $p=5$. It is known that the smallest group satisfying the conditions of this problem must be a non-abelian simple group. In this paper, we prove that the smallest group of the Zappa problem could not be an alternating simple group for any prime $p$.
Read the full abstract

Combinatorics

The ABCT Variety $V(3,n)$ is a Positive Geometry

The ABCT variety $V(3,n)$ is the image closure of the rational Veronese map from the Grassmannian $\operatorname{Gr}(2,n)$ to the Grassmannian $\operatorname{Gr}(3,n)$. It was studied by Arkani-Hamed–Bourjaily–Cachazo–Trnka in the context of tree-level scattering amplitudes arising in planar $\mathcal N=4$ supersymmetric Yang-Mills theory and Witten's twistor string theory. From this perspective, $V(3,n)$ is conjectured to be a positive geometry by Lam. In this paper, we study the combinatorial and algebraic geometry aspects of $V(3,n)$ and its subvarieties induced by iteratively taking analytic boundaries of the totally nonnegative part. We interpret these subvarieties as point configurations on $\mathbb{P}^2$ by the Gelfand-MacPherson correspondence. We construct a top-degree meromorphic form on $V(3,n)$ and show that it is a positive geometry, proving Lam's conjecture.
Read the full abstract

Group Theory

The group identification problem for $p$-groups of small order

We investigate which group-theoretic invariants are powerful in distinguishing among non-isomorphic p-groups. Based on this, we devise an effective algorithm to solve the group identification problem for the $10,494,213$ groups of order $2^9$. We exhibit 56 pairs of groups of order $2^9$ which are difficult to distinguish by invariants.
Read the full abstract

Optimization and Control

SHANG++: Robust Stochastic Acceleration under Multiplicative Noise

Under the multiplicative noise scaling (MNS) condition, original Nesterov acceleration is provably sensitive to noise and may diverge when gradient noise overwhelms the signal. In this paper, we develop two accelerated stochastic gradient descent methods by discretizing the Hessian-driven Nesterov accelerated gradient flow. We first derive SHANG, a direct semi-implicit discretization that already improves stability under MNS. We then introduce SHANG++, which adds a damping correction and achieves faster convergence with greater noise robustness. We establish convergence guarantees for both convex and strongly convex objectives under MNS, together with explicit parameter choices. In our experiments, SHANG++ performs consistently well across convex problems and applications in deep learning. In a dedicated noise experiment on ResNet-34, a single hyperparameter configuration maintains accuracy within one percentage point of the noise-free setting. Across all experiments, SHANG++ outperforms existing accelerated methods in robustness and efficiency, with minimal parameter sensitivity.
Read the full abstract

Number Theory

On a cyclic structure of generators modulo primes

In this paper, we introduce a new notion called the set of missing generators $\mathcal{M}(g)$ for a generator (or primitive element) $g$ of the cyclic group $\mathbb{Z}_p^*$, where $p$ is an odd prime. The cardinality of $\mathcal{M}(g)$ is established for all odd primes $p$. For primes $p$ of the form $2^iq_1^{j_1}q_2^{j_2}+1$, the collection $V_p = \{ \mathcal{M}(g):g\in \mathcal{G} \}$ forms an equinumerous partition of $\mathcal{G}$ (the set of all generators of $\mathbb{Z}_p^*$), and a digraph defined on the vertex set $V_p$ is a disjoint collection of unicycles of the same size. Thus, for every such prime, an unique triplet $(c,n,e)$ of integers, describing the structure of the digraph of missing generators, can be associated. With the help of cyclic structure, we present a macroscopic additive property of generators of $\mathbb{Z}_p^*$. Further, we show that factoring RSA numbers is computationally equivalent to computing $T(p)$, under the assumption that there exists an absolute constant $k$ such that the set $\{2^iN^j+1: 1\leq i,j<\log^k N\}$ contains a prime for any given odd $N$.
Read the full abstract

Optimization and Control

On Real-Time Feasibility of High-Rate MPC using an Active-Set Method on Nano-Quadcopters

Deploying Model Predictive Control on nano-scale aerial platforms is challenging due to the severe computational limitations of onboard microcontrollers. This paper presents an experimental study with computational focus of a dual active-set solver (DAQP) applied to the low-level control of a Crazyflie 2.1 nano-quadcopter. Unlike previous approaches that utilize first-order methods for low-level stabilization or restrict active-set solvers to high-level control, this work demonstrates the successful deployment of a dual active-set method executing at 500 Hz on an STM32F405 microcontroller. We provide a direct benchmark against a state-of-the-art ADMM-based solver (TinyMPC), revealing that the active-set method yields lower execution times for the flight envelopes considered. Furthermore, to manage the complexity of certifying the solver's real-time feasibility, we introduce a data-driven set selection method using Principal Component Analysis. Using this approach, state-of-the-art real-time certification methods can be applied to confirm or reject real-time feasibility already off-line prior to flight. More generally, the experimental results validate that active-set methods are a highly competitive alternative for high-frequency control on resource-constrained hardware and the possibility for their real-time certification adds reliability.
Read the full abstract

Statistics Theory

Second order asymptotics for the number of times an estimator is more than epsilon from its target value

Suppose $\{\widehat\theta_n\colon n\ge1\}$ is a strongly consistent sequence of estimators for a parameter $\theta$, where $\widehat\theta_n$ is based on the first $n$ observations. Consider $Q_\varepsilon$, the number of times $|\widehat\theta_n-\theta|\ge\varepsilon$. In another paper (Hjort and Fenstad, 1992) we have shown that $\varepsilon^2 Q_\varepsilon$ has a limit distribution as $\varepsilon\rightarrow0$, depending only on $\sigma$, the standard deviation of the limit distribution for $\sqrt{n}(\widehat\theta_n-\theta)$, under natural regularity conditions. The present paper investigates some second order asymptotics for differences between $Q_\varepsilon$ variables. The limit of ${\rm E}(Q_{1,\varepsilon}-Q_{2,\varepsilon})$ is calculated in cases where ${\rm E} Q_{1,\varepsilon}/{\rm E} Q_{2,\varepsilon}$ goes to 1, leading to a notion of `asymptotic relative deficiency' in cases where the asymptotic relative efficiency is 1. This is used to distinguish between competing estimators with identical limit distributions. Thus using denominator $n-{1\over3}$ in the familiar formula for estimating a normal variance is better than both $n$ and $n-1$ and indeed all other choices, for example, in the sense of leading to the smallest possible expected number of $\varepsilon$ errors. Results of this type are found in a selection of familiar estimation problems, using limit results for expected differences, and are compared to corresponding asymptotic relative deficiency analysis in the sense of Hodges and Lehmann. Some second order distributional results are reached as well. It is shown how $\varepsilon$ times a $Q_\varepsilon$-difference tends to a variable which is related to some exponential distributions associated with Brownian motion, and that have recently been investigated by Hjort and Khasminskii (1993).
Read the full abstract

2603.09314 · 10 Mar · 11 pages, no figures; Statistical Research Report, Department of Mathematics, University of Oslo, September 1994, but now arXiv'd March 2026. The paper has appeared in essentially this form in Journal of Statistical Planning and Inference, 1995, vol. 48, pages 261-275, at this url: www.sciencedirect.com/science/article/pii/037837589500008W

Probability · Cross-listed from cs.LG

A Gaussian Comparison Theorem for Training Dynamics in Machine Learning

We study training algorithms with data following a Gaussian mixture model. For a specific family of such algorithms, we present a non-asymptotic result, connecting the evolution of the model to a surrogate dynamical system, which can be easier to analyze. The proof of our result is based on the celebrated Gordon comparison theorem. Using our theorem, we rigorously prove the validity of the dynamic mean-field (DMF) expressions in the asymptotic scenarios. Moreover, we suggest an iterative refinement scheme to obtain more accurate expressions in non-asymptotic scenarios. We specialize our theory to the analysis of training a perceptron model with a generic first-order (full-batch) algorithm and demonstrate that fluctuation parameters in a non-asymptotic domain emerge in addition to the DMF kernels.
Read the full abstract

Optimization and Control

Worst-Case and Covariance-Reconstruction Robust Adaptive Beamforming: Equivalence and Closed-Form Solution

Robust adaptive beamforming (RAB) has developed along two separate lines. The worst-case-constrained approach guards against steering vector mismatch with a bounded uncertainty set, but suffers from desired signal cancellation at high input signal-to-noise ratio (SNR). The covariance-reconstruction approach instead estimates the interference-plus-noise covariance matrix and solves for the mismatch numerically. We prove that the two are related by primal-dual equivalence: once the worst-case beamformer is normalized, it coincides exactly with the reconstruction-based one, so both reduce to one formulation. The signal cancellation of the worst-case approach is a consequence of its parameter choice, not of the formulation. For the unified problem we develop a closed-form solution in three stages: Diagonalization Transform, Phase Alignment, and Karush-Kuhn-Tucker (KKT) Solution. Instead of solving for the Lagrange multiplier, we introduce an auxiliary variable that reduces the KKT system to a single scalar equation solvable by bisection. For an $N$-sensor array the cost is $\mathcal{O}(N^{3})$, the same order as the Lagrange-equation-based RMVB and well below the $\mathcal{O}(N^{3.5})$ of a second-order cone program, and it covers the rank-deficient case that RMVB excludes. We establish necessary and sufficient conditions for existence and uniqueness, including a case where the feasible set is nonempty yet no optimal solution exists, and show that the Lagrange multiplier fixes the optimal value. Simulations confirm that, with matching parameters, the worst-case beamformer attains the output signal-to-interference-plus-noise ratio (SINR) of the reconstruction-based one, and that the closed-form solution reproduces the optimum of convex solvers in a fraction of their time.
Read the full abstract

All authors Licheng Zhao, Rui Zhou, Wenqiang Pu, Daniel P. Palomar

Optimization and Control

Telehealth Control Policies: Bridging the Gap Between Patients and Doctors

This paper studies a sequential decision-making problem in a two-stage queueing system modeled after operations in CVS MinuteClinics, where nurse practitioners (NPs) oversee patient care throughout the entire visit. All services are non-preemptive, and NPs cannot begin treating a new patient until the current patient has completed both stages of care. Following an initial diagnosis in the upstream phase, NPs must decide for low-acuity patients whether to proceed with treatment independently through immediate service, or to collaborate with a dedicated general physician (GP) via telemedicine. While collaboration typically improves service quality and is preferred by individual patients, it may introduce delays as the NP-patient pair waits for a GP to become available. This work explores the structural properties of optimal policies under different system parameters, with a focus on large initial upstream queues, revealing unconventional and complex policy behaviors. Leveraging these structural insights and supporting theoretical results, we design simple and effective heuristics that are computable in linear time and suitable for practical implementation. These heuristics are robust across the entire parameter space of interest, and offer clear, actionable guidance for NPs as system parameters vary. They also achieve near-optimal performance, averaging within 0.1% of the optimal, while commonly used benchmark policies are highly sensitive to parameter shifts and can incur costs more than 100% higher than optimal. The work provides applicable insights for decision-makers on improving policy robustness and effectiveness, as well as recommendations for stakeholders on the value of investing in telemedicine infrastructure. For instance, we identify scenarios where such investments may be either unnecessary or essential based on specific system parameters.
Read the full abstract

Information Theory

Tensor Train Decomposition-based Channel Estimation for MIMO-AFDM Systems with Fractional Delay and Doppler

Affine Frequency Division Multiplexing (AFDM) has emerged as a promising chirp-based multicarrier technology for high-speed communication systems. To fully exploit the diversity gain offered by AFDM, accurate channel estimation is essential. However, existing studies have mainly focused on the integer-delay-tap scenario and single-symbol pilot-based estimation. Since delay taps in practice are generally fractional, approximating them as integers not only degrades delay estimation accuracy but also severely affects Doppler frequency estimation. To address this problem, in this paper, we investigate channel estimation for multiple-input multiple-output (MIMO)-AFDM systems. A time-affine frequency (T-AF) domain pilot structure is proposed to exploit time-domain phase variations. By leveraging the rotational invariance property in the spatial and temporal domains, a channel estimation algorithm based on Vandermonde-structured tensor-train (TT) decomposition is developed. The proposed algorithm demonstrates superior computational efficiency compared with state-of-the-art parameter estimation methods. Moreover, diverging from current studies, we derive the global Ziv-Zakai bound (ZZB) as an alternative parameter estimation error lower bound to the Cramér-Rao bound (CRB). Numerical results show that the derived ZZB provides tighter global performance characterization and successfully captures the threshold phenomenon in mean square error (MSE) performance in the low-SNR regime. Furthermore, the proposed algorithm achieves superior communication performance relative to the existing schemes, while offering a computational speedup, reducing the execution time by an order of magnitude compared to the state-of-the-art iterative algorithms.
Read the full abstract

All authors Ruizhe Wang, Cunhua Pan, Hong Ren, Haisu Wu, Jiangzhou Wang

Number Theory

On the Green-Tao theorem for sparse sets

We establish the following quantitative form of the Green–Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll \exp(-(\log \log \log N)^{c_k})$ for some $c_k>0$. This improves on previous work of Rimanić and Wolf. The main new ingredients in the proof are a version of the Leng–Sah–Sawhney quasipolynomial inverse theorem for unbounded functions and a dense model theorem with quasipolynomial dependencies, which may be of independent interest.
Read the full abstract

Algebraic Geometry

Stable Degenerations of log Fano Fibration Germs

We prove the stable degeneration conjecture of log Fano fibration germs formulated by Sun-Zhang. Precisely, we introduce the $\mathbf{H}$-invariant for filtrations over a log Fano fibration germ, and show that there exists a unique quasi-monomial valuation $v_0$ minimizing the $\mathbf{H}$-invariant. Moreover, we prove that the associated graded ring of $v_0$ is finitely generated and induces a special degeneration to a K-semistable polarized log Fano fibration germ, which further admits a unique K-polystable special degeneration.
Read the full abstract

All authors Jiyuan Han, Minghao Miao, Lu Qi, Linsheng Wang, Tong Zhang

Information Theory

Joint Precoding and Phase-Shift Optimization for Beyond-Diagonal RIS-Aided ISAC System

Beyond diagonal reconfigurable intelligent surfaces (BD-RIS) can realize the interconnection between reflecting elements through the impedance network, thereby providing a new approach for the performance improvement of integrated sensing and communication (ISAC) systems. This paper investigates the optimization problem of BD-RIS-aided multiuser ISAC system, aiming to achieve the flexible design of trade-offs between communication and sensing performance. Specifically, we propose an optimization framework jointly combining the multiuser interference management and sensing beam gain approximation method. By jointly optimizing the precoding vector and RIS phase-shift matrix, improving the multiuser communication sum rate through the proposed interference management method, and enhancing the system sensing performance through the beam gain approximation method. For the resulting non-convex weighted optimization problem, we employ the alternating optimization (AO) algorithm to decouple it into two subproblems of precoding vector and phase-shift matrix optimization, with each step admitting closed-form solutions.Simulation results demonstrate that the proposed BD-RIS-aided ISAC system can achieve significant improvement in the trade-offs between communication and sensing performance than the traditional diagonal RIS, verifying the effectiveness of the proposed optimization framework.
Read the full abstract

All authors Xuejun Cheng, Qian Zhang, Yuhui Jiao, Shiyao Guo, Xiaotong Xu, Guanghui Luo, Ju Liu

Analysis of PDEs

$L^2$-contraction of Shock Waves for KdV-Burgers Equation

The KdV-Burgers equation is a canonical model describing the interplay between nonlinearity, viscosity and dispersion, and it admits viscous-dispersive shocks as traveling wave solutions. In this paper, we establish an $L^2$-contraction property for viscous-dispersive shocks under arbitrarily large perturbations, up to a time-dependent shift. This yields time-asymptotic stability and uniform estimates with respect to the strengths of viscosity and dispersion. We present the proof for the monotone shocks, and introduce the companion work in [6] on the stability and structural properties of oscillatory shocks.
Read the full abstract

All authors Geng Chen, Namhyun Eun, Moon-Jin Kang, Yannan Shen

Number Theory

Frobenius structure on rigid connections and arithmetic applications

We construct the natural Frobenius structures on two families of rigid irregular $\check{G}$-connections on $\mathbb{G}_m$ (or $\mathbb{A}^1$) for a split simple group $\check{G}$: (i) the $\theta$-connections arising from Vinberg's $\theta$-groups introduced by Chen and Yun; (ii) the Airy connection of Jakob–Kamgarpour–Yi generalizing the classical Airy equations. These data form the $p$-adic companions of the $\ell$-adic local systems introduced by Yun and Jakob–Kamgarpour–Yi. Via the Frobenius structures, we study the local monodromy representations of these local systems at the unique wildly ramified point and verify the prediction of Reeder–Yu on epipelagic Langlands parameters in our setting. We calculate the global geometric monodromy group of a special Airy $\check{G}$-local system via its local monodromy. We show the cohomological rigidity and the physical rigidity of these local systems, as conjectured by Heinloth–Ngô–Yun.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ML

A Generative Sampler for distributions with possible discrete parameter based on Reversibility

Learning to sample from complex unnormalized distributions is a fundamental challenge in computational physics and machine learning. While score-based and variational methods have achieved success in continuous domains, extending them to discrete or mixed-variable systems remains difficult due to ill-defined gradients or high variance in estimators. We propose a unified, target-gradient-free generative sampling framework applicable across diverse state spaces. Building on the fact that detailed balance implies the time-reversibility of the equilibrium stochastic process, we enforce this symmetry as a statistical constraint. Specifically, using a prescribed physical transition kernel (such as Metropolis-Hastings), we minimize the Maximum Mean Discrepancy (MMD) between the joint distributions of forward and backward Markov trajectories. Crucially, this training procedure relies solely on energy evaluations via acceptance ratios, circumventing the need for target score functions or continuous relaxations. We demonstrate the versatility of our method on three distinct benchmarks: (1) a continuous multi-modal Gaussian mixture, (2) the discrete high-dimensional Ising model, and (3) a challenging hybrid system coupling discrete indices with continuous dynamics. Experiments show that our framework accurately reproduces thermodynamic observables and captures mode-switching behavior across all regimes, offering a physically grounded and universally applicable alternative for equilibrium sampling.
Read the full abstract

Analysis of PDEs

Identification of a Point Source in the Heat Equation from Sparse Boundary Measurements

In this work we investigate the inverse problem of recovering one point source in the heat equation from sparse boundary measurement, i.e., the flux data at several points on the boundary. We prove the unique recovery of the location and piecewise constant in time amplitude when the domain is the unit ball in $\mathbb{R}^d$ ($d\geq2$), and the unique recovery of the location and compactly supported amplitude when the domain is simply connected, smooth and bounded in $\mathbb{R}^2$, under mild conditions on the observational points. The proof combines distinct analytical tools, including the representation of the flux data via Laplacian eigenfunctions on the unit ball, a detailed analysis of the properties of the heat and Poisson kernels, as well as methods drawn from complex analysis. Further we present several numerical experiments to illustrate the feasibility of the recovery from sparse boundary data.
Read the full abstract

All authors Fangyu Gong, Bangti Jin, Yavar Kian, Sizhe Liu

Dynamical Systems

Localized state for nonlinear disordered stark model

In this paper, we consider the following nonlinear disordered Stark model: $${\bf i}\partial_tu_n+\delta(u_{n+1}+u_{n-1})+nu_n+v_nu_n+\epsilon |u_n|^{2}u_n=0,\quad n\in\mathbb{Z}.$$ By employing the diagonalization of the associated linear operators and the KAM theory for nonlinear Hamiltonian systems, we establish that for parameters $\delta$ and $\varepsilon$ in a reasonable range, and for most realization of random variables $v=\{v_n\}_{n \in \mathbb{Z}}$, there exist time quasi-periodic and spatially localized states that exhibit arbitrary power-law spatial decay.
Read the full abstract

Analysis of PDEs

Uniform-in-diffusivity mixing by shear flows: stochastic and dynamical perspectives

We study passive scalar mixing by parallel shear flows in the presence of weak molecular diffusion. We recover the sharp uniform-in-diffusivity mixing rate for shear flows with finitely many critical points, recently proven in [1]. Our approach is based on the stochastic representation formula of the associated advection-diffusion equation and yields two short proofs. The first uses a stochastic integration-by-parts argument and gives optimal mixing under the weakest regularity assumption required in the zero-diffusion case, answering Question II in [1, Section 4]. The second adopts a dynamical systems perspective and provides a proof of shear-induced mixing that, to our knowledge, is new even in the zero-diffusivity setting.
Read the full abstract

Mathematical Physics

State integral models and the tetrahedron equation

It is shown that for a class of state integral models on shaped pseudo 3-manifolds, including the edge formulation of Teichmüller TQFT, the Boltzmann weight assigned to a tetrahedron solves the tetrahedron equation. The dihedral angles of the tetrahedron play the role of spectral parameters.
Read the full abstract

Analysis of PDEs · Cross-listed from nlin.SI

Lax Pairs: Integrable, Less Integrable and Nonintegrable Systems

Completely integrable finite dimensional Hamiltonian systems are well understood thanks to the work of Liouville and Arnold. On the other hand, the Lax Pair formulation of the KdV equation marks the beginning of the extension of the completely integrable theory to infinite dimensional Hamiltonian systems. Solutions of initial value problems for systems that admit a Lax Pair formulation normally have a tame qualitative behavior if Lax Pairs give rise to an infinite complete set of conserved laws. The situation is different for initial-boundary value problems, even in one space dimension. There are problems where integrability persists and regular (long time asymptotic) behavior can be proven (and we have proven it). There are others where even irregular "fractal-chaotic-looking" behavior can appear. In this short article we review an instance of each case. We also make a connection with results from the existing theory of perturbed Lax Pair equations on the real line.
Read the full abstract

Probability

Asymptotics for a nonstandard risk model with multivariate subexponential claims and constant interest force

In this paper, the asymptotic behavior of the entrance probability of discounted aggregate claims of a certain family of rare sets is studied, considering the finite and infinite time horizons. This multivariate risk model, driven by a common counting process, has a constant interest rate and allows the interdependence of claim vectors. For the finite time horizon, the multivariate subexponential distribution of the common claim vector and the weak dependence structure of regression dependence are used. For the infinite time horizon, the claim vector is taken from a smaller distribution class, and the weak dependence structure is more general. Both results are derived under some additional assumptions on the moments of the counting process, which is fulfilled by all inhomogeneous renewal processes and many quasi-renewal processes, respectively. Moreover, the results are specialized to the multivariate regularly varying case, where more explicit results on the asymptotic behavior of the entrance probability of the discounted aggregate claims are derived. At the end of the paper, the results obtained are used to study the finite and infinite time horizon ruin problems of a risk model with eventual Brownian perturbations.
Read the full abstract

Spectral Theory

Semiclassical WKB Problem for the non-self-adjoint Dirac operator

We review some recent rigorous results on the semiclassical behavior ($\epsilon\downarrow0$) of the scattering data of a non-self-adjoint Dirac operator with potential $A\exp\{iS/\epsilon\}$ where both $A$ and $S$ are differentiable functions tending to constants as $x \to \pm \infty$. We have either employed the so-called exact WKB method, or the older WKB theory of Olver. Our analysis is motivated by the need to understand the semiclassical behaviour of the focusing cubic NLS equation with initial data $A\exp\{iS/\epsilon\}$, in view of the well-known fact discovered by Zakharov and Shabat that the spectral analysis of the Dirac operator enables us to obtain the solution of the NLS equation via inverse scattering theory.
Read the full abstract

Analysis of PDEs

Existence and singularity formation for the supersonic expanding wave of radially symmetric non-isentropic compressible Euler equations

This paper studies the existence and singularity formation of supersonic expanding waves for the radially symmetric non-isentropic compressible Euler equations of polytropic gases. We introduce a suitable pair of gradient variables to characterize the rarefaction and compression properties of the solutions. Based on their Riccati equations, we construct several useful invariant domains to establish a series of priori estimates of solutions under some assumptions on the initial data. We show that the solution is smooth in the characteristic triangle or quadrangle domain if both of these two gradient variables are non-negative at the initial time. On the other hand, when one of these two variables is very negative at some initial point, the solution forms a singularity in finite time.
Read the full abstract

Functional Analysis

On the extension of inner derivations from dense ideals in Banach algebras

Let $A$ be a Banach algebra and $I$ a dense ideal in $A$. A natural question in the theory of operator algebras is whether the property that all derivations $D: A \to I$ are inner (implemented by elements in $I$) implies that all derivations $D: A \to A$ are inner (implemented by elements in $A$). We present a rigorous negative answer to this question. By utilizing the algebra of compact operators $A = K(H)$ and the dense ideal of finite-rank operators $I = F(H)$ on a separable infinite-dimensional Hilbert space $H$, we demonstrate that while every derivation into $F(H)$ is inner, there exist outer derivations on $K(H)$. Furthermore, we generalize this result to Schatten $p$-classes and discuss the cohomological implications and the role of approximate identities. Moreover, the main results and counterexamples presented in this paper have been formally verified using the Lean theorem prover.
Read the full abstract

Number Theory

Iwasawa Invariants of Even $K$-groups of Rings of Integers in the $\mathbb{Z}_2$-extension over Real Quadratic Number Fields

Let $F$ be a real quadratic number field, and let $F_{cyc}$ denote its cyclotomic $\mathbb{Z}_2$-extension. For each integer $n\geq0$, let $F_n$ be the unique intermediate field in $F_{cyc}$ such that $[F_n:F]=2^n$. By studying the $2$-adic divisibility of Dirichlet $L$-series at negative integers, we derive an asymptotic formula that determines the order of the $2$-primary part of even $K$-groups of rings of integers of $F_n$ for sufficiently large $n$. As a corollary, we determine their $\lambda$ and $\mu$ invariants. We also establish a lower bound for $n$ beyond which this asymptotic formula holds. Our results have two main applications: (1) For $K=\mathbb{Q}$, $\mathbb{Q}(\sqrt{p})$ or $\mathbb{Q}(\sqrt{2p})$ with $p\equiv\pm3\mod 8$, we determine the structure of the $2$-primary tame kernels $K_2\mathcal{O}_{K_n}(2)$; (2) We explicitly determine the three Iwasawa invariants $\lambda,\mu,\nu$ for a family of real quadratic number fields, whose discriminants have arbitrarily many prime divisors.
Read the full abstract