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)

Monday 16 March

Analysis of PDEs · Cross-listed from physics.flu-dyn

Numerical study of the sharp stratification limit towards bilayer models

In the study of oceanic flows at the geophysical scale, the phenomenon of density stratification plays a central role in the dynamics of the system. Two categories of mathematical models are commonly used to describe the role played by the density stratification: on the one hand, continuously stratified models - such as the stratified Euler equations in a strip, considered in the present article - offer an accurate description of vertical effects, but come with a high level of complexity, both at the theoretical and numerical levels. On the other hand, bilayer models approximate the stratification by a piecewise constant profile. In the latter case, the main point is to study the evolution of the free interface between both layers, which leads to a substantially simplified model. In the present article, we compare both approaches in the framework of the linearized stratified Euler equations around density profiles that are close to piecewise constant profiles, and prove the convergence towards the bilayer Euler equations. However, in the presence of a shear flow, bilayer models have a range of validity limited by the presence of Kelvin-Helmholtz instabilities. In this case, we use a suitable normal modes decomposition to compute numerically the dispersion relation of this linearized model, and provide numerical evidence that the Kelvin-Helmholtz instabilities limit the applicability of two widely used bilayer models, namely the bilayer Euler equations and the bilayer shallow-water equations.
Read the full abstract

Numerical Analysis

Multilevel Sparse Tensor Approximation for High-Dimensional Parametric PDEs

In this paper the efficiency of multilevel sparse tensor approximation methods for high-dimensional affine parametric diffusion equations is investigated. Methodologically, the recently presented Sparse Alternating Least Squares (SALS) algorithm is employed to construct adaptive tensor train (TT) approximations of quantities of interest (QoI). By combining this tensor-based approach with a multilevel Galerkin discretization strategy, the solution's regularity can be exploited to significantly reduce computational costs by level-adapted sample sizes. A rigorous theoretical analysis is derived, demonstrating that the work overhead for the proposed multilevel method remains independent of the discretization level, which stands in stark contrast to the exponential growth observed in single-level approaches. The presented analysis is quite general and not constrained to the sparse TT format but uses a generic framework that can be extended to other model classes. Numerical experiments validate the predicted efficiency gains in high-dimensional settings.
Read the full abstract

Analysis of PDEs

Large time behavior of the fractional heat equation associated with the Dunkl Laplacian

We consider the fractional heat equation associated with the Dunkl Laplacian and prove that the weak solutions to this equation converge to the fundamental solution as time becomes large, provided the initial data is an integrable function with respect to the associated measure. As an application, we also prove a similar result for the corresponding nonlinear equation.
Read the full abstract

Metric Geometry

Coarse medians and universal quasigeodesic cones

We show that any universal quasigeodesic cone of uniformly coarse median spaces admits a canonical coarse median structure. As an application, we recover a result of Bowditch which states that any hierarchically hyperbolic space admits a coarse median structure compatible with the projections to the hyperbolic factor spaces.
Read the full abstract

Spectral Theory

Weyl asymptotics for singular metrics with a variable boundary degeneracy exponent

We consider a compact smooth manifold $X$ of dimension $n+1$ with boundary $M=\partial X$. In a collar neighborhood of $M$, we assume that the metric has the form $g=u^{-\alpha}\bar g$, where $u$ is a boundary defining function, $\alpha\in C^1(M;[0,2))$ and $\bar g$ is a $C^1$ Riemannian metric up to $M$. Since $\alpha<2$, the boundary lies at finite $g$-distance and $(X,g)$ is a singular metric space. We study the Weyl asymptotics of the Friedrichs Laplacian $\triangle\_g$ when the degeneracy exponent $\alpha$ varies along $M$. If the maximum $\alpha\_{\mathrm{max}}$ of $\alpha$ on $M$ is strictly larger than the critical value $\alpha\_c=\frac{2}{n+1}$, then we prove that the points where $\alpha$ is close to $\alpha\_{\mathrm{max}}$ govern the leading term in the Weyl asymptotics. If $\alpha\_{\mathrm{max}}\leq\alpha\_c$, then the leading term is governed by the truncated volume $\vol\_g(\{\dist(\cdot,M)>\lambda^{-1/2}\})$. When the maximum set of $\alpha$ is Morse-Bott, we compute the associated constants and the logarithmic corrections. To the best of our knowledge, this is the first Weyl law in this setting with a boundary-dependent degeneracy exponent. The results highlight a sharp transition at $\alpha\_c$ between a boundary-dominated non-classical regime and a truncated-volume regime.
Read the full abstract

Information Theory

Space Upper Bounds for $\alpha$-Perfect Hashing

In the problem of minimal perfect hashing, we are given a size $k$ subset $\mathcal{A}$ of a universe of keys $[n] = \{1,2, \cdots, n\}$, for which we wish to construct a hash function $h: [n] \to [k]$ such that $h(\cdot)$ maps $\mathcal{A}$ to $[k]$ with no collisions, i.e., the restriction of $h(\cdot)$ to $\mathcal{A}$ is injective. In this paper, we extend the study of minimal perfect hashing to the approximate setting. For an $\alpha \in [0, 1]$, we say that a randomized hashing scheme is $\alpha$-perfect if for any input $\mathcal{A}$ of size $k$, it outputs a hash function which exhibits at most $(1-\alpha)k$ collisions on $\mathcal{A}$ in expectation. One important performance consideration for any hashing scheme is the space required to store the hash functions. For minimal perfect hashing, it is well known that approximately $k\log(e)$ bits, or $\log(e)$ bits per key, is required to store the hash function. In this paper, we propose schemes for constructing minimal $\alpha$-perfect hash functions and analyze their space requirements. We begin by presenting a simple base-line scheme which randomizes between perfect hashing and zero-bit random hashing. We then present a more sophisticated hashing scheme based on sampling which significantly improves upon the space requirement of the aforementioned strategy for all values of $\alpha$.
Read the full abstract

Information Theory

On the Nonasymptotic Bounds of Joint Source-Channel Coding with Hierarchical Sources

This paper establishes tractable bounds of joint source-channel coding with hierarchical sources in the finite blocklength regime. In this setting, both the indirect source and observable source must be reconstructed under correlated distortion constraints, leading to a joint excess-distortion event. First, to build computable tight bounds, we introduce a novel $\mathsf{d}(\cdot)$-functional distortion relaxation, which enables tractable and tight bounding of the joint excess-distortion probability induced by correlated sources. By this approach, the nonasymptotic converse and achievability bounds are given. Second, Gaussian approximations for the proposed bounds are obtained, which are optimal for the transmission of a Gaussian memoryless source over an additive white Gaussian noise channel with mean-square error distortion. The optimal scheme is obtained via a structured analysis that captures the intrinsic tradeoff between semantic and observable reconstructions. Furthermore, for the transmission of Gaussian memoryless sources over AWGN channels, we obtain explicit and computable bounds, by providing a new geometric structure involving three correlated spherical regions. This results extend the classical two-spherical region analysis for a single distortion constraint. Numerical simulations demonstrate that the proposed achievability and converse bounds tightly sandwich the Gaussian approximation and align closely with Monte Carlo numerical results.
Read the full abstract

All authors Shuo Shao, Chao Qi, Jincheng Dai, Wenrui Dai, Hongkai Xiong

Mathematical Physics

On uniform large genus asymptotics of Witten's intersection numbers

Following ideas from [14], we give a uniform large genus asymptotics for primitive psi-class intersection numbers on the moduli space of stable algebraic curves, and extend this result including insertions of zeros in a certain uniform way. Application to a particular formal solution of the Painlevé I equation is given. We also use a method from [14] to give a new proof of the polynomiality conjecture on large genus asymptotic expansions of psi-class intersection numbers.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Decomposing Probabilistic Scores: Reliability, Information Loss and Uncertainty

Calibration is a conditional property that depends on the information retained by a predictor. We develop decomposition identities for arbitrary proper losses that make this dependence explicit. At any information level $\mathcal A$, the expected loss of an $\mathcal A$-measurable predictor splits into a proper-regret (reliability) term and a conditional entropy (residual uncertainty) term. For nested levels $\mathcal A\subseteq\mathcal B$, a chain decomposition quantifies the information gain from $\mathcal A$ to $\mathcal B$. Applied to classification with features $\boldsymbol{X}$ and score $S=s(\boldsymbol{X})$, this yields a three-term identity: miscalibration, a grouping term measuring information loss from $\boldsymbol{X}$ to $S$, and irreducible uncertainty at the feature level. We leverage the framework to analyze post-hoc recalibration, aggregation of calibrated models, and stagewise/boosting constructions, with explicit forms for Brier and log-loss.
Read the full abstract

Commutative Algebra

Squarefree powers of closed neighborhood ideals

In this article, we characterize all trees whose highest non-vanishing squarefree power of the closed neighborhood ideal is componentwise linear. In addition, we investigate the Castelnuovo-Mumford regularity of the $\nu$-th squarefree power of the closed neighborhood ideal of trees and show that this number can be arbitrarily larger than the degree of the ideal. Finally, we give a formula for the regularity of $\nu$-th squarefree power of the closed neighborhood ideal of caterpillar graphs.
Read the full abstract

Optimization and Control

A Parameter-Free Zeroth-Order Algorithm for Decentralized Stochastic Convex Optimization

We consider decentralized stochastic convex optimization on connected network, in which gradients of agents are unavailable and each agent can query only noisy function values of its own local objective. The goal is to minimize the average objective over a compact convex domain using only local two point zeroth-order oracles and peer-to-peer communication. We propose a decentralized POEM method (D-POEM) that combines symmetric two point smoothing with adaptive radius and stepsize rules, thereby avoiding prior knowledge of the Lipschitz constant and diameter. For convex Lipschitz continuous objectives, we prove an convergence rate that separates a centralized optimization term from a network disagreement term. We further conduct the numerical experiments to demonstrate POEM outperforms existing distributed zeroth-order method.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.PE

A multiscale discrete-to-continuum framework for structured population models

Mathematical models of biological populations commonly use discrete structure classes to capture trait variation among individuals (e.g. age, size, phenotype, intracellular state). Upscaling these discrete models into continuum descriptions can improve analytical tractability and scalability of numerical solutions. Common upscaling approaches based solely on Taylor expansions may, however, introduce ambiguities in truncation order, uniform validity and boundary conditions. To address this, here we introduce a discrete multiscale framework to systematically derive continuum approximations of structured population models. Using the method of multiple scales and matched asymptotic expansions applied to discrete systems, we identify regions of structure space for which a continuum representation is appropriate and derive the corresponding partial differential equations. The leading-order dynamics are given by a nonlinear advection equation in the bulk domain and advection-diffusion processes in small inner layers about the leading wavefronts and stagnation point. We further derive discrete boundary layer descriptions for regions where a continuum representation is fundamentally inappropriate. Finally, we demonstrate the method on a simple lipid-structured model for early atherosclerosis and verify consistency between the discrete and continuum descriptions. The multiscale framework we present can be applied to other heterogeneous systems with discrete structure in order to obtain appropriate upscaled dynamics with asymptotically consistent boundary conditions.
Read the full abstract

All authors Eleonora Agostinelli, Keith L. Chambers, Helen M. Byrne, Mohit P. Dalwadi

Analysis of PDEs

The one-dimensional compressible Navier-Stokes equations in critical regularity spaces

We are concerned with the barotropic compressible Navier-Stokes equations on the real line. Our primary goal is to establish the global well-posedness in a critical regularity framework in the case where the initial data are small perturbations of a stable constant state. Surprisingly, even though the result in the multi-dimensional case is by now classical, the one-dimensional case has not been elucidated yet as far as we know. This is due to the fact that in the critical framework, the regularity of the velocity is so negative that some nonlinear terms are out of control. Here, we overcome the difficulty by considering the equations in the mass Lagrangian coordinates system. Granted with a global well-posedness statement, we then establish optimal time decay estimates and investigate the high viscosity limit, pointing out the convergence of the specific volume to the solution of some ordinary differential equation, after time and space rescaling.
Read the full abstract

Numerical Analysis

Adjoint-Based Gradient Evaluation for Metasurface Inverse Design via Affine Geometric Transformations

The sharp increasing in fabrication capabilities of nanomaterials, and complex structures such as meta-surfaces and metalens, has opened to the possibility of employing them for accurately control the electromagnetic field, beyond the possibility ensured by traditional devices. The demand for large scale structures and more complex functionalities from meta-surfaces lead to the research for advanced techniques of inverse design, able to conjugate the ability to produce effective designs and limited computational cost. Among the various approaches for inverse design of large meta-surfaces, the ones based on the adjoint variable method are appealing since able to ensure a minimal computational cost for the gradient computation of the cost function. In this work, a systematic methodology for the application of the adjoint variable method for large meta-surface design is presented. The method is based on: (i) a parametrization of the relevant geometric parameters of the meta-atoms, (ii) the fast computation of the gradient with respect such parameters, allowing for the implementation of general affine transformations during the optimization process. The main findings are first theoretically justified and a numerical validation is provided to show the effectiveness of the proposed approach.
Read the full abstract

All authors Vincenzo Mottola, Luisa Faella, Carlo Forestiere, Antonello Tamburrino

Analysis of PDEs

High viscosity limit for the multi-dimensional compressible Navier-Stokes equations

We investigate the high viscosity limit (also called inertial limit) of the barotropic compressible Navier-Stokes equations supplemented with initial data which are perturbations of a stable constant solution. In the case of constant viscosity coefficients, we establish that, after diffusive rescaling, the density tends to satisfy a transport equation with nonlinear damping which is globally well-posed, even for large data. Similar results are proved for variable viscosity coefficients. In this latter case, the damping term in the limit equation of the density is nonlocal.
Read the full abstract

Combinatorics

The strong chromatic index of $K_{t,t}$-free graphs

A strong edge coloring of a graph $G$ is an edge coloring $\phi\,:\,E(G) \rightarrow \mathbb N$ such that each color class forms an induced matching in $G$. The strong chromatic index of $G$, written $\chi'_s(G)$, is the minimum number of colors needed for a strong edge coloring of $G$. Erdős and Nešetřil conjectured in 1985 that if $G$ has maximum degree $d$, then $\chi'_s(G) \leq \frac 54 d^2$. Mahdian showed in 2000 that if $G$ is $C_4$-free, then $\chi'_s(G) \leq (2+o(1)) \frac{d^2}{\log d}$, and he conjectured that the same upper bound holds for $K_{t,t}$-free graphs. In this paper, we prove this conjecture and improve upon it to show the following: every $K_{t,t}$-free graph $G$ of maximum degree $d$ satisfies $\chi'_s(G) \leq (1+o(1)) \frac{d^2}{\log d}$. We employ a variant of the Rödl nibble method to prove this result. The key new ingredient in our adaptation of the method is an application of the Kővári-Sós-Turán theorem to show that $H := L(G)^2$ satisfies certain structural properties. These properties, in conjunction with a variant of Talagrand's inequality to handle exceptional outcomes, allow us to concentrate the sizes of certain vertex sets through the nibble, even when these vertex sets have order smaller than the maximum codegree of $H$. We encapsulate these structural properties into a more general statement on list coloring that we believe to be of independent interest. In light of the conjectured computational threshold for coloring random graphs arising in average-case complexity theory, we suspect that our result is best possible using this approach.
Read the full abstract

All authors Richard Bi, Peter Bradshaw, Abhishek Dhawan, Jingwei Xu

Analysis of PDEs

Lipschitz solutions to mean field games with a major player and applications

This paper introduces a notion of weak solution for the coupled system of master equations in mean field games with a major player. It extends the previously introduced notion of Lipschitz solutions in mean field games. By relying on a probabilistic representation of the system of master equations, we prove that there can exist at most one sufficiently smooth solution and that it is consistent with the associated Nash equilibrium. In this approach, coefficients are only required to be Lipschitz, in particular, no differentiability assumption with respect to probability measures is needed. In a second part, we apply this notion of solution to prove the existence and uniqueness of solutions to MFGs with a major player on intervals of arbitrary length. Our argument relies on assuming that the intensity of the Brownian common noise driving the state of the major player is sufficiently large, as well as a joint displacement monotonicity assumption between the coefficients of minor players and those of the major player. Most notably, this joint monotonicity allows us to prove that the threshold of volatility can be taken independently of the horizon of the game considered, without any long time decoupling assumption on the dependence between minor players and the major player. Finally, inspired by recent extragradient methods for mean field games, we present an algorithm that converges exponentially fast to the solution of the major-minor probabilistic system under this monotonicity assumption. Thanks to the generality of our approach, all results presented in this article hold for mean field games of controls with a major player.
Read the full abstract

Analysis of PDEs

Global stability in an age-structured SIRS malaria transmission model

This paper proposes and analyzes a malaria transmission model structured by the chronological age of the human host population. The model couples an age-structured SIRS system for humans, incorporating waning immunity, with an SI system for mosquitoes under mass-action transmissions. Using integrated semigroup theory and spectral analysis, we establish the well-posedness of the model, derive the basic reproduction number, and prove the global asymptotic stability of the parasite-free equilibrium by using a Lyapunov functional, when $R_0\leq 1$, thereby excluding the possibility of backward bifurcation. Numerical simulations further suggest the global stability of the endemic equilibrium when $R_0>1$.
Read the full abstract

All authors Seraphin Djaoue, Quentin Richard, Antoine Perasso, Irépran Damakoa

Number Theory

Variance of GL(2) Fourier coefficients in arithmetic progressions

We improve a result of Lau and Zhao on the variance of Fourier coefficients of primitive cuspidal modular forms for SL2(Z) in arithmetic progressions. This is achieved by using bounds on the first moment of Rankin-Selberg L-functions in the height aspect and non-trivial estimates for shifted convolution sums.
Read the full abstract

Analysis of PDEs

Curved Ingham Inequalities for Dispersive Trigonometric Sums

We study $L^2$ restrictions of dispersive trigonometric sums $$ F(t,x)=\sum_{n\in\Z} c_n e^{2\pi i(|n|^s t+nx)} $$ to curves in the $(t,x)$-plane. Our main result is a curved analogue of Ingham's inequality: for a class of trajectories satisfying quantitative curvature assumptions, we obtain upper and lower $L^2$ estimates for the restriction of $F$ in terms of the $\ell^2$-norm of its coefficients. %Unlike the affine case, the lower estimate requires sufficiently large time. %We also show that its normalized lower-bound constant cannot remain uniformly positive as the interval shrinks to zero. We then investigate two situations in which this obstruction disappears. First, for measures with polynomial Fourier decay, sufficiently high frequencies form a Riesz sequence; in particular, along smooth curves with non-vanishing curvature this yields strong Ingham inequalities for sufficiently high frequencies when $s>2$. Second, for every fixed time interval, the full system satisfies such a lower estimate when the dispersion exponent $s$ is sufficiently large. We also study finite dispersive trigonometric sums and prove rigidity results for their zero sets along analytic and meromorphic curves. Finally, we apply these harmonic-analysis results to fractional Schrödinger equations on the torus, including equations with bounded potentials.
Read the full abstract

All authors Bernhard H Haak, Philippe Jaming, Ming Wang, Yunlei Wang

Information Theory · Cross-listed from quant-ph

Asymptotically good bosonic Fock state codes

We study the error-correction properties of multi-mode Fock-state codes under amplitude-damping (AD) noise, focusing on the asymptotic regime in which the total excitation of the code states grows without limit and the number of photon losses induced by the noise scales linearly with it. In this setting, existing code families, which correct only sublinearly many photon losses, do not protect against amplitude-damping (AD) noise with a constant loss parameter. As our main result, we address this gap by constructing asymptotically good Fock-state codes relying on random classical codes in the discrete simplex. Unlike many standard constructions of random quantum codes, our construction introduces randomness through the underlying classical indexing structure. Randomization also enables another desirable feature: bounded per-mode occupancy, which limits the number of photons in any individual mode and thereby increases the coherence lifetime of the code states. Finally, via a relation between Fock-state codes and permutation-invariant codes, our results also yield asymptotically good families of qudit permutation-invariant codes as well as codes in monolithic nuclear state spaces.
Read the full abstract

Dynamical Systems · Cross-listed from stat.ME

Bayesian Inference in Epidemic Modelling: A Beginner's Guide

This lecture note provides a self-contained introduction to Bayesian inference and Markov Chain Monte Carlo (MCMC) methods for parameter estimation in epidemic models. Using the classical Susceptible-Infectious-Recovered (SIR) compartmental model as a running example, we derive the likelihood function from first principles, specify priors on the transmission and recovery parameters, and implement the Metropolis-Hastings algorithm to sample from the posterior distribution. The note is aimed at graduate students and researchers in mathematical epidemiology with limited prior exposure to Bayesian statistics.
Read the full abstract

Quantum Algebra

Twisted modules of $\frac{1}{2}\mathbb{Z}$-graded modular vertex superalgebras

In this paper, we investigate the theory of $g$-twisted modules for modular $\frac{1}{2}\mathbb{Z}$-graded vertex superalgebras over an algebraically closed field $\mathbb{F}$ of prime characteristic $p>2$. For a $\frac{1}{2}\mathbb{Z}$-graded vertex superalgebra $V$ and an automorphism $g$ of $V$ of finite order $T$ relatively prime to $p$, we give a twisted version of Zhu's associative algebra, denoted by $A_g(V)$. We prove that there is a one-to-one correspondence between the set of equivalence classes of simple $A_g(V)$-modules and the set of equivalence classes of simple $\frac{1}{T_0}\mathbb{N}$-graded $g$-twisted $V$-modules, where $T_0$ is the order of the automorphism $g\sigma$ with $\sigma$ the parity automorphism. As an application, we study twisted modules for modular vertex superalgebras associated to the affine Lie superalgebras and determine the corresponding twisted Zhu algebra. We also compute the twisted Zhu algebra for the modular Neveu-Schwarz vertex superalgebra and classify its irreducible twisted modules.
Read the full abstract

Algebraic Topology

Burnings of trees and their homologies

The problem of graph burning was firstly introduced as a model for different processes of social and network interactions. Recently, the authors of the present paper developed methods of algebraic topology for investigation of this problem. This approach is based on the new definition of burning process which excludes the possibility to choose at any moment vertex for burning from the set of vertices which are already burned at this moment. In this paper we continue to study such burning process using algebraic topology methods. We prove the result about relations between burnings of a graph and burnings of its spanning trees that is similar to the classical case. Afterwards, we describe properties of trees burnings. In particular, we prove that a burning of a tree defines a structure of a digraph on the tree and investigate this structure. We introduce and study a strong burning configuration space of a graph and new strong burning homology which are similar to burning homology defined in our previous paper, but arise from burning homomorphism.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Multi-Scale Control of Large Agent Populations: From Density Dynamics to Individual Actuation

We review a body of recent work by the author and collaborators on controlling the spatial organisation of large agent populations across multiple scales. A central theme is the systematic bridging of microscopic agent-level dynamics and macroscopic density descriptions, enabling control design at the most natural level of abstraction and subsequent translation across scales. We show how this multi-scale perspective provides a unified approach to both direct control, where every agent is actuated, and indirect control, where few leaders or herders steer a larger uncontrolled population. The review covers continuification-based control with robustness under limited sensing and decentralised implementation via distributed density estimation; leader–follower density regulation with dual-feedback stability guarantees and bio-inspired plasticity; optimal-transport methods for coverage control and macro-to-micro discretisation; nonreciprocal field theory for collective decision-making; mean-field control barrier functions for population-level safety; and hierarchical reinforcement learning for settings where closed-form solutions are intractable. Together, these results demonstrate the breadth and versatility of a multi-scale control framework that integrates analytical methods, learning, and physics-inspired approaches for large agent populations.
Read the full abstract

Numerical Analysis

An Efficient Cumulative Edge-Detection Method for Image Reconstruction

When reconstructing images from noisy measurements, such as in medical scans or scientific imaging, we face an inverse problem: recovering an unknown image from indirect, corrupted observations. These problems are typically ill-posed, meaning small amounts of noise can lead to inaccurate reconstructions. Regularization techniques address this by incorporating prior assumptions about the solution, such as smoothness or sparsity. However, standard methods often blur sharp edges–the boundaries between tissues or structures–losing critical detail. A powerful strategy for edge preservation is iterative reweighting, which solves a sequence of weighted subproblems with adaptively updated weights. Non-cumulative schemes derive weights from the current iterate alone and can be solved efficiently using the Recycled Majorization-Minimization Generalized Krylov Subspace method (RMM-GKS). The cumulative approach of Gazzola et al. progressively accumulates edge information across iterations, achieving superior edge preservation but at high computational cost. This work introduces CR-$\ell_q$-RMM-GKS, which combines cumulative edge detection with computational efficiency. We integrate Gazzola's cumulative weighting with RMM-GKS, which handles general $\ell_q$ penalties ($0 < q \le 2$), automatically selects regularization parameters, and recycles Krylov subspaces between iterations, reducing the nested structure to two levels. Numerical experiments in signal deblurring and tomography demonstrate that CR-$\ell_q$-RMM-GKS produces significantly sharper edge reconstructions than standard non-cumulative methods. In particular, CR-$\ell_1$-RMM-GKS outperforms both standard $\ell_1$ methods and CR-$\ell_2$-RMM-GKS, indicating that cumulative weighting and $\ell_1$ penalties are highly complementary.
Read the full abstract

Number Theory

Infinite families of APN permutations in constrained trivariate classes over $\mathbb{F}_{2^m}$

We study trivariate permutation polynomials over $\mathbb{F}_{2^{m}}$ extending two APN permutation families of Li–Kaleyski (IEEE Trans. Inform. Theory, 2024) by allowing the scalar parameter to vary over $\mathbb{F}_{2^m}^*$. For \[ G_a(x,y,z)=(x^{q+1}+ax^qz+yz^q,\; x^qz+y^{q+1},\; xy^q+ay^qz+z^{q+1}), \] where $a\in\mathbb{F}_{2^m}^*$, $q=2^i$, $\gcd(i,m)=1$, and $m$ is odd, we prove that $G_a$ is a permutation if and only if an associated univariate polynomial has no root in $\mathbb{F}_{2^m}^*$, and that this condition is also equivalent to $G_a$ being APN. Hence, writing $d=q^2+q+1$, at least \[ \frac{2^m+1-(d-1)(d-2)2^{m/2}-d}{d} \] values of $a$ yield APN permutations $G_a$. In the binary case $q=2$, we show that $a=1$ is good whenever $7\nmid m$, recovering the Li–Kaleyski family. For the second family \[ H_a(x,y,z)=(x^{q+1}+axy^q+yz^q,\; xy^q+z^{q+1},\; x^qz+y^{q+1}+ay^qz), \] we obtain the same root criterion and prove that its defining polynomial is root-equivalent to that of $G_a$. Thus the same parameters $a$ give APN permutations in both families. We also prove strong inequivalence results. First, $G_a$ (resp.\ $H_a$) is diagonally equivalent to $G_1$ (resp.\ $H_1$) if and only if $a^{q^2+q+1}=1$; moreover, for $m>4$, $m\neq 6$, and $7\nmid m$, diagonal non-equivalence implies CCZ non-equivalence by the monomial restriction theorem of Shi et al.\ (DCC, 2025). In particular, when $q=2$ and $7\nmid m$, every good $a\neq 1$ gives APN permutations CCZ-inequivalent to Li–Kaleyski. Second, for the same range of $m$, no $G_a$ is CCZ-equivalent to any $H_b$. Hence these constructions yield two genuinely new, mutually inequivalent families of APN permutations on $\mathbb{F}_{2^{3m}}$.
Read the full abstract

Metric Geometry

The moment of inertia tensor of an oloid

The oloid is defined as the convex hull of two unit circles in perpendicular planes, each passing through the center of the other. In this paper we derive an analytical expression for the moment of inertia tensor of an oloid with uniform density and confirm the result numerically.
Read the full abstract

Probability

Regularity of the Value Function in Discounted Infinite-Time Mean Field Games

In [18], we introduced discounted infinite-time mean field games. Subsequently, in [19], we studied the connection between infinite-time mean field FBSDEs and elliptic master equations. In this paper, we further investigate the regularity of the representative player's value function $V(x,\mu)$. We first establish strong well-posedness and uniqueness in law for an extended class of infinite-time FBSDEs. In the weighted $L_r^2$ framework, we construct directional variations and obtain a bounded continuous representation of the Lions-derivative of $\partial_xV$. Under additional smoothness and quantitative stability assumptions, $L_r^p$ estimates for scalar linear FBSDEs allow us to establish the existence of higher-order derivatives of $\partial_xV$. Consequently, $\partial_xV$ is a classical solution of the elliptic master equation for the value function's derivative.
Read the full abstract