Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 25 March

Algebraic Geometry

On the dynamical degree of surjective endomorphisms

We establish a couple of dynamical properties of surjective rational maps $f: X \dashrightarrow X$ for smooth projective surfaces $X$. We also give a numerical condition for regularity of $f$. Some explicit constructions and calculations, related to the topological entropy of $f$, are provided.
Read the full abstract

Combinatorics · Cross-listed from stat.OT

Tackling the 6/49 Lottery and Debunking Common Myths with Probabilistic Methods and Combinatorial Designs

At the end, the house always wins! This simple truth holds for all public games of chance. Nevertheless, since lotteries have existed, people have tried everything to give luck a helping hand. This article compares objective scientific approaches to tackle the 6/49 lottery: probabilistic methods and combinatorial designs. The mathematical models developed herein can be modified and applied to other lotteries. The newly constructed (49, 6, 5) covering design is introduced, which meets the Schönheim bound. For lottery designs and for covering designs, a benchmark based on probabilistic methods is presented. It is demonstrated that common attempts to outwit the odds correspond to limitations of numbers to subsets, which disproportionately reduce the chances of winning.
Read the full abstract

Functional Analysis

A non-vanishing property for tensor products of wavelets

We prove that, given a wavelet $\psi$, it is possible to choose some multi-integers $(p_j=(p_{j,1},...,p_{j,d}))_{j \in \mathbb{Z}} \in \mathbb{Z}^d$ such that, for every $x=(x_1,...,x_d) \in \mathbb{R}^d$, for infinitely many integers $j$, the tensorized wavelet $\prod_{i=1}^d \psi(2^j x_i-p_{j,i})$ does not vanish at $x$. This non-vanishing property is essential for analyzing some generic regularity properties in certain Sobolev and Besov spaces. The proof relies on an assumption regarding the zeros of $\psi$, which we numerically verify for the first Daubechies wavelets.
Read the full abstract

Analysis of PDEs

Density Measures

The paper treats density measures as typical examples of finitely additive measures in $\mathbb{R}^n$. We study their structure and derive basic properties. In addition, estimates for related integrals are provided. The results are applied to the precise representative of general integrable functions and then they are specialized to functions of bounded variation. Moreover, a new representation of the generalized gradients in the sense of Clarke is given for the finite dimensional case.
Read the full abstract

Numerical Analysis

Probabilistic Error Analysis of Limited-Precision Stochastic Rounding: Horner's Algorithm and Pairwise Summation

Stochastic rounding (SR) is a probabilistic rounding mode that mitigates errors in large-scale numerical computations, especially when prone to stagnation effects. Beyond numerical analysis, SR has shown significant benefits in practical applications such as deep learning and climate modelling. The definition of classical SR requires that results of arithmetic operations are known with infinite precision. This is often not possible, and when it is, the resulting hardware implementation can become prohibitively expensive in terms of energy, area, and latency. A more practical alternative is limited-precision SR, which only requires that the outputs of arithmetic operations are available in higher, finite, precision. We extend previous work on limited-precision SR presented in [El Arar et al., SIAM J. Sci. Comput. 47(5) (2025), B1227-B1249], which developed a framework to evaluate the trade-off between accuracy and hardware resource cost in SR implementations. Within this framework, we study the Horner algorithm and pairwise summation, providing both theoretical insights and practical experiments in these settings when using limited-precision SR.
Read the full abstract

All authors El-Mehdi El Arar, Massimiliano Fasi, Silviu-Ioan Filip, Mantas Mikaitis

Statistics Theory

Penalized estimation of GEV parameters for extreme quantile regression

Quantile regression (QR) relies on the estimation of conditional quantiles and explores the relationships between independent and dependent variables. At high probability levels, classical QR methods face extrapolation difficulties due to the scarcity of data in the tail of the distribution. Another challenge arises when the number of predictors is large and the quantile function exhibits a complex structure. In this work, we propose an estimation method designed to overcome these challenges. To enhance extrapolation in the tail of the conditional response distribution, we model block maxima using the generalized extreme value (GEV) distribution, where the parameters depend on covariates. To address the second challenge, we adopt an approach based on generalized random forests (grf) to estimate these parameters. Specifically, we maximize a penalized likelihood, weighted by the weights obtained through the grf method. This penalization helps overcome the limitations of the maximum likelihood estimator (MLE) in small samples, while preserving its optimality in large samples. The effectiveness of our method is validated through comparisons with other approaches in simulation studies and an application to U.S. wage data.
Read the full abstract

All authors Lucien M. Vidagbandji, Alexandre Berred, Cyrille Bertelle, Laurent Amanton

Analysis of PDEs

On the explicit formula linking a function to the order of its fractional derivative

In this paper, given a certain regularity of a function $v$, we derive an explicit formula relating the order $\nu_0\in(0,1)$ of the leading fractional derivative in a fractional differential operator $\mathbf{D_t}$ with the variable coefficients $r_i=r_i(x,t)$ and the function $v$ on which this operator acts. Moreover, we discuss application of this result in the reconstruction of the memory order of semilinear subdiffusion with memory terms. To achieve this aim, we analyze some inverse problems to multi-term fractional in time ordinary and partial differential equations with smooth local or nonlocal additional measurements for small time. In conclusion, we discuss how this formula may be exploited to numerical computation of $\nu_0$ in the case of discrete noisy observation in the corresponding inverse problems. Our theoretical results along with the computational algorithm are supplemented by numerical tests.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Linear-Nonlinear Fusion Neural Operator for Partial Differential Equations

Neural operator learning directly constructs the mapping relationship from the equation parameter space to the solution space, enabling efficient direct inference in practical applications without the need for repeated solution of partial differential equations (PDEs) – an advantage that is difficult to achieve with traditional numerical methods. In this work, we find that explicitly decoupling linear and nonlinear effects within such operator mappings leads to improved learning efficiency. This yields a novel network structure, namely the Linear-Nonlinear Fusion Neural Operator (LNF-NO), which models operator mappings via the multiplicative fusion of a linear component and a nonlinear component, thus achieving a lightweight and interpretable representation. This linear-nonlinear decoupling enables efficient capture of complex solution features at the operator level while maintaining stability and generality. LNF-NO naturally supports multiple functional inputs and is applicable to both regular grids and irregular geometries. Across a diverse suite of PDE operator-learning benchmarks, including nonlinear Poisson-Boltzmann equations and multi-physics coupled systems, LNF-NO is typically substantially faster to train than several representative neural operator baselines, while achieving comparable or improved accuracy across most tested cases. On the tested 3D Poisson-Boltzmann case, LNF-NO achieves strong accuracy while requiring substantially less training time than the three-dimensional Fourier Neural Operator and Transolver baselines.
Read the full abstract

General Mathematics

The Degree Landscape of the Partition Graph: Maximal Degree, Extremal Vertices, and Spectra

We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by reordering. Using the previously established local degree formula, we introduce the degree layers $D_d(n)$, the degree spectrum $Spec_D(n)$, and the numerical invariants $\Delta_n$, $m_\Delta(n)$, and $s(n)$. The main theorem provides an exact formula for the maximal degree. If $$ \rho(n):=\max\{r:T_r\le n\},\qquad T_r=\frac{r(r+1)}{2}, $$ and $$ \nu:=n-T_{\rho(n)}, $$ then $$ \Delta_n=\rho(n)\bigl(\rho(n)-1\bigr)+\beta_{\rho(n)}(\nu), $$ where $\beta_r$ is an explicit budget function governed by a square–pronic threshold rule. We also prove that every maximal-degree vertex lies on the maximal-support stratum, and we obtain exact extremal classifications at the levels $n=T_t$, $n=T_t+1$, and $n=T_t+2$. The paper also includes a finite computation on the range $1\le n\le 60$, recording extremal multiplicities, representative extremal shapes, spectrum sizes, selected degree histograms, and first data on contact between the extremal layer and the self-conjugate axis. This computational part is deliberately limited in scope. It is descriptive rather than exhaustive, and is included only as a first numerical profile of the degree landscape.
Read the full abstract

Probability

Cycle structure of random standardized permutations

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased permutations. We first establish an exact result on the joint distribution of the number of cycles of given lengths, involving the notion of primitive words. From this result, we obtain various convergence results, most of which are proved using the method of moments. First we prove that the number of small cycles may have either a Poisson limit distribution, or a limit distribution given by a countable sum of independent geometric distributions. Then we establish a limit distribution for large cycles, which is the Poisson-Dirichlet process. Finally we prove a central limit theorem for the total number of cycles.
Read the full abstract

Number Theory

The average number of representations of an integer as a sum of two prime powers over multiples of a fixed integer

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

Analysis of PDEs

On a semilinear heat equation on infinite graphs II: blow-up for arbitrary initial data and global existence

This paper is the second part of the study initiated in a companion work and is devoted to finite-time blow-up and global existence for a semilinear heat equation on infinite weighted graphs. We first establish basic results on mild and classical solutions (which, to the best of our knowledge, were not previously available in the setting of graphs) proving their equivalence under suitable assumptions and showing the existence of a solution between a given sub- and supersolution. We then analyze blow-up and global existence on $\mathbb Z^N$, providing proofs based on methods different from those used on $\mathbb Z^N$ in the existing literature. Moreover, for graphs with positive spectral gap, we prove global existence for small initial data. In contrast with previous functional analytic approaches yielding mild solutions, our method relies on the construction of global-in-time supersolutions and leads to the existence of classical solutions.
Read the full abstract

Analysis of PDEs

On a semilinear heat equation on infinite graphs I: blow-up for large initial data

We investigate finite-time blow-up of solutions to the Cauchy problem for a semilinear heat equation posed on infinite graphs. Assuming that the initial datum is sufficiently large, we establish a general blow-up criterion valid on arbitrary infinite graphs. We then apply this result to specific classes of graphs, including trees and the integer lattice. The approach developed in the paper can be regarded as a discrete counterpart of Kaplan's method, suitably adapted to the graph setting. In a companion paper, which is the second part of this work, we also complement the blow-up analysis by addressing arbitrary initial data and proving global existence for sufficiently small data.
Read the full abstract

Dynamical Systems

How delay, isolation and vaccination shape epidemic waves: a bifurcation approach in mathematical epidemiology

This research paper introduces an SQIR-V epidemic model to investigate the transmission of infectious diseases. Particular attention is paid to the roles of vaccination and quarantine (incorporating physical distancing interventions) in protecting susceptible individuals. The model features nonlinear transition rates that depend on the history of infection, allowing the emergence of periodic solutions. We calculate the basic reproduction number, R 0 , and analyze the local asymptotic stability of the equilibrium points. Additionally, we demonstrate that the diseasefree equilibrium is globally asymptotically stable when R 0 $\le$ 1. The study further explores the existence of periodic solutions through a Hopf bifurcation, showing the occurrence of epidemic waves. A condition was derived to determine the direction of the crossing of the imaginary axis. We finish by presenting some numerical simulations to illustrate how vaccination and isolation delays influence disease dynamics. Those findings highlight potential areas for further research and validation.
Read the full abstract

All authors Mehdi Bouziane, Silia Bercisse, Abdennasser Chekroun, Simon Girel

Analysis of PDEs

Nonexistence of single-bubble solutions for a slightly supercritical Choquard equation

In this paper, we consider the existence of positive solutions to the following slightly supercritical Choquard equation \begin{equation*} \begin{cases} -\Delta u=\displaystyle\Big(\int\limits_{\Omega}\frac{u^{2^*_{\alpha}+\varepsilon}(y)}{|x-y|^\alpha}dy\Big)u^{2^*_{\alpha}-1+\varepsilon},\quad u>0\ \ &\mbox{in}\ \Omega, \quad \ \ u=0 \ \ &\mbox{on}\ \partial \Omega, \end{cases} \end{equation*} where $N\geq 3$, $\Omega$ is a smooth bounded domain in $\mathbb{R}^{N}$, $\alpha\in (0,N)$, $2^*_{\alpha}:=\frac{2N-\alpha}{N-2}$ is the upper critical exponent in the sense of Hardy-Littlewood-Sobolev inequality and $\varepsilon>0$ is a small parameter. In contrast with the slightly subcritical Choquard equation studied by Chen and Wang (Calculus of Variations and Partial Differential Equations, 63:235, 2024), we find that there is no chance to construct a family of single-bubble solutions as $\varepsilon\to 0^{+}$.
Read the full abstract

Analysis of PDEs

Eventual regularity of the volume-preserving mean curvature flow in three and two dimensions

The recent work of Morini-Oronzio-Spadaro and the third author shows that, in three dimensions, a flat-flow solution of the volume-preserving mean curvature flow that converges to a single ball, which is the case for instance when the initial perimeter is less than that of two disjoint balls, converges exponentially fast in Hausdorff distance. In this paper we strengthen this result by proving that after a finite time the flow becomes smooth, satisfies the equation in the classical sense and converges exponentially fast to the limiting ball in every C^k-norm. In the proof we develop a version of Brakke's epsilon regularity theorem adapted to our setting and derive the necessary nonlinear PDE estimates directly at the level of the discrete minimizing-movement scheme. The same result holds in the planar case.
Read the full abstract

Analysis of PDEs

Existence and asymptotics for the upper critical Choquard equation in dimension three

In this paper, we are interested in the existence and asymptotic behavior of least energy solutions to the upper critical Choquard equation \begin{equation*} \begin{cases} -\Delta u+au=\displaystyle\left(\int_{\Omega}\frac{u^{6-\alpha}(y)}{|x-y|^\alpha}dy\right)u^{5-\alpha}&\mbox{in}\ \Omega, u>0 \ \ &\mbox{in}\ \Omega, u=0 \ \ &\mbox{on}\ \partial \Omega, \end{cases} \end{equation*} where $\Omega \subset \mathbb{R}^{3}$ is a bounded domain with a $C^{2}$ boundary, $\alpha \in (0,3)$, $a \in C(\overline{\Omega}) \cap C^{1}(\Omega)$, and the operator $-\Delta + a$ is coercive. We first establish that the following three properties are equivalent: the existence of least energy solutions, the validity of a strict inequality in the associated minimization problem, and the positivity of the Robin function somewhere in the domain. This leads naturally to the definition of a critical function $a$. Under the perturbation $a \mapsto a + \varepsilon V$ with $a$ critical and $V \in L^{\infty}(\Omega)$, we prove that least energy solutions exist. Furthermore, we establish a refined energy estimate and describe their asymptotic profile.
Read the full abstract

Analysis of PDEs

Multiplicity and Regularity Results for Quasilinear Elliptic Systems via Nonsmooth Critical Point Theory

We study the quasilinear elliptic system \[ -\textbf{div}(A(x,\boldsymbol u)|D\boldsymbol u|^{p-2}D\boldsymbol u) +\frac{1}{p}\nabla_{\boldsymbol s}A(x,\boldsymbol u)|D\boldsymbol u|^p = \boldsymbol g(x,\boldsymbol u) \quad \text{in } \Omega, \qquad \boldsymbol u = 0 \text{ on } \partial\Omega, \] where $p>1$, $\Omega\subset\mathbb R^N$ is a bounded domain with $N>1$, and $\boldsymbol g$ satisfies a subcritical growth condition. In this setting, the associated energy functional is, in general, neither differentiable nor locally Lipschitz in the natural Sobolev space. By exploiting a nonsmooth critical point theory, we prove the existence of infinitely many weak solutions by means of an Equivariant Mountain Pass Theorem. In addition, we establish $L^\infty$-bounds for weak solutions by adapting a Moser-type iteration.
Read the full abstract

Analysis of PDEs

Non-local time problem for the Rayleigh–Stokes type fractional equations

Despite the growing interest in fractional generalizations of classical fluid dynamics equations, the fractional Rayleigh–Stokes problem has previously been studied almost exclusively using the Riemann–Liouville fractional derivative. To the authors' knowledge, an explicit analytical form of the solution for the Caputo derivative case has not been established in the literature, and before this work, no systematic study of the existence, uniqueness, or regularity properties of this formulation has been conducted. In this paper, we fill this gap by considering the Rayleigh–Stokes equation with the Caputo fractional time derivative of order $\rho \in (0, \, 1)$. Using the Laplace transform and Fourier methods, as well as special functions, we perform a rigorous well-posedness analysis of the corresponding initial boundary-value, non-local, and backward problems.
Read the full abstract

Information Theory

Unanticipated Adversarial Robustness of Semantic Communication

Semantic communication, enabled by deep joint source-channel coding (DeepJSCC), is widely expected to inherit the vulnerability of deep learning to adversarial perturbations. This paper challenges this prevailing belief and reveals a counterintuitive finding: semantic communication systems exhibit unanticipated adversarial robustness that can exceed that of classical separate source-channel coding systems. On the theoretical front, we establish fundamental bounds on the minimum attack power required to induce a target distortion, overcoming the analytical intractability of highly nonlinear DeepJSCC models by leveraging Lipschitz smoothness. We prove that the implicit regularization from noisy training forces decoder smoothness, a property that inherently provides built-in protection against adversarial attacks. To enable rigorous and fair comparison, we develop two novel attack methodologies that address previously unexplored vulnerabilities: a structure-aware vulnerable set attack that, for the first time, exploits graph-theoretic vulnerabilities in LDPC codes to induce decoding failure with minimal energy, and a progressive gradient ascent attack that leverages the differentiability of DeepJSCC to efficiently find minimum-power perturbations. Designing such attacks is challenging, as classical systems lack gradient information while semantic systems require navigating high-dimensional, non-convex spaces; our methods fill these critical gaps in the literature. Extensive experiments demonstrate that semantic communication requires up to $14$-$16\times$ more attack power to achieve the same distortion as classical systems, empirically substantiating its superior robustness.
Read the full abstract

All authors Runxin Zhang, Yulin Shao, Hongyu An, Zhijin Qin, Kaibin Huang

Information Theory

Robust and Secure Near-Field Communication via Curved Caustic Beams

Near-field beamfocusing with extremely large aperture arrays can effectively enhance physical layer security. Nevertheless, even small estimation errors of the eavesdropper's location may cause a pronounced focal shift, resulting in a severe degradation of the secrecy rate. In this letter, we propose a physics-informed robust beamforming strategy that leverages the electromagnetic (EM) caustic effect for near-field physical layer security provisioning, which can be implemented via phase shifts only. Specifically, we partition the transmit array into caustic and focusing subarrays to simultaneously bypass the potential eavesdropping region and illuminate the legitimate user, thereby significantly improving the robustness against the localization error of eavesdroppers. Moreover, by leveraging the connection between the phase gradient and the EM wave departing angle, we derive the corresponding piece-wise closed-form array phase profile for the subarrays. Simulation results demonstrate that the proposed scheme achieves up to an 80% reduction of the worst-case eavesdropping rate for a localization error of 0.25 m, highlighting its superiority for providing robust and secure communication.
Read the full abstract

Numerical Analysis

QuatIca: Advanced Numerical Linear Algebra and Optimization for Quaternionic Matrices in Python

Quaternion-valued representations provide a convenient way to model coupled multi-channel signals (e.g., RGB imagery, polarization data, vector fields, and multi-detector time series). Yet practical and numerically reliable software support remains far less mature than those based on the real/complex setting. Here, we present QuatIca, an open-source Python library for quaternion numerical linear algebra and optimization, designed for both research prototyping and reproducible experimentation. QuatIca provides core quaternion matrix operations and norms; dense decompositions and reductions (QR, LU, Q-SVD, eigendecomposition, Hessenberg/tridiagonal reduction, Cholesky decomposition, and Schur helpers); iterative solvers including quaternion GMRES (with preconditioning) and Newton-Schulz pseudoinverse schemes; and domain-focused routines for signal and image processing such as quaternion Tikhonov restoration. The library also includes OptiQ, which solves quaternion Hermitian semidefinite programs using log-det barrier Newton methods with $\mu$-continuation. We highlight design choices that preserve quaternion structure, and we provide end-to-end demonstrations including quaternion image deblurring, Lorenz-attractor filtering, and quaternion image completion. QuatIca is distributed via PyPI and accompanied by open-source development on GitHub and continuously deployed documentation with runnable tutorials.
Read the full abstract

All authors Valentin Leplat, Salman Ahmadi-Asl, Junjun Pan, Henni Ouerdane, Michael Ng

Probability

A note on correlation inequalities for regular increasing families

This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear threshold function yielding a covariance lower bound of $c \frac{\log n}{\sqrt{n}}$, and extend this principle to halfspaces in Gaussian space. These results verify the conjectures of Kalai, Keller, and Mossel regarding optimal correlation bounds for linear threshold functions and their Gaussian analogues.
Read the full abstract

Optimization and Control

Utility-Invariant Support Selection and Eventwise Decoupling for Simultaneous Independent Multi-Outcome Bets

For simultaneous independent events with finitely many outcomes, consider the expected-utility problem with nonnegative wagers and an endogenous cash position. We prove a short support theorem for a broad class of strictly increasing strictly concave utilities. On any fixed support family and at any optimal portfolio with positive cash, summing the active first-order conditions and comparing that sum with cash stationarity yields the exact identity \[ \frac{\lambda}{K_{\ell}^{(U)}}=\frac{1-P_{\ell,A}}{1-Q_{\ell,A}}, \] where $P_{\ell,A}$ and $Q_{\ell,A}$ are the active probability and price masses of event $\ell$, $\lambda$ is the budget multiplier, and $K_{\ell}^{(U)}$ is the continuation factor seen by inactive outcomes of that event. Consequently, after sorting each event by the edge ratio $p_{\ell i}/\pi_{\ell i}$, the exact active support is the eventwise union of the single-event supports, and this support is independent of the utility function. The single-event utility-invariant support theorem is already explicit in the free-exposure pari-mutuel setting in Smoczynski and Miles; the point of the present note is that the simultaneous independent-events analogue follows from the same state-price geometry once the right continuation factor is identified.
Read the full abstract

Information Theory

Rydberg Atomic Quantum Receivers for Wireless Communications: Two-Color vs. Three-Color Excitation

An efficient three-color (3C) laser excitation-based Rydberg atomic quantum receiver (RAQR) architecture is investigated for wireless communications, utilizing a five-level (5L) electronic transition mechanism. Specifically, the conventional two-color (2C) RAQR with the four-level (4L) excitation faces three fundamental obstacles: 1) high cost and engineering challenges due to the reliance on unstable short-wavelength lasers; 2) a fundamental sensitivity limit in thermal atoms caused by residual Doppler broadening; and 3) the inability to detect low-frequency bands due to the energy-level constraint of two-photon resonance. To address these challenges, this paper analyzes a 3C5L-RAQR architecture with all-red/infrared lasers, which not only solves the engineering cost issues but also enables effective Doppler cancellation and low-frequency detection by exploiting the three-photon resonance. Bridging atomic physics and communication theory, an end-to-end equivalent baseband signal model is derived. Furthermore, the performance of different RAQR architectures is evaluated in terms of sensitivity, achievable rate and spectrum access range. Moreover, we provide an exact numerical solution for practical RAQRs by employing the Liouvillian superoperator formalism. Numerical results demonstrate that the exhibited 3C5L-RAQR achieves superior sensitivity compared to the conventional 2C4L-RAQR and a classical antenna-based radio frequency receiver for weak-signal detection. Finally, the inherent sensitivity-rate trade-off is revealed, showing that the 3C5L-RAQR is more suitable for deployment in power-limited communication scenarios demanding broad spectrum access.
Read the full abstract

All authors Jian Xiao, Tierui Gong, Ji Wang, Erry Gunawan, Chau Yuen

Numerical Analysis

Elliptic PDEs on log-Gaussian Shapes: Sparsity and Finite Element Discretization

In this article, we consider the solution to elliptic diffusion problems on a class of random domains obtained by log-Gaussian random homothety of the unit disk respectively an annulus. We model the problem under consideration and verify the existence and uniqueness of the random solution by path-wise pullback to the nominal unit disk respectively annulus. We prove the analytic regularity of the solution with respect to the random input parameter. We consider the numerical approximation of the random diffusion problem by means of continuous, piecewise linear Lagrangian Galerkin Finite Elements with numerical quadrature in the nominal domain, and by sparse grid interpolation and quadrature of Gauss-Hermite Smolyak and Quasi-Monte Carlo type in the parameter domain. The theoretical findings are complemented by numerical results.
Read the full abstract

All authors Dinh Dũng, Helmut Harbrecht, Van Kien Nguyen, Christoph Schwab

Operator Algebras

On bounded module functionals and operators on Hilbert C*-modules without biorthogonally complemented kernels

We investigate the structural reasons behind the existence and non-existence of bounded module functionals and bounded module operators on Hilbert C*-modules whose kernels are not orthogonally complemented. The key motivating example was introduced by J. Kaad and M. Skeide in their 2023 paper. Building on their ideas and related developments, we obtain a structural characterization of this class of examples in a more abstract theoretical framework. We also study non-adjointable bounded module operators associated with such module functionals, together with the properties of the corresponding operator algebras and operator spaces. Our results provide a deeper understanding of phenomena beyond the adjointable setting, place several existing partial results into a unified framework, and show how large families of further examples can be constructed systematically.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.str-el

Mixed-State Topological Phase: Quantized Topological Order Parameter and Lieb-Schultz-Mattis Theorem

We investigate the extension of pure-state symmetry protected topological phases to mixed-state regime with a strong U(1) and a weak $\mathbb{Z}_2$ symmetries in one-dimensional spin systems by the concept of quantum channels. We propose a corresponding topological phase order parameter for short-range entangled mixed states by showing that it is quantized and its distinct values can be realized by concrete spin systems with disorders, sharply signaling phase transitions among them. We also give a model-independent way to generate two distinct phases by various types of translation and reflection transformations. These results on the short-range entangled mixed states further enable us to generalize the conventional Lieb-Schultz-Mattis theorem to mixed states, even without the concept of spectral gaps and lattice Hamiltonians.
Read the full abstract

Mathematical Physics

Determinant Formulas for Scattering Matrices of Schrödinger Operators with Finitely Many Concentric $\delta$-Shells

We study stationary scattering for Schrödinger operators in $\mathbb R^3$ with finitely many concentric $\delta$–shell interactions of constant real strengths. Starting from the self–adjoint realization and the boundary resolvent formula for this model, we show that, after partial–wave reduction, the same finite-dimensional boundary matrices that arise in the resolvent formula also determine the channel scattering coefficients. More precisely, for each angular momentum $\ell$, the channel coefficient $S_\ell(k)$ satisfies $S_\ell(k)=\det K_\ell(k^2-i0)/\det K_\ell(k^2+i0)$ for almost every $k>0$, where $K_\ell(z)=I_N+m_\ell(z)\Theta$ is the $\ell$–th reduced boundary matrix. Thus, in each channel, the positive–energy scattering problem is reduced to a finite-dimensional matrix problem, and the scattering phase is recovered from $\det K_\ell(k^2+i0)$. We then study the first nontrivial case of two concentric shells in the $s$–wave channel, where the interaction between the shells produces nontrivial threshold effects. We derive an explicit formula for $S_0(k)$ and analyze its behavior as $k\downarrow0$. In the regular threshold regime, we obtain an explicit scattering length. We further identify a threshold–critical configuration characterized by the existence of a nontrivial zero–energy radial solution, regular at the origin, whose exterior constant term vanishes. In the corresponding nondegenerate exceptional case, the usual finite scattering length breaks down, and instead $S_0(k)\to -1$ as $k\downarrow0$.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

A conjecture on a tight norm inequality in the finite-dimensional l_p

We suggest a tight inequality for norms in $d$-dimensional space $l_p $ which has simple formulation but appears hard to prove. We give a proof for $d=3$ and provide a detailed numerical check for $d\leq 200$ confirming the conjecture. We conclude with a brief survey of solutions for kin problems which anyhow concern minimization of the output entropy of certain quantum channel and rely upon the symmetry properties of the problem. Key words and phrases: $l_p $-norm, Rényi entropy, tight inequality, maximization of a convex function.
Read the full abstract