Differential Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 2 March
Harmonic morphisms, maps which preserve Laplace's equation, are intimately connected to the topic of minimal submanifolds. In this article we first characterise harmonic morphisms between Riemannian manifolds as the weakly horizontally conformal maps that preserve the equation for minimal submanifolds of co-dimension $2$. We further derive additional reduction properties of harmonic morphisms for minimal submanifolds of other co-dimensions. These theorems are then applied in an example case, yielding a novel family of degree $4$ area-minimising hypercones in $\mathbb R^m$, $m\geq32$.
Probability
The infinite block spin Ising model
We study a block mean-field Ising model with $N$ spins split into $s_N$ blocks, with Curie-Weiss interaction within blocks and nearest-neighbor coupling between blocks. While previous models deal with the block magnetization for a fixed number of blocks, we study the the simultaneous limit $N\to\infty$ and $s_N\to\infty$. The model interpolates between Curie-Weiss model for $s_N=1$, multi-species mean field for fixed $s_N=s$, and the 1D Ising model for each spin in its own block at $s_N=N$. Under mild growth conditions on $s_N$, we prove a law of large numbers and a multivariate CLT with covariance given by the lattice Green's function. For instance, the high temperature CLT essentially covers the optimal range up to $s_N=o(N/(\log N)^c)$ and the low temperature regime is new even for fixed number of blocks $s > 2$. In addition to the standard competition between entropy and energy, a new obstacle in the proofs is a curse of dimensionality as $s_N \to \infty$.
Read the full abstract
Statistics Theory
Wasserstein-based identification of metastable states in time series data via change point detection and segment clustering
Change point detection for time series analysis is a difficult and important problem in applied statistics, for which a variety of approaches have been developed in the past several decades. Here, the Wasserstein metric is employed as a tool for change-point identification in multi-dimensional time series data in order to identify clusters in time series in an unsupervised way. We leverage the simplicity of the optimal transport cost in the 1-dimensional setting to quickly identify both a segmentation (family of change points for a trajectory) and a clustering for the data when the number of segments is much smaller than the number of data points, making no parametric assumptions about the particular distributions involved. Our change point detection method scales linearly in the size of the data and in the dimension of the samples. We test our approach on idealized synthetic data trajectories, as well as real world trajectories coming from the domain of molecular dynamics simulations and underwater acoustics. We find that segmenting these time series via change points obtained by estimating the Wasserstein metric derivative and then clustering the identified segments as measures with similarity measured by the Wasserstein metric, successfully identifies metastable states in the law of the processes.
Read the full abstract
Rings and Algebras
Groups of generalized Moufang type and $\mathbb Z_2$-graded algebras
A pair $(G,T)$ is called a faithful odd transposition group if $T$ is a normal set of involutions generating the group $G$ and the product of any two distinct elements of $T$ has odd order. We introduce a special subclass of such groups, a \emph{generalized Moufang group of $p$-type} (or $GM(p)$-type), in which the product of any two distinct involutions from $T$ has a fixed prime order $p$. For any such group $(G,T)$ and a scalar parameter $\eta$ in a field $\mathbb F$, we construct a non-associative, non-commutative algebra $A = A_{\mathbb F}(G,T,\eta)$. We prove that every element of $T$ considered as an element of the algebra $A$, is a primitive semisimple idempotent, defining a $\mathbb Z_{2}$-grading of $A$. The Miyamoto group of $A$ with respect to $T$ is isomorphic to $G/Z(G)$. The algebra $A$ contains no nontrivial right ideals and, for a specific choice of the parameter $\eta$, admits a symmetric left Frobenius form. When $G$ is a free Burnside group of odd prime period $p$ extended by an involutory automorphism, the finiteness of $G$ is equivalent to the finite-dimensionality of $A_{\mathbb F}(G,T,\eta)$, providing a reformulation of the Burnside problem. For $p=5$ and $\eta=-1/3$, the algebra generated by two idempotents from $T$ is left-axial and satisfies the Monster-type fusion law $\mathcal{M}(4/3, -4/3)$. For a prime $p>5$, the two-generated algebra is also axial, but obeys a more general fusion law. Although the algebra $A_{\mathbb F}(G,T,\eta)$ is initially defined using a group $GM(p)$-type, we show that it admits an intrinsic, group-free characterization by axiomatizing a class of so-called $GM(p,\eta)$-type algebras. We prove that every algebra in this class is isomorphic to one arising from the construction above, establishing the equivalence of the two definitions.
Read the full abstract
Analysis of PDEs
Liftings of Sobolev maps into closed Riemannian manifolds via double coverings and minimal connections relative to planar sets, with an application to ferronematics
We consider Sobolev maps from a planar domain into a closed Riemannian manifold and their BV liftings via a double covering of the target. We establish a sharp lower bound on the jump length of the lifting, expressed in terms of a geometric quantity: the minimal connection, relative to the domain, of the non-orientable singularities. As an application, we analyse minimisers of a two-dimensional model of ferronematics under “mixed” boundary conditions – that is, Dirichlet conditions for the liquid crystal order parameter and Neumann conditions for the magnetisation vector.
Read the full abstract
Analysis of PDEs
Analysis of the steady solutions of the Fisher's infinitesimal model; a Hilbertian approach
We provide an asymptotic analysis of a nonlinear integro-differential equation which describes the evolutionary dynamics of a population which reproduces sexually and which is subject to selection and competition. The sexual reproduction is modeled via a nonlinear integral term, known as the Fisher's 'infinitesimal model'. We consider a small segregational variance regime, where a parameter in the infinitesimal model, which measures the deviation between the trait of the offspring and the mean parental trait, is small with respect to the selection variance. In this regime, we characterize the steady states of the problem and analyze their stability. Our method relies on a spectral analysis involving Hermite polynomials, highlighting the specific structure of the nonlinear reproduction term. We expect that the framework developed in this article will contribute to progress on several related problems that were out of reach with previous methods.
Read the full abstract
Analysis of PDEs
Quantitative Convergence of Wasserstein Gradient Flows of Kernel Mean Discrepancies
We study the quantitative convergence of Wasserstein gradient flows of Kernel Mean Discrepancy (KMD) (also known as Maximum Mean Discrepancy (MMD)) functionals. Our setting covers in particular the training dynamics of shallow neural networks in the infinite-width and continuous time limit, as well as interacting particle systems with pairwise Riesz kernel interaction in the mean-field and overdamped limit. Our main analysis concerns the model case of KMD functionals given by the squared Sobolev distance $ \mathscr{E}^{\nu}_{s}(\mu)= \frac{1}{2}\lVert \mu-\nu\rVert_{\dot H^{-s}}^{2}$ for any $s\geq 1 $ and $\nu$ a fixed probability measure on the $d$-dimensional torus. First, inspired by Yudovich theory for the $2d$-Euler equation, we establish existence and uniqueness in natural weak regularity classes. Next, we show that for $s=1$ the flow converges globally at an exponential rate under minimal assumptions, while for $s>1$ we prove local convergence at polynomial rates that depend explicitly on $s$ and on the Sobolev regularity of $\mu$ and $\nu$. These rates hold both at the energy level and in higher regularity classes and are tight for $\nu$ uniform. We then consider the gradient flow of the population loss for shallow neural networks with ReLU activation, which can be cast as a Wasserstein–Fisher–Rao gradient flow on the space of nonnegative measures on the sphere $\mathbb{S}^d$. Exploiting a correspondence with the Sobolev energy case with $s=(d+3)/2$, we derive an explicit polynomial local convergence rate for this dynamics. Except for the special case $s=1$, even non-quantitative convergence was previously open in all these settings. We also include numerical experiments in dimension $d=1$ using both PDE and particle methods which illustrate our analysis.
Read the full abstract
Numerical Analysis · Cross-listed from stat.ML
Density-Matrix Spectral Embeddings for Categorical Data: Operator Structure and Stability
We introduce a supervised dimensionality reduction methodology for categorical (and discretized mixed-type) data based on a density-matrix construction induced by class-conditional frequencies. Given a labeled dataset encoded in a one-hot survey space, we assemble a frequency matrix whose columns aggregate feature occurrences within each class, and define a normalized Gram-type operator that satisfies the axioms of a density matrix. The resulting representation admits an intrinsic rank bound controlled by the number of classes, enabling low-dimensional spectral embeddings via dominant eigenmodes. Classification is performed in the reduced space through class-conditional kernel density estimation and a maximum-likelihood decision rule. We establish structural invariances, provide complexity estimates, and validate the approach on synthetic benchmarks probing high cardinality, sparsity, noise, and class imbalance.
Read the full abstract
Combinatorics
Some properties of minimally nonperfectly divisible graphs
A graph is perfectly divisible if every induced subgraph $H$ admits a partition $(A,B)$ of $V(H)$ such that $H[A]$ is perfect and $\omega(H[B])<\omega(H)$. A graph is minimally nonperfectly divisible if it is not perfectly divisible but every proper induced subgraph is perfectly divisible. We prove that every $P_2\cup P_4$-free or diamond-free minimally nonperfectly divisible graph has no homogeneous set, and that every $2P_3$-free or claw-free minimally nonperfectly divisible graph has no clique cutset. We also study the relationship between perfect divisibility and its weighted analogue, perfect weight divisibility, defined for positive integral vertex weights. We prove that if a graph $H$ has no adjacent twins, then every $H$-free graph is perfectly divisible if and only if every $H$-free graph is perfectly weight divisible.
Read the full abstract
Probability
Periodic KPZ fixed point with general initial conditions
We consider the relaxation-time-scale limit of the periodic totally asymmetric simple exclusion process (PTASEP) with general initial conditions. For every sequence of initial conditions approximating a periodic upper semicontinuous function, we compute the limiting space-time multipoint distributions of the rescaled particle locations and height functions. The resulting finite-dimensional distributions are explicit and form a consistent family, thereby defining a spatially periodic space-time random field. We call this field the periodic KPZ fixed point with the corresponding initial condition. This extends earlier results for PTASEP with special initial conditions and defines the periodic analogue of the KPZ fixed point on the line. The main technical novelty is a pair of new probabilistic representations for the energy function and the characteristic function, the two functions through which the initial condition enters the finite-time PTASEP multipoint distribution formula. Both representations are expressed in terms of a geometric random walk and two stopping times, namely the first hitting time of the initial profile and the first such hitting time at or after one full period, with the latter capturing the periodic geometry.
Read the full abstract
Optimization and Control
A note on the convergence of RED algorithms under minimal hypotheses and open questions
In this note, we give a convergence result for a modified ”regularization-by-denoising”(RED) algorithm under a restricted isometry condition on measurements and a restricted Lipschitz condition on the considered deep projective prior. This study leads to open questions about the convergence of RED algorithms.
Read the full abstract
Combinatorics
The Poincaré polynomial of the type B analogue of $\overline{\mathcal{M}}_{0,n+1}$
We establish formulas for the Poincaré polynomial of the type B analogue of the Deligne–Knudsen–Mumford moduli space of rational curves with n marked points, providing type B counterparts to results by Keel, Manin, Getzler, and Yuzvinsky. We establish functional and differential equations satisfied by the bivariate exponential generating function of these polynomials. We show how this generating function relates to the classical one in type A. We deduce the gamma-positivity of these polynomials via a quadratic recursion and discuss a type B analogue of a formula found by Aluffi, Marcolli and Nascimento in type A.
Read the full abstract
Classical Analysis and ODEs
Falconer-type results for any finite graph with multiple pins
A generalization of the celebrated Falconer distance problem asks for a graph $G=(\mathcal{V},\mathcal{E})$, with vertex set $\mathcal{V}$ and edge set $\mathcal{E}$, how large the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$, $d\geq 2$, needs to be to guarantee that the distance graph $$ \Delta^{G}(E):= \lbrace (|x_{i}-x_{j}|)_{(v_i,v_j)\in\mathcal{E}} : x_1,\ldots,x_{|\mathcal{V}|}\in E \rbrace $$ has positive $|\mathcal{E}|$-dimensional Lebesgue measure. Here we represent the edges in $\mathcal{E}$ as ordered pairs of vertices $(v_i,v_j)$ with $i<j$. Many results exist for particular graphs, such as trees and simplices. Some general results exist, but they require intricate calculations, such as computing Fourier decay of the natural measure on the configuration set or mapping properties of associated Fourier integral operators. In this paper, using the graph theory notion of $k$-degeneracy, which is easy to compute, we obtain a non-trivial dimensional threshold $\frac{d+k}{2}$, $d>k$, for any non-trivial graph $G$. Key ingredients for our result are identifying pinned stars as the right building blocks for a general graph as well as refining a Fubini type argument due to Taylor and the third named author. We further generalize this to graphs with multiple pins by introducing the $k$-admissibility of a graph, a generalization of $k$-degeneracy that takes pins into account, as well as by extending the Fubini argument to the multiple pinned setting. Not only do we obtain non-trivial results in high enough dimensions for any distance graph, but for particular graphs (such as cycles) our results are also strong and improve the previously best known results. Our methods extend to general two point configurations, contingent on results being available for the appropriate star building blocks.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Accelerating Single-Pass SGD for Generalized Linear Prediction
We study generalized linear prediction under a streaming setting, where each iteration uses only one fresh data point for a gradient-level update. While momentum is well-established in deterministic optimization, a fundamental open question is whether it can accelerate such single-pass non-quadratic stochastic optimization. We propose the first algorithm that successfully incorporates momentum via a novel data-dependent proximal method, achieving dual-momentum acceleration. Our derived excess risk bound decomposes into three components: an improved optimization error, a minimax optimal statistical error, and a higher-order model-misspecification error. The proof handles mis-specification via a fine-grained stationary analysis of inner updates, while localizing statistical error through a two-phase outer-loop analysis. As a result, we resolve the open problem posed by Jain et al. [2018a] and demonstrate that momentum acceleration is more effective than variance reduction for generalized linear prediction in the streaming setting.
Read the full abstract
Algebraic Geometry
Intersection theory on singular moduli spaces of vector bundles: a parabolic approach
We present explicit formulas for the intersection pairing in the intersection cohomology of the moduli space $M_0(r)$ of rank-$r$, degree-$0$ semistable bundles on a Riemann surface. The key idea is to realize this intersection cohomology as a canonical subspace of the cohomology of a smooth moduli space of parabolic bundles, where the pairing can be computed via the Hecke correspondence and the Jeffrey-Kirwan iterated residue formulas. This approach provides a simpler alternative to the blow-up construction of Jeffrey-Kirwan-Kiem-Woolf, yielding formulas for the intersection pairing on $M_0(r)$, for arbitrary $r$, with a clear geometric interpretation.
Read the full abstract
Analysis of PDEs
Dispersive estimates for a system of tensorial quasilinear wave equations satisfying the weak-null condition
We establish both global existence and decay properties for solutions with small data for a general class of coupled system of tensorial quasilinear hyperbolic wave equations in three space dimensions, that covers the dynamical Einstein equations coupled to a class of non-linear matter sources that do not satisfy the null condition of Christodoulou and Klainerman, and have new different non-linearities than the one treated by Lindblad-Rodnianski, for which their celebrated seminal $L^\infty$-estimate does not work, to the best of our knowledge. Global existence of solutions for a general class of quasilinear wave equations satisfying the weak-null condition, with small initial data, is largely an open problem at present. There is no known theory to prove decay for the class of non-linear hyperbolic partial differential equations that we treat in this paper. We establish a technique based on novel decoupling of the higher order energy estimates, at the level of the $L^2$-norm of the Lie derivatives of the tangential components, without involving all the other components, up to some good factor. This generalizes our previous results to include new non-linearities that are not present in the Einstein-Yang-Mills system in the Lorenz gauge.
Read the full abstract
Mathematical Physics
Sector Theory of Levin-Wen Models II : Fusion and Braiding
This is the continuation of our study of the Levin-Wen model based on an arbitrary unitary fusion category $\mathcal{C}$ on the infinite plane. The ground state of the Levin-Wen model hosts anyonic excitations whose fusion and braiding properties are captured by the associated braided $\rm C^*$-tensor category of superselection sectors $\mathsf{SSS}$. By constructing explicit isomorphisms between the fusion spaces of $\mathsf{SSS}$ and those of the Drinfeld center $Z(\mathcal{C})$, we show that these two categories have isomorphic $F$- and $R$-symbols. It follows that the full subcategory of finite sectors is unitarily braided monoidally equivalent to the Drinfeld center, $$\,\mathsf{SSS}_f \simeq Z(\mathcal{C}).$$ This provides the first complete characterisation of the category of superselection sectors for a class of two-dimensional lattice models supporting anyons with non-integer quantum dimensions.
Read the full abstract
Analysis of PDEs
Future stability of large-data wave maps in energy-supercritical dimensions
We consider energy-supercritical co-rotational wave maps from Minkowski spacetime to the sphere in odd spatial dimensions. The equation admits an explicit co-rotational self-similar blowup solution, which also induces solutions that blow up in the past. In the region after the blowup the solution treated in this paper is remarkable, as it is smooth forward in time and exhibits less than dispersive decay. We prove nonlinear asymptotic stability of this large-data self-similar solution inside forward light cones. In particular, we identify an open set of initial data close to the explicit solution that give rise to forward-in-time wave maps whose decay is slower than that of generic free waves.
Read the full abstract
Analysis of PDEs
Existence and uniqueness of time-periodic solutions of the 2D and 3D convective Brinkman-Forchheimer extended Darcy equations
In this work, we investigate the existence and uniqueness of solutions to the following 2D and 3D convective Brinkman-Forchheimer extended Darcy equations defined on a bounded smooth domain $\Omega\subset\mathbb{R}^d$, $d\in\{2,3\}$, \begin{align*}\frac{\partial\boldsymbol{v}}{\partial t}-\mu \Delta\boldsymbol{v}+(\boldsymbol{v}\cdot\nabla)\boldsymbol{v}+\alpha\boldsymbol{v}+\beta\vert \boldsymbol{v}\vert^{r-1}\boldsymbol{v}+\gamma\vert \boldsymbol{v}\vert ^{q-1}\boldsymbol{v}+\nabla p=\boldsymbol{g},\ \nabla\cdot\boldsymbol{v}=0, \end{align*} where $\mu,\alpha,\beta>0$, $\gamma\in\mathbb{R}$, $r,q\in[1,\infty)$ with $r>q\geq 1$ and $\boldsymbol{g}$ is an external forcing term. For $r \geq 1 $, under periodic forcing, we establish the existence of time-periodic global weak solutions to the system by employing Faedo-Galerkin approximations, together with the Banach-Alaoglu theorem, the Aubin-Lions-Simon compactness lemma, and the Lions-Magenes lemma. The existence of periodic solutions for the Faedo-Galerkin approximated problem is obtained via Brouwer's fixed point theorem. In the supercritical case $(r>3)$ and the critical case ($r=3$), we prove the uniqueness of the global weak solution without imposing any smallness condition on the external forcing. This constitutes a new result compared to the classical 2D Navier-Stokes equations with periodic inputs, for which the uniqueness of strong solutions typically requires smallness assumptions on the external force.
Read the full abstract
Numerical Analysis
Performance comparison of Python, MATLAB and R for numerical solutions of SI and SIR epidemiological models
Mathematical modeling plays a vital role in epidemiology, offering insights into the spread and control of infectious diseases. The compartmental models developed by Kermack and McKendrick, particularly the SI (Susceptible-Infected) and SIR (Susceptible-Infected-Recovered) models, form the basis of many epidemic studies. While some simple cases permit analytical solutions, most real-world models require numerical methods such as Euler's method, the fourth-order Runge-Kutta (RK4) method, and Predictor-Corrector (P-C) methods. These methods are typically implemented in scientific computing software like Python, MATLAB, and R. However, the computational efficiency and run-time performance of these software tools in solving epidemiological models have not been comprehensively compared in the literature. This study addresses this gap by solving the SI and SIR models using Euler's method, RK4, and P-C methods in Python, MATLAB, and R. Execution times are recorded for each implementation to evaluate computational efficiency. Additionally, for the SI model, where an exact analytical solution exists, R2 values are computed to assess numerical accuracy. For the SIR model, a high-accuracy reference solution is obtained by solving the system using MATLAB's ODE45 solver, and the SIR solutions computed via the RK4 method in MATLAB are compared against this reference. The results provide a comparative perspective on the accuracy and run-time performance across different software and numerical methods, offering practical guidance for researchers and practitioners in selecting suitable tools for epidemic modeling.
Read the full abstract
Probability
Normal approximation for partial sums: general convex costs
We provide non-asymptotic bounds and asymptotic limits for convex transport costs between the distribution of partial sums of independent and identically distributed square integrable and centered random variables and the normal distribution with mean zero and the same variance. The proof relies on controlling the transport cost by an appropriate ideal distance, combined with an adaptation of Lindeberg's method. The numerical constants and the asymptotic constants are explicit.
Read the full abstract
Geometric Topology
Two characters on one punctured Riemann surface
We develop an abstract framework for coupled period–realization of meromorphic $1$–forms on punctured Riemann surfaces. A configuration datum $C$ gives the combinatorics and determines a restricted character domain $\Delta_C\subset\mathrm{Hom}(\Gamma_{g,n},{\mathbb C})^2$ with a scale–fixed slice $\Delta_C^{\mathrm{sc}}$. Assuming Teichmüller–regularity, degeneration detection, and pushability, we prove that there is point in $\Delta_C^{\mathrm{sc}}$ which corresponds to a surface carrying two meromorphic differentials realizing any prescribed restricted pair. This abstracts the Weber–Wolf extremal–length minimization method while constructing minimal surfaces.
Read the full abstract
Combinatorics
The permutation automorphism groups of irreducible cyclic codes
The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$, and it is non-degenerate if it is not periodic. Such a non-degenerate code is standard if its permutation automorphism group is equal to the group generated by the cyclic shift and the Frobenius automorphism, and non-standard otherwise. In this paper, we give a complete classification of all non-standard non-degenerate irreducible cyclic codes, using the classification of finite simple groups. Our result shows that, apart from a small number of explicit exceptional families and their descendants under certain secondary constructions, every non-degenerate irreducible cyclic code is standard, and up to four explicit exceptions, every nonzero degenerate cyclic code is non-standard. This classification has several consequences. First, it yields a general description of non-standard linear recurring sequence subgroups, extending the earlier work of Brison and Nogueira; secondly, it establishes the Schmidt-White conjecture for all non-standard non-degenerate irreducible cyclic codes. Moreover, our results provide strong evidence in support of the conjecture of Berger and Charpin that almost all cyclic codes are standard.
Read the full abstract
Information Theory
THz RHS Transceiver for Low-Latency Multi-User VR Transmission with MEC
This paper investigates a Terahertz (THz)-enabled mobile edge computing (MEC)-assisted virtual reality (VR) system using reconfigurable holographic surfaces (RHS) as transceiver for multi-user beamforming and holographic-pattern division multiple access (HDMA). We develop an end-to-end model for the 3D field-of-view (FoV) generation pipeline and optimize content prefetching, rendering offloading under memory and power constraints, and beamforming accommodating user movement by adjusting holographic pattern weights for beamshaping and feeds power allocation for excitation amplitude adjustment. For homogeneous FoVs, we derive closed-form policies for prefetching 2D or 3D FoVs or direct transmission of 3D FoVs. For heterogeneous FoVs, we exploit the timescale separation between prefetching/rendering and fast RHS beamforming, decomposing the optimization into a rendering-prefetching combinatorial optimization problem and a short-timescale beamforming convex optimization problem. Simulations show significant latency reductions under tight resource constraints.
Read the full abstract
Differential Geometry
Open $3$-manifolds with non negative Ricci curvature in a spectral or integral sense
Numerical Analysis
Asymptotic Analysis of Shallow Water Moment Equations
The Shallow Water Moment Equations (SWME) are an extension of the Shallow Water Equations (SWE) for improved modelling of free-surface flows. In contrast to the SWE, the SWME incorporate vertical velocity profile information. The SWME framework approximates vertical velocity profiles using a polynomial expansion with Legendre polynomials and polynomial coefficients, also called moment variables. The SWME have an increased number of variables that must always be incorporated, even when the flow approaches a viscous slip equilibrium state that could be characterised by vanishing moment variables. To reduce the complexity of the SWME in cases proximate to this equilibrium, we conduct an asymptotic analysis of the SWME. This yields the closed form Reduced Shallow Water Moment Equations (RSWME) for deviations from the equilibrium. The RSWME have fewer variables, compared to the SWME. The hyperbolicity of the RSWME is analysed. Numerical tests include a wave with a sharp height gradient, a smoother height gradient and a square root velocity profile. The numerical tests demonstrate that the RSWME reduce computational cost up to 77% compared to the SWME and improves accuracy up to 88% over the SWE.
Read the full abstract
Algebraic Geometry
Berkovich $2$-motives and normed ring stacks
The de Rham stack construction of Simpson shows that D-modules are quasicoherent sheaves on a modified geometry. Drinfeld furthermore introduced the ring stack perspective (aka transmutation), which asserts that a coefficient theory is determined by a ring stack. Scholze proposed relating this idea to motivic realizations using $(\infty,2)$-categorical language. In this work, we formulate and prove a precise version of this principle: The presentable category of kernels of motivic homotopy theory is the linearly symmetric monoidal $(\infty,2)$-category that is freely generated by a homologically trivial smooth sutured ring stack. We also prove the étale version of this statement, reducing étale descent to the Kummer and Artin–Schreier conditions. Lastly, we prove an analytic version connecting Scholze's Berkovich motives and ring stacks with an absolute value. This is useful to construct motivic realization functors in analytic geometry, such as the Habiro and Hyodo–Kato realizations.
Read the full abstract
Logic
Transfer of generalized amalgamation in simple theories
We give an abstract framework to transfer generalized amalgamation from a simple theory to another, and we apply it to theories of bounded PAC structures, of fields with operators and of lovely pairs. We show in particular that bounded pseudo-algebraically closed fields have generalized amalgamation, regardless of their imperfection degree.
Read the full abstract
Group Theory
On the expected value of energy in groups
We obtain explicit upper and lower bounds for the expected action energy associated with a pair $({\sf A},{\sf \Delta})$ of subsets sampled uniformly at random from a permutation group and its domain, respectively. We then specialize these bounds to multiplicative energy in several settings. In particular, we derive sharp asymptotic formulae for the expected energy of pairs of the form $({\sf A},{\sf A})$ and $({\sf A},{\sf A}^{-1})$. Finally, we apply these estimates to derive probabilistic results on the existence of subsets with large growth and to compare the typical behaviour of the cardinalities of the sets $|{\sf A}^{\ast 2}|$ and $|{\sf A}{\sf A}^{-1}|$.
Read the full abstract
Optimization and Control · Cross-listed from eess.SP
Multiresolution Adaptive Block-Coordinate Forward-Backward for Image Reconstruction
Classical first-order optimization methods for imaging inverse problems scale poorly with image resolution. Wavelet based multilevel strategies can accelerate convergence under strong blur, but their fixed coarse-to-fine schedules lose effectiveness in moderate-blur or noise-dominated regimes. In this work, we propose an adaptive multiresolution block coordinate Forward-Backward algorithm for image restoration. Multiresolution block selection is driven by the local magnitude of the proximal update via a stochastic non-smooth Gauss-Southwell rule applied to the wavelet decomposition of the image. This adaptive selection strategy dynamically balances updates across scales, emphasizing coarse or fine blocks according to the degradation regime. As a result, the proposed method automatically adapts to varying blur and noise levels without relying on a predefined hierarchical update scheme.