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)

Thursday 26 March

Functional Analysis

Real spectral shift functions for pairs of contractions and pairs of dissipative operators

Recently the authors solved a long-standing problem and showed that for an arbitrary pair of contractions on Hilbert space with trace class difference has an integrable spectral shift function on the unit circle ${\Bbb T}$ and an analogue of the Lifshits–Krein trace formula holds. It is also known that it may happen that there is no real-values integrable spectral shift function. In this paper we find conditions under which a pair of contractions with trace class difference has a real-valued integrable spectral shift function. We also consider a similar problem for pairs of dissipative operators. Finally, we find an application of the results in question to dissipative Schrödinger operators.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Rate-Splitting Multiple Access with a SIC-Free Receiver: An Experimental Study

Most Rate-Splitting Multiple Access (RSMA) implementations rely on successive interference cancellation (SIC) at the receiver, whose performance is inherently limited by error propagation during common-stream decoding. This paper addresses this issue by developing a SIC-free RSMA receiver based on joint demapping (JD), which directly evaluates bit vectors over a composite constellation. Using a two-user Multiple-Input Single-Output (MISO) prototype, we conduct over-the-air measurements to systematically compare SIC and JD-based receivers. The results show that the proposed SIC-free receiver provides stronger reliability and better practicality over a wider operating range, with all observations being consistent with theoretical expectations.
Read the full abstract

Numerical Analysis

Highly Efficient Rank-Adaptive Sweep-based SI-DSA for the Radiative Transfer Equation via Mild Space Augmentation

Low-rank methods have emerged as a promising strategy for reducing the memory footprint and computational cost of discrete-ordinates discretizations of the radiative transfer equation (RTE). However, most existing rank-adaptive approaches rely on rank-proportional space augmentation, which can negate efficiency gains when the effective solution rank becomes moderately large. To overcome this limitation, we develop a rank-adaptive sweep-based source iteration with diffusion synthetic acceleration (SI-DSA) for the first-order steady-state RTE. The core of our method is a sweep-based low-rank SI with an inner-loop iteration that performs efficient rank adaptation via mild space augmentation. In each inner iteration, the spatial basis is augmented with a small, rank-independent number of basis vectors without truncation, while a single truncation is performed only after the inner loop converges. Efficient rank adaptation is achieved through residual-based greedy angular subsampling strategy together with incremental updates of projection operators, enabling non-intrusive reuse of existing transport-sweep implementations. In the outer iteration, a DSA preconditioner is applied to accelerate convergence. Numerical experiments show that the proposed solver achieves accuracy and iteration counts comparable to those of full-rank SI-DSA while substantially reducing memory usage and runtime, even for challenging multiscale problems in which the effective rank reaches 30-45% of the full rank.
Read the full abstract

Analysis of PDEs

A spherical flatness index and a stability inequality for harmonic pseudospheres

We introduce a new flatness index for the boundary of an open subset $\Omega$ of $\mathbb{R}^n$, $n\ge 2$. This index provides a necessary condition for $\partial\Omega$ to be a harmonic pseudosphere and sufficient conditions for a harmonic pseudosphere to be a Euclidean sphere. These conditions will follow from a stability inequality formulated in terms of a harmonic invariant, the Kuran gap, recently introduced by the last two authors.
Read the full abstract

Numerical Analysis · Cross-listed from physics.flu-dyn

A High-Order Compact Finite Volume Method for Unstructured Grids: Scheme Space Formulation and One-Dimensional Implementations

This paper presents a novel and straightforward compact reconstruction procedure for the high-order finite volume method on unstructured grids. In this procedure, we constructed a linear approximation relationship between the mean values and the function values, as well as the derivative values. Compared with the classical compact schemes, which employ a Taylor expansion method to determine the coefficients, our approach adopts an equivalent and more generalized method to achieve this goal. Via this method, the problem of constructing a high-order compact scheme is transformed into solving the null space of undetermined homogeneous linear systems. This null space constitutes the complete set of schemes that meet the specified accuracy under a given stencil, and is termed the 'scheme space'. Schemes within the scheme space possess the same accuracy level yet exhibit distinct dispersion and dissipation characteristics. Through Fourier analysis, we can get the dissipation and dispersion properties of all schemes in the scheme space. This facilitates the control of scheme dispersion and dissipation without altering the stencil compactness. Combined with the WENO (Weighted Essentially Non-Oscillatory) concept, multi-stencil schemes are employed to construct the nonlinear weighted compact finite volume scheme (WCFV). The WCFV is capable of eliminating unphysical oscillations at discontinuities, thereby enabling the capture of strong discontinuities. One-dimensional schemes are discussed in detail, and numerical results demonstrate that the proposed method exhibits high-order accuracy, robustness, and shock-capturing capability.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Gap Safe Screening Rules for Fast Training of Robust Support Vector Machines under Feature Noise

Robust Support Vector Machines (R-SVMs) address feature noise by adopting a worst-case robust formulation that explicitly incorporates uncertainty sets into training. While this robustness improves reliability, it also leads to increased computational cost. In this work, we develop safe sample screening rules for R-SVMs that reduce the training complexity without affecting the optimal solution. To the best of our knowledge, this is the first study to apply safe screening techniques to worst-case robust models in supervised machine learning. Our approach safely identifies training samples whose uncertainty sets are guaranteed to lie entirely on either side of the margin hyperplane, thereby reducing the problem size and accelerating optimization. Owing to the nonstandard structure of R-SVMs, the proposed screening rules are derived from the Lagrangian duality rather than the Fenchel-Rockafellar duality commonly used in recent methods. Based on this analysis, we first establish an ideal screening rule, and then derive a practical rule by adapting GAP-based safe regions to the robust setting. Experiments demonstrate that the proposed method significantly reduces training time while preserving classification accuracy.
Read the full abstract

Information Theory

Variance Based Transmitter Localization in Vessel-Like Molecular Communication Channels

Transmitter localization in vessel-like molecular communication channels is a fundamental problem with potential applications in healthcare. Existing analytical solutions either assume knowledge of emission time or require multiple closely spaced receivers, which limits their applicability in realistic scenarios. In this letter, we propose a simple closed-form approximation that exploits the temporal variance of the received molecular signal to estimate the distance between the transmitter and the receiver without emission time information. The method is derived from a Gaussian approximation of the received signal near its peak and gives an explicit variance-distance relation. Simulation results in physically relevant capillary vessel scale show that the proposed method achieves distance prediction with error on the order of 1%.
Read the full abstract

Dynamical Systems

Lift-Free Approaches to Random Rotation Number and Numerical Approximation

We study the random rotation number for random circle homeomorphisms. We introduce two new definitions of the random rotation number that can be stated without reference to any choice of lift of the dynamics to the real line, and prove that they are equivalent to the standard random rotation number. We then prove that the mean random rotation number may be approximated within an error of $1/n$ when using $n$ iterations of the dynamics. Finally, we develop numerical algorithms for approximation of the random rotation number which we test with several examples.
Read the full abstract

Analysis of PDEs

Arefinement of the Bukhgeim-Klibanov method

In this article, we improve the classical Bukhgeim-Klibanov method presented in [1],which can be used to prove the conditional stability of inverse source problem for a hyperbolic equation from the measurement on the subboundary. A major ingredient of our proof is a novel Carleman estimate. This inequality eliminates the need to extend the solution in time, therefore simplifies the existing proofs, which is widely applicable to various evolution equations.
Read the full abstract

Combinatorics

Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)

In this paper, we study the $[k]$-Roman domination number of cylindrical graphs $C_m \Box P_n$. Our analysis begins with a general lower bound based on local neighborhood constraints. We show that $\gamma_{[kR]}(C_m\Box P_n) > \frac{(k+1)mn}{5}.$ By exploiting the connection between $[k]$-Roman domination and efficient domination, we characterize the cylindrical graphs for which the extremal local configuration \(f(N[x])=k+1\) for every \(x\in V(C_m\Box P_n)\) can occur. We show that this happens precisely for so called efficient graphs. For fixed small values $m\in\{5,\ldots,8\}$, we construct explicit periodic $[k]$-Roman dominating functions that yield sparse upper bounds. These constructions are complemented by a general uniform upper bound and by packing-refined bounds. A systematic comparison of the resulting bounds shows how their relative strength depends on the parameter $k$ and on the length of the path.
Read the full abstract

Optimization and Control

Learning Monge maps with constrained drifting models

We study the estimation of optimal transport (OT) maps between an arbitrary source probability measure and a log-concave target probability measure. Our contributions are twofold. First, we propose a new evolution equation in the set of transport maps. It can be seen as the gradient flow of a lift of some user-chosen divergence (e.g., the KL divergence, or relative entropy) to the space of transport maps, constrained to the convex set of optimal transport maps. We prove the existence of long-time solutions to this flow as well as its convergence toward the OT map as time goes to infinity, under standard convexity conditions on the divergence. Second, we study the practical implementation of this constrained gradient flow. We propose two time-discrete computational schemes-one explicit, one implicit-, and we prove the convergence of the latter to the OT map as time goes to infinity. We then parameterize the OT maps with convexity-constrained neural networks and train them with these discretizations of the constrained gradient flow. We show that this is equivalent to performing a natural gradient descent of the lift of the chosen divergence in the neural networks' parameter space, similarly to drifting generative models. Empirically, our scheme outperforms the standard Euclidean gradient descent methods used to train convexity-constrained neural networks in terms of approximation results for the OT map and convergence stability, and it still yields better results than the same approach combined with the widely used Adam optimizer.
Read the full abstract

Analysis of PDEs

Hypercontractivity type property for generalized Mehler semigroups

We investigate the hypercontractivity property of generalized Mehler semigroups on the $L^p$-scale with respect to invariant measures. This property is first obtained in the purely theoretical setting of skew operators and, subsequently, deduced for generalized Mehler semigroups arising from linear stochastic differential equations perturbed by Lévy noise. When the associated invariant measure $\mu$ lacks a purely Gaussian structure, jump components may prevent the validity of Nelson's classical $L^p$-$L^q$ estimates. However, a summability-improving property can be obtained in the setting of mixed-norm spaces $\mathcal{X}_{p,q}(E;\gamma,\pi)$ related to the factorization of the invariant measure $\mu = \gamma * \pi$ into a Gaussian part $\gamma$ and an infinitely divisible non-Gaussian part $\pi$. As in the classical Gaussian case, some modified logarithmic Sobolev inequalities with respect to invariant measures can be inferred.
Read the full abstract

Number Theory

Stern polynomials and algebraic independence

Let $t\geq2$ and $k\geq1$ be integers. Let $H_{k}(z)$ with $\left\vert z\right\vert <1$ be the limit of a certain subsequence of the Stern polynomials introduced by Dilcher and Eriksen. We use Mahler's method to prove the algebraic independence of the values at nonzero algebraic points of the functions $H_{k}(z)$ and $H_{k}(z^{t^{k}})$.
Read the full abstract

Functional Analysis

Traces of functions in Besov spaces in Gibbs environment

This paper investigates the traces of functions belonging to the inhomogeneous Besov spaces B $\xi$ p,q , where $\xi$ is a product of capacities defined as powers of Gibbs measures. We first establish that the traces of functions in B $\xi$ p,q along affine hyperplanes belong to another inhomogeneous Besov space. Furthermore, we derive an upper bound for the singularity spectrum of the traces of all functions in B $\xi$ $\infty$,q . This bound is then refined for a prevalent set of functions in B $\xi$ $\infty$,q , for which we explicitly compute the singularity spectrum of their traces. Notably, our analysis reveals that the regularity properties of these affine traces are highly sensitive to the choice of the hyperplane along which the trace is taken.
Read the full abstract

Analysis of PDEs

The Ptolemy-Alhazen problem with source at infinity

We study the well-known Ptolemy-Alhazen problem on reflection of light at the surface of a spherical mirror in the case when the source of light is very far from the mirror.

Functional Analysis · Cross-listed from quant-ph

Banach and counting measures, and dynamics of singular quantum states generated by averaging of operator random walks

In this paper the random channels and their compositions in the space of quantum states are studied. For compositions of i.i.d. random unitary channels, the limit behaviour of probability distributions is described. The sufficient condition for convergence in probability is obtained. The generalized convergence in distribution w.r.t. weak operator topology is obtained. The analysis of transmission of pure and normal states to the set of singular states is done. The dynamics of quantum states is described in terms of the evolution of the values of quadratic forms of operators from the algebra that implements the representation of canonical commutation relations.
Read the full abstract

Classical Analysis and ODEs

Bifurcation of limit cycles in a class of piecewise smooth generalized Abel equations with two asymmetric zones

This paper studies the number of limit cycles, known as the Smale-Pugh problem, for the generalized Abel equation \begin{align*} \frac{dx}{d\theta}=A(\theta)x^p+B(\theta)x^q, \end{align*} where $A$ and $B$ are are piecewise trigonometrical polynomials of degree $ m $ with two zones $0\leq\theta<\theta_1$ and $\theta_1\leq\theta\leq2\pi$. By means of the first and second order analysis using the Melnikov theory and applying the new Chebyshev criterion that established by \cite{HLZ2023}, we estimate the maximum number of positive and negative limit cycles that such equations can have, and reveal how this maximum number, denoted by $H_{\theta_1}(m)$, is affected by the location of the separation line $\theta=\theta_1$. For the equation of classical Abel type, our result not only includes the estimates provided in the recent paper (Huang et al., SIAM J. Appl. Dyn. Syst., 2020), i.e., $H_{2\pi}(m)\geq 4m-2$ for $\theta_1=2\pi$, but also shows that the equation in the discontinuous case can possess more than two times as many limit cycles as in the continuous case. More accurately, $H_{\pi}(m)\geq 8m+2$ and $H_{\theta_1}(m)\geq 14m-6$ for $\theta_1\in (0,\pi)\cup (\pi,2\pi)$.
Read the full abstract

Functional Analysis

Real-variable theory of matrix-weighted multi-parameter Besov–Triebel–Lizorkin-type spaces

We develop a comprehensive theory for a general class of multi-parameter function spaces of Besov-Triebel-Lizorkin type, with a matrix weight. We prove the equivalence of different quasi-norms, the identification of function and sequence spaces via the $\varphi$-transform, the boundedness of almost diagonal operators and multi-parameter singular integrals under minimal assumptions, molecular and wavelet characterisations, and Sobolev-type embedding theorems. We identify matrix-weighted $L^p$ spaces, Sobolev spaces, and multi-parameter BMO spaces as examples of our general scale of spaces. Thus, our result on the boundedness of multi-parameter singular integrals on these spaces is seen as an extension, with a different method, of a recent theorem of Domelevo et al. [J. Math. Anal. Appl. 2024] on matrix-weighted $L^p$ spaces. For this theory, we develop several tools of independent interest. Many previous results were restricted to integrability exponents $p\in(1,\infty)$, while Besov-Triebel-Lizorkin spaces naturally involve the full range $p\in(0,\infty)$. We extend the definition of multi-parameter $A_p$ matrix weights to $p\in(0,1]$ and establish their basic properties, culminating in the $L^p$-boundedness of a matrix-weighted strong maximal operator (suitably rescaled when $p\in(0,1]$) for all $p\in(0,\infty)$. For $p\in(1,\infty)$, this is due to Vuorinen [Adv. Math. 2024] by convex-set-valued techniques of Bownik and Cruz-Uribe [arXiv 2022; Math. Ann. (to appear)]; the lack of convexity requires us to develop a new approach that works for all $p\in(0,\infty)$. We also need and prove a multi-parameter extension of Carleson-type embeddings from Frazier and Roudenko [Math. Ann. 2021] but attributed by them to F. Nazarov. We prove the necessity of the conditions of the new embedding using a nontrivial elaboration of Carleson's classical counterexample [Mittag-Leffler Rep. 1974].
Read the full abstract

All authors Fan Bu, Yiqun Chen, Tuomas Hytönen, Dachun Yang, Wen Yuan

Rings and Algebras

Leavitt path algebras having Graded Invariant Basis Number

In this paper, we study the Graded Invariant Basis Number (grIBN) property for Leavitt path algebras of finite graphs. Using the talented monoid as our main tool, we establish a complete matrix-theoretic characterization of when a Leavitt path algebra of a finite graph fails to have gr-IBN. Consequently, we identify several classes of graphs whose Leavitt path algebras have gr-IBN, including graphs with sinks, Cayley graphs, and Hopf graphs associated with finite groups. We also investigate the preservation of gr-IBN under quotients by hereditary saturated subsets and under Cartesian products of graphs.
Read the full abstract

Dynamical Systems

Incorporating Continuous Dependence Qualifies Physics-Informed Neural Networks for Operator Learning

Physics-informed neural networks (PINNs) have been proven as a promising way for solving various partial differential equations, especially high-dimensional ones and those with irregular boundaries. However, their capabilities in real applications are highly restricted by their poor generalization performance. Inspired by the rigorous mathematical statements on the well-posedness of PDEs, we develop a novel extension of PINNs by incorporating the additional information on the continuous dependence of PDE solutions with respect to parameters and initial/boundary values (abbreviated as cd-PINN). Extensive numerical experiments demonstrate that, with limited labeled data, cd-PINN achieves 1-3 orders of magnitude lower in test MSE than DeepONet and FNO. Therefore, incorporating the continuous dependence of PDE solutions provides a simple way for qualifying PINNs for operator learning.
Read the full abstract

Category Theory

New examples of non-unique enhancements for triangulated categories

We present a general procedure for constructing triangulated categories, linear over a field, with distinct enhancements. Some of our examples can be equipped with a (non-degenerate) t-structure, thereby showing that the existence of a t-structure does not imply uniqueness of enhancements, whether in the strong or weak sense (depending on the example).
Read the full abstract

Analysis of PDEs

Global Strict Monotonicity and Asymptotics of the First Steklov Eigenvalue for Regular Polygons

For a bounded Lipschitz planar domain $\Omega$, let $\sigma_1(\Omega)$ denote its first nonzero Steklov eigenvalue. Let $\Omega_N$ be the regular $N$-gon normalized to have perimeter $2\pi$. We prove that \[ \sigma_1(\Omega_{N+1})>\sigma_1(\Omega_N),\qquad N\ge3. \] Consequently, $\sigma_1(\Omega_N)$ increases strictly to the disk value $1$. We also show that the real first eigenspace has dimension two and derive the asymptotic expansion \[ \sigma_1(\Omega_N) =1-\frac{2\zeta(3)}{N^3} -\frac{8\zeta(4)}{N^4} -\frac{26\zeta(5)}{N^5} +O(N^{-6}). \] The proof combines an equivariant Schwarz–Christoffel pullback, a nodal selection of the two critical Fourier residue classes, and a positivity-improving Perron comparison for the associated reciprocal operators. The asymptotic expansion follows independently from a Schur reduction and the evaluation of Euler-type sums.
Read the full abstract

All authors Zhuo Cheng, Changfeng Gui, Yeyao Hu, Qinfeng Li, Ruofei Yao

Optimization and Control

Task-Dependent Weighted Average Energy Controllability Score for Network Intervention

Controllability scores provide principled information on where intervention should be applied in large-scale network systems when explicit control design is difficult. Two representative controllability scores are the volumetric controllability score (VCS) and the average energy controllability score (AECS). While both are important, the standard AECS treats all state-transition directions uniformly. In this paper, we propose the weighted average energy controllability score (W-AECS), a task-dependent extension of AECS that incorporates a prescribed transition of interest through a weighting matrix. We show that the proposed formulation admits a control-theoretic interpretation via expected minimum-energy steering, and establish strict convexity and generic uniqueness. These results support the interpretation of W-AECS as a well-defined node-wise task-dependent intervention score. We also illustrate the proposed method on a structural brain-network dataset, where transition-dependent weighting reshapes the scoring pattern, yielding a VCS-like preference among the highest-ranked regions while preserving an overall structure distinct from both standard AECS and VCS.
Read the full abstract

Combinatorics

Impact of local girth on the S-packing coloring of k-saturated subcubic graphs

For a non-decreasing sequence $S=(s_1,s_2,\dots,s_k)$, an $S$-packing coloring of a graph $G$ is a vertex coloring using the colors $s_1,s_2,\dots,s_k$ such that any two vertices assigned the same color $s_i$ are at distance greater than $s_i$. A subcubic graph is said to be $k$-saturated, for $0\le k\le3$, if every vertex of degree 3 is adjacent to at most $k$ vertices of degree~3. The local girth of a vertex is the length of the smallest cycle containing it. Brešar, Kuenzel, and Rall [Discrete Math. 348(8) (2025),~114477] proved that every claw-free cubic graph is $(1,1,2,2)$-packing colorable, confirming the conjecture for this family. Equivalently, a claw-free cubic graph is one in which each $3$-vertex has local girth~3. Motivated by this observation and by recent progress on $S$-packing colorings of $k$-saturated subcubic graphs, we study the influence of local girth on their $S$-packing colorability. We establish a series of results describing how the parameters of saturation and local girth jointly determine the admissible $S$-packing sequences. Sharpness is verified through explicit constructions, and several open problems are posed to delineate the remaining cases.
Read the full abstract

Group Theory

On a generalization of Shmel'kin's theorem

It is known that every nilpotent group contains solution of every finite unimodular system of equatiuons over itself. This statement, however, is not true for infinite systems. Moreover, there are abelian groups which disprove the infinite system analogue of the statement. It has already been researched which periodic abelian groups contain solutions of all infinite unimodular systems of equations over themselves. The present article covers the same question for periodic nilpotent groups and for torsion-free nilpotent groups.
Read the full abstract

Analysis of PDEs

Self-similar finite-time blowups with singular profiles of the generalized Constantin-Lax-Majda model: theoretical and numerical investigations

For the generalized Constantin-Lax-Majda model with a parameter $a$, we investigate novel scenarios of self-similar finite-time blowups that arise from a new setting where the smooth initial data satisfy a certain derivative degeneracy condition. In this setting, our numerical study reveals distinct self-similar blowup behaviors depending on the sign of $a$. For $a>0$, we observe one-scale self-similar blowups with regular profiles that have not been found in previous studies. In contrast, for $a\le 0$, we discover a novel two-scale self-similar blowup scenario where the outer profile converges to a singular function at the blowup time while the inner profile remains regular on a much smaller scale. Correspondingly, an $a$-parameterized family of singular self-similar profiles with explicit expressions are constructed for $a<0$ and shown to match nicely with the limiting profiles obtained in numerical simulation. In particular, for the specific case of $a=0$, we rigorously prove the convergence of the outer profile to an explicit singular function in self-similar coordinates. Furthermore, we demonstrate the two-scale nature of the blowup in this scenario by showing that the local inner profile behavior around the singularity point of the outer profile is governed by a traveling wave on a smaller scale. To support this observation, we rigorously establish the existence of such traveling wave solutions via a fixed-point method.
Read the full abstract

2603.25104 · 26 Mar · 59 pages, 20 figures; (1) Made Theorem 2.7 more complete and elaborate with more detailed properties of the traveling wave profiles; (2) Added a formal proof of Theorem 2.7 at the end of Section 7; (3) Improved writing and presentation throughout Section 7; (4) Corrected a non-essential typo in Lemma 7.5; (5) Added a figure of multiple numerically computed traveling wave profiles in Appendix C

Group Theory

Robust quasi-isometric embeddings of virtually free groups

Let $k$ be a nonarchimedean local field. For any $n\geq 3$, we construct the first examples of robust quasi-isometric embeddings of non-elementary free groups into $\mathsf{GL}_n(k)$ which are not limits of Anosov representations. If $\bf{K}=\mathbb{R},\mathbb{C}$, we exhibit examples of non-locally rigid, robust quasi-isometric embeddings of virtually free groups into $\mathsf{GL}_n(\bf{K})$, $n\geq 3$, which are not limits of Anosov representations. Moreover, we exhibit a non-Anosov robust quasi-isometric embedding of the free semigroup $\mathbb{Z}\ast \mathbb{Z}^{+}$ into $\mathsf{GL}_3(\mathbb{C})$, which is a limit of Anosov representations.
Read the full abstract