Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 11 March

Analysis of PDEs

Local-in-Time Existence of $L^1$ solutions to the Gravity Water Wave Kinetic Equation

In this paper, we study the Cauchy problem for the four-wave kinetic equation describing the weak turbulence of gravity water waves. The mathematical challenges of this analysis stem primarily from two interrelated aspects: (1) the extreme algebraic complexity of the collision kernel, where controlling its growth in the highly non-local regime constitutes the primary analytical bottleneck, and (2) the construction of strong solutions under the resulting singular integral operators. First, we re-analyze the interaction kernel in this precise regime, where the interacting wave numbers satisfy $|k|, |k_3| \gg |k_1|, |k_2|$. We establish a rigorous upper bound of $\mathcal{O}(|k||k_3|)$, which rigorously verifies the asymptotic smallness of the interaction coefficient anticipated in the physics literature \cite{zakharov2010energy, geogjaev2017numerical, geogjaev2025properties}. Furthermore, this result improves upon the recent $\mathcal{O}\big((|k||k_3|)^{3/2}\big)$ estimate proposed in \cite{waterkernel2024}, demonstrating a strictly milder singularity of wave interactions in this limit. Physically, this regime governs the energy exchange between disparate scales, such as the modulation of short gravity waves by long ocean swells. Second, leveraging this crucial integrability gain alongside a refined structural decomposition of the collision operator, we establish the local-in-time existence of $L^1$ strong solutions to the gravity water kinetic equation for initial data in a suitably weighted $L^2 \cap L^\infty$ space. Specifically, we prove that for any initial data in this class, the resulting $L^1$ strong solution strictly propagates the weighted $L^2 \cap L^\infty$ regularity and conserves the fundamental physical properties of the kinetic model.
Read the full abstract

Functional Analysis

Positive Berezin liminf does not imply essential positivity for radial Toeplitz operators on Bergman and Fock spaces

We study whether essential positivity \[ \sigma_{\mathrm{ess}}(T_f)\subset [0,\infty) \] of a radial Toeplitz operator on Bergman and Fock spaces can be detected from the asymptotic behavior of its Berezin transform. For bounded real-valued radial symbols on $A^2(\mathbb{D})$, Perälä and Virtanen conjectured that \[ \liminf_{|z|\to 1^-} \widetilde{f}(z)\ge 0 \] should be equivalent to essential positivity, and they asked the analogous question on Fock space. Such a criterion would turn a spectral question into a scalar asymptotic test. We prove that this fails even in the radial setting in which the conjecture was formulated. For every complex dimension $d\ge 1$, we construct explicit bounded real-valued radial symbols on the Bergman spaces $A^2(\mathbb{B}_d)$ and the Fock spaces $F^2(\mathbb{C}^d)$ whose Berezin transform has strictly positive limit inferior at the boundary (respectively, at infinity), while the essential spectrum of the corresponding Toeplitz operator contains a negative point. In particular, this disproves the Perälä–Virtanen conjecture in its original one-dimensional Bergman form and answers the analogous Fock-space question negatively; more generally, the radial Berezin liminf criterion fails in all dimensions in both settings. The underlying reason is that, for radial symbols, the Toeplitz eigenvalue sequence and the Berezin transform are different asymptotic averages of the same oscillatory symbol, and these averages damp the oscillation by different amounts.
Read the full abstract

Differential Geometry

A conformal lower bound of weighted Dirac eigenvalues on manifolds with boundary

For the weighted Dirac eigenproblem on a compact spin manifold with the chiral boundary condition \begin{equation*} \left\{ \begin{array}{ll} D\varphi = \lambda f\varphi & \text{in } M, \\ \mathbf{B}\varphi = 0 & \text{on } \partial M, \end{array} \right. \end{equation*} we first give a lower bound of the eigenvalue using the relative Yamabe constant \begin{equation*} \lambda^2 \geq \frac{n}{4(n-1)} Y(M,\partial M,[g]), \end{equation*} then prove that equality holds if and only if (up to a conformal transformation) $M$ is a hemisphere and $\varphi$ is a Killing spinor. More generalizations are studied.
Read the full abstract

Numerical Analysis

A Physics-Informed, Global-in-Time Neural Particle Method for the Spatially Homogeneous Landau Equation

We propose a physics-informed neural particle method (PINN–PM) for the spatially homogeneous Landau equation. The method adopts a Lagrangian interacting-particle formulation and jointly parameterizes the time-dependent score and the characteristic flow map with neural networks. Instead of advancing particles through explicit time stepping, the Landau dynamics is enforced via a continuous-time residual defined along particle trajectories. This design removes time-discretization error and yields a mesh-free solver that can be queried at arbitrary times without sequential integration. We establish a rigorous stability analysis in an $L^2_v$ framework. The deviation between learned and exact characteristics is controlled by three interpretable sources: (i) score approximation error, (ii) empirical particle approximation error, and (iii) the physics residual of the neural flow. This trajectory estimate propagates to density reconstruction, where we derive an $L^2_v$ error bound for kernel density estimators combining classical bias–variance terms with a trajectory-induced contribution. Using Hyvarinen's identity, we further relate the oracle score-matching gap to the $L^2_v$ score error and show that the empirical loss concentrates at the Monte Carlo rate, yielding computable a posteriori accuracy certificates. Numerical experiments on analytical benchmarks, including the two- and three-dimensional BKW solutions, as well as reference-free configurations, demonstrate stable transport, preservation of macroscopic invariants, and competitive or improved accuracy compared with time-stepping score-based particle and blob methods while using significantly fewer particles.
Read the full abstract

All authors Minseok Kim, Sung-Jun Son, Yeoneung Kim, Donghyun Lee

Analysis of PDEs

On the global well-posedness and self-similar solutions for a nonlinear elliptic problem with a dynamic boundary condition

We are concerned with a semilinear elliptic equation in the half-space, subject to a nonlinear dynamic boundary condition. We establish the global well-posedness of solutions in a new setting for the problem, namely the framework of Morrey spaces. These are strictly larger than $L^{p}$ and weak-$L^{p}$ spaces, accommodating a broader class of rough initial data, including homogeneous and nondecaying (at infinity) profiles. In our analysis, we consider functional spaces invariant under the natural scaling of the problem, which enables the construction of self-similar solutions. To achieve this, we need to derive key estimates in Morrey spaces for certain interior and boundary operators that arise from the corresponding integral formulation. Furthermore, we obtain some qualitative properties of the solutions, such as positivity, symmetry, and asymptotic stability. Leveraging this last property, we show the existence of self-similar attractor basins and construct a class of solutions that are asymptotically self-similar.
Read the full abstract

Numerical Analysis

Numerical analysis for leaky-integrate-fire networks under Euler-Maruyama

Leaky integrate-and-fire (LIF) networks are standard reduced models for spike-based neural dynamics and a natural substrate for neuromorphic computation. We study time-driven Euler–Maruyama simulation of current-based LIF networks with exponentially decaying synapses and instantaneous resets. Because diffusion acts through the synaptic current rather than directly through the voltage, numerical error is concentrated at threshold events. It is therefore driven by spike-time perturbations and by grid-induced spike-count mismatch. For layered feedforward networks, under suitable density, rate, regularity, and one-step boundary-layer assumptions, we prove finite-horizon strong and weak error bounds. For the strong error, we first condition on spike histories that match up to the observation horizon. On this matched event, we combine a conditional single-spike hitting-time comparison with direct averaging of the induced synaptic-impact kernel against the boundary flux of crossing speeds. This yields matched-trajectory mean-square strong error of order $h$ up to polylogarithmic factors. We then control spike-count mismatch separately by local rate, dense-spike, and spike-time-tail bounds. For weak error, we use an averaged backward-semigroup argument. Assuming a backward transmission problem and one-step rate, strip, and factorial-moment controls for the numerical marginals, we obtain weak order $1$ for smooth spike-map-compatible observables, with constants explicit in rate and weight bounds. We also outline deterministic and noisy recurrent extensions, motivated by a Lyapunov-exponent formula that couples the stationary threshold flux to the reset saltation factor. These results distinguish single-trial spike-train fidelity from observable-level accuracy and clarify which notion of numerical accuracy is most relevant for mechanistic spiking models and spike-based computation.
Read the full abstract

All authors Xu'an Dou, Frank Chen, Kevin K Lin, Zhuo-Cheng Xiao

Combinatorics

New Upper Bounds for the Classical Ramsey Numbers $R(4,4,4)$, $R(3,4,5)$ and $R(3,3,6)$

The inequality \[ R(k_1,\ldots,k_r)\le 2-r+\sum_{i=1}^r R(k_1,\ldots,k_{i-1},k_i-1,k_{i+1},\ldots,k_r) \] is well known, and it is strict whenever the right-hand side and at least one of the terms in the sum are even. Except for two known cases, the best upper bounds for classical Ramsey numbers with at least three colors have so far been obtained from this inequality. In this paper we present new bounds such as $R(4,4,4)\le 229$, $R(3,4,5)\le 157$ and $R(3,3,6)\le 91$.
Read the full abstract

Combinatorics

Adjoints of Morphisms of Neural Codes

A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can be expressed as products of coordinates in the domain. By representing morphisms of codes as binary matrices, we show that any morphism of codes is part of a Galois connection where its adjoint is boolean multiplication by the representative matrix. We use this to characterize those morphisms of codes which allow to factor a boolean matrix, with applications to estimating boolean matrix rank. Morphisms also induce a partial order on (isomorphism classes of) codes. We determine the covering relations in this partial order for which the two adjoint maps are mutual inverses in terms of free neurons, a combinatorial condition on the index corresponding to the covering maps. We introduce the defect of a code as a new tool to study this poset and show that defect decreases by exactly 0 or 1 under a covering map.
Read the full abstract

Geometric Topology

Some link homologies in $ \mathbb{RP}^3 $

We introduce extensions of Khovanov homology and the Lee and Bar-Natan spectral sequences for links in $ \mathbb{RP}^3 $. These extensions are distinct to those previously defined by Asaeda-Przytycki-Sikora (and Gabrovšek's generalization), Chen, and Manolescu-Willis. The new Lee and Bar-Natan theories each yield Rasmussen invariants (that are distinct to one another). The invariant extracted from the new Lee homology is distinct to that defined by Manolescu-Willis; it is unclear if the same is true for the new Bar-Natan homology and that defined by Chen.
Read the full abstract

Information Theory

Offset Pointing for Energy-efficient Reception in Underwater Optical Wireless Communication: Modeling and Performance Analysis

Underwater Wireless Optical Communication is a key enabling technology for future space-air-ground-sea integrated networks. However, UOWC faces critical hurdles from spatial randomness and stringent energy constraints. These challenges fundamentally limit network lifetime and sustainability. This paper develops a comprehensive stochastic geometry framework to perform a differential energy analysis of UOWC links.Instead of relying on simplified models, we employ a three-dimensional truncated Poisson point process to accurately capture the anisotropic nature of the underwater environment, specifically the disparity between horizontal spread and vertical depth. It incorporates a Lambertian emission pattern, random receiver positions and orientations, and a realistic channel model with extinction effects. Under this model, we derive a full suite of closed-form expressions for key performance indicators. These include the nearest-neighbor distance distribution, expected received power, SNR, and BER. A principal and counter-intuitive finding of our analysis is an offset-pointing strategy. This strategy involves intentionally misaligning the receiver by a deterministically optimal angle. This approach maximizes the integrated received power across the aperture, contrary to the conventional pursuit of perfect alignment. We formulate and solve an energy-efficiency optimization problem. Our results demonstrate that this strategy enhances system robustness and yields substantial performance gains. Simulation results validate our analytical models. They show that the optimal offset strategy can reduce the required transmit power by nearly 20% to achieve a target BER. This reduction directly translates into extended network lifetime and higher total data throughput. These findings offer a new design paradigm for deploying robust, cost-effective, and sustainable UOWC networks.
Read the full abstract

Complex Variables

Strong Regularity and Microsupport Estimates for Multi-Microlocalizations of Subanalytic Sheaves

We introduce the notion of strong regularity for subanalytic sheaves and establish estimates for the supports and microsupports of their multi-microlocalizations. As applications, we study subanalytic sheaves of Whit- ney and temperate holomorphic solutions of regular D-modules along an involutive subbundle. In this setting we prove initial value theorems for multi-microlocal objects with growth conditions and division theorems for temperate and Whitney multi-microfunctions. As a consequence, we obtain a multi-microlocal version of Bochner's tube theorem for solution sheaves of strongly asymptotically developable functions.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Generalised Complex and Spinor Relations

Courant algebroid relations are used to define notions of relations between Dirac structures and spinors. It is shown under which circumstances a spinor relation gives a Courant algebroid relation and how it descends to a relation between Dirac structures. A converse to this result is proved: a T-duality relation induces a spinor relation that links the Dirac generating operators defining T-dual Courant algebroids, generalising the isomorphism of twisted cohomology associated with topological T-duality. We introduce the notion of relation between generalised complex structures and characterise their reduction. We also define relations between generalised Kähler structures, and rephrase them in terms of bi-Hermitian structures which induce T-duality relations between $\mathcal{N}=(2,2)$ supersymmetric sigma-models. We prove existence results for T-dual structures, and demonstrate compatibility of T-duality relations with Type II supergravity equations.
Read the full abstract

Combinatorics

Combinatorial perspectives on identities for partitions with distinct even parts

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored partitions, thereby obtaining several partition identities. We construct bijective proofs for each of our results. Furthermore, these bijections will partially answer the combinatorial problems posed by Andrews-El Bachraoui and K$\imath$l$\imath$ç-Kurşungöz. respectively.
Read the full abstract

Spectral Theory

Spectral deviation of concentration operators on reproducing kernel Hilbert spaces

We study the eigenvalue profile of concentration operators (multiplication by an indicator function followed by projection) acting on reproducing kernel Hilbert spaces. The spectral profile of such operators provides a useful notion of local degrees of freedom. We formalize this idea by estimating the number of eigenvalues that lie away from 0 and 1, commonly referred to as the plunge region. Our main motivation is to treat discrete and continuous settings simultaneously and uniformly, and to be able to argue that approximations arising from discretization schemes reflect, in a non-asymptotic sense, the spectral profile of their continuous counterparts. As a case in point, we show that Gabor multipliers computed on sufficiently fine grids obey spectral deviation estimates similar to those available for the short-time Fourier transform (STFT) with bounds that are uniform in the discretization step. Concretely, this means that the theoretical localization properties of the STFT are observable in practice.
Read the full abstract

All authors Felipe Marceca, José Luis Romero, Michael Speckbacher, Lisa Valentini

Optimization and Control

Distributed Stability Certification and Control from Local Data

Most data-driven analysis and control methods rely on centralized access to system measurements. In contrast, we consider a setting in which the measurements are distributed across multiple agents and raw data are not shared. Each agent has access only to locally held samples, possibly as little as a single measurement, and agents exchange only locally computed signals. Consequently, no individual agent possesses sufficient information to identify the entire system or synthesize a controller independently. To address this limitation, we develop distributed dynamical algorithms that enable the agents to collectively compute global system certificates from local data. Two problems are addressed. First, for stable linear time-invariant (LTI) systems, the agents compute a Lyapunov certificate by solving the Lyapunov equation in a fully distributed manner. Second, for general LTI systems, they compute the stabilizing solution of the algebraic Riccati equation and hence the optimal linear-quadratic regulator (LQR). An initially proposed scheme guarantees practical convergence, while a subsequent augmented PI-type algorithm achieves exact convergence to the desired solution. We further establish robustness of the resulting LQR controller to uncertainty and measurement noise. The approach is illustrated through distributed Lyapunov certification of a quadruple-tank process and distributed LQR design for helicopter dynamics.
Read the full abstract

Commutative Algebra

On the ubiquity of uniformly dominant local rings

Let R be a d-dimensional Cohen-Macaulay complete local ring with infinite residue field k. The dominant index $\operatorname{dx}(R)$ is by definition the least number of extensions necessary to build k in the singularity category $\operatorname{D^{sg}}$ out of each nonzero object, up to finite direct sums, direct summands and shifts. The local ring R is called uniformly dominant if $\operatorname{dx}(R)$ is finite. In this paper, we prove that R is uniformly dominant with $\operatorname{dx}(R)\le6d+5$ if R has codimension 2 and is not a complete intersection. Also, we show that R is uniformly dominant with $\operatorname{dx}(R)\le d+1$ if R is Burch, and with $\operatorname{dx}(R)\le d$ if R is either a quasi-fiber product ring, or has multiplicity at most 5 and is not Gorenstein. A result on hypersurfaces by Ballard, Favero and Katzarkov is recovered, and results on Burch rings and quasi-fiber product rings by Takahashi are refined.
Read the full abstract

Analysis of PDEs

Polyhomogeneous mapping properties of the Radon transform and backprojection operator on the unit ball

This article covers polyhomogeneous mapping properties of the Radon transform $R$ of smooth functions on the open unit ball $\Omega\subset\mathbb{R}^n$ and the back-projection operator $R^*$ on $Z=(-1,1)\times S^{n-1}\subset\mathbb{R}\times S^{n-1}$. We construct a double $b$-fibration which desingularizes the point-hyperplane relation of $\overline{\Omega}$ as the total space of a fibration over $\overline{Z}$. We provide formulas for $R$ and $R^*$ in operations generated by the associated $b$-fibrations and sharper estimates on the polyhomogeneous mapping properties of $R$ and $R^*$ compared to classic estimates using classic Mellin functional techniques. We include a discussion of a one (complex) parameter family of normal operators associated to $R$ mapping $C^{\infty}(\overline{\Omega})$ to itself.
Read the full abstract

Commutative Algebra

On Integral Domains with Prime Divisor Finite Property

An integral domain $D$ is called a prime-divisor-finite domain (PDF-domain) if every nonzero element has only finitely many nonassociate prime divisors. A domain $D$ is said to be a tightly prime-divisor-finite domain (TPDF-domain) if it is a PDF-domain and every nonzero nonunit element admits at least one prime divisor. In this paper, we study TPDF-domains. We investigate some basic properties of these domains and examine the behavior of the TPDF property under standard constructions such as localization, $D+M$ constructions, and polynomial rings.
Read the full abstract

Analysis of PDEs

Liouville theorem for fully nonlinear elliptic equations with the small oscillation and the periodicity in $x$ and the periodic right hand term

In this paper, we study quadratic growth solutions $u$ of fully nonlinear elliptic equations of the form $F(D^2u,x)=f$ in $\mathbb{R}^n$, where $f$ is periodic and $F$ has the periodicity in $x$. Under the assumption that the oscillation of $F(M,x)$ in $x$ is “small", we establish the existence and Liouville type results for quadratic growth solutions, which can be expressed into the sum of a quadratic polynomial and a periodic function. Consequently, these results are generalization of the existing results for linear elliptic equations $a_{ij}D_{ij}u=0$ and fully nonlinear elliptic equations $F(D^2u)=f$ with the periodic data.
Read the full abstract

Analysis of PDEs

The asymptotic behavior for divergence elliptic equations in exterior domains with periodic coefficients

In this paper, we investigate the asymptotic behavior of solutions for divergence linear elliptic equations in exterior domains with periodic coefficients. Consequently, we generalise the Liouville type result firstly established by Avellaneda and Lin.

Dynamical Systems · Cross-listed from cs.LG

Dynamics-Informed Deep Learning for Predicting Extreme Events

Predicting extreme events in high-dimensional chaotic dynamical systems remains a fundamental challenge, as such events are rare, intermittent, and arise from transient dynamical mechanisms that are difficult to infer from limited observations. Accordingly, real-time forecasting calls for precursors that encode the mechanisms driving extremes, rather than relying solely on statistical associations. We propose a fully data-driven framework for long-lead prediction of extreme events that constructs interpretable, mechanism-aware precursors by explicitly tracking transient instabilities preceding event onset. The approach leverages a reduced-order formulation to compute finite-time Lyapunov exponent (FTLE)-like precursors directly from state snapshots, without requiring knowledge of the governing equations. To avoid the prohibitive computational cost of classical FTLE computation, instability growth is evaluated in an adaptively evolving low-dimensional subspace spanned by Optimal Time-Dependent (OTD) modes, enabling efficient identification of transiently amplifying directions. These precursors are then provided as input to a Transformer-based model, enabling forecast of extreme event observables. We demonstrate the framework on Kolmogorov flow, a canonical model of intermittent turbulence. The results show that explicitly encoding transient instability mechanisms substantially extends practical prediction horizons compared to baseline observable-based approaches.
Read the full abstract

Information Theory

A Disguise-and-Squeeze PIR Scheme for the MDS-TPIR Setting and Beyond

We consider the problem of private information retrieval (PIR) from MDS coded databases with colluding servers, i.e., MDS-TPIR. In the MDS-TPIR setting, $M$ files are stored across $N$ servers, where each file is stored independently using an $(N,K)$-MDS code. A user wants to retrieve one file without disclosing the index of the desired file to any set of up to $T$ colluding servers. The general problem in studying PIR schemes is to maximize the PIR rate, defined as the ratio of the size of the desired file to the size of the total download. Freij-Hollanti et al. proposed a conjecture of the MDS-TPIR capacity (the maximum achievable PIR rate), which was later disproved by Sun and Jafar by a counterexample with $(M,N,T,K)=(2,4,2,2)$. In this paper, we propose a new MDS-TPIR scheme based on a disguise-and-squeeze approach. The features of our scheme include the following. Our scheme generalizes the Sun-Jafar counterexample to $(M,N,T,K)=(2,N,2,K)$ with $N\geq K+2$ for an arbitrary $(N,K)$-MDS coded system, providing more counterexamples to the conjecture by Freij-Hollanti et al. For $(M,N,T,K)=(2,N,2,K)$ and a GRS (generalized Reed-Solomon codes) coded system, our scheme has rate $\frac{N^2-N}{N^2+KN-2K}$, beating the state-of-the-art results. We further show that this rate achieves the linear MDS-TPIR capacity when $K=2$. Our scheme features a significantly smaller field size for implementation and the adaptiveness to generalized PIR models such as multi-file MDS-TPIR and MDS-PIR against cyclically adjacent colluding servers. Lastly, we provide an $\epsilon$-error MDS-TPIR scheme for $T\geq 3$ based on the disguise-and-squeeze framework.
Read the full abstract

All authors Rui Sun, Ran Tao, Jingke Xu, Yiwei Zhang

Combinatorics

Extremal problems in uniformly dense hypergraphs and digraphs

The uniform Turán density $\pi_{u}(F)$ of a $3$-uniform hypergraph (or $3$-graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$-free $3$-graphs $H$ in which every induced subhypergraph on a linearly sized vertex set has edge density at least $d$. Determining $\pi_{u}(F)$ for a given $3$-graph $F$ was proposed by Erdős and Sós in the 1980s, yet only a few cases are known. In particular, it remains open whether $1/2$ can occur as a value of $\pi_{u}$. In this paper, we establish a novel connection between Turán-type extremal problems for digraphs and uniform Turán densities of $3$-graphs. Using digraph extremal results, we give the first verifiable conditions for $3$-graphs $F$ with $\pi_{u}(F) = (r-1)/r$ and $\pi_{u}(F) = (r-1)^2/r^2$ for all $r \ge 2$, and identify the corresponding $3$-graphs. In particular, these $3$-graph classes contain some specific $3$-graphs, such as $K^{(3)-}_4$. We also present a sufficient condition ensuring $\pi_{u}(F)=4/27$ and construct $3$-graphs satisfying it; in particular, our examples are different from the tight $3$-uniform cycles whose uniform Turán density $4/27$ was determined in [{Trans. Amer. Math. Soc. 376 (2023), 4765-4809}]. Finally, we give a short proof of the existence of $3$-graphs $F$ with $\pi_{u}(F)=1/27$, originally established by Garbe, Král' and Lamaison [{Israel J. Math. 259 (2024), 701-726}] via the hypergraph regularity method.
Read the full abstract

All authors Hao Lin, Guanghui Wang, Wenling Zhou, Yiming Zhou

Information Theory · Cross-listed from cs.LG

Prioritizing Gradient Sign Over Modulus: An Importance-Aware Framework for Wireless Federated Learning

Wireless federated learning (FL) facilitates collaborative training of artificial intelligence (AI) models to support ubiquitous intelligent applications at the wireless edge. However, the inherent constraints of limited wireless resources inevitably lead to unreliable communication, which poses a significant challenge to wireless FL. To overcome this challenge, we propose Sign-Prioritized FL (SP-FL), a novel framework that improves wireless FL by prioritizing the transmission of important gradient information through uneven resource allocation. Specifically, recognizing the importance of descent direction in model updating, we transmit gradient signs in individual packets and allow their reuse for gradient descent if the remaining gradient modulus cannot be correctly recovered. To further improve the reliability of transmission of important information, we formulate a hierarchical resource allocation problem based on the importance disparity at both the packet and device levels, optimizing bandwidth allocation across multiple devices and power allocation between sign and modulus packets. To make the problem tractable, the one-step convergence behavior of SP-FL, which characterizes data importance at both levels in an explicit form, is analyzed. We then propose an alternating optimization algorithm to solve this problem using the Newton-Raphson method and successive convex approximation (SCA). Simulation results confirm the superiority of SP-FL, especially in resource-constrained scenarios, demonstrating up to 9.96% higher testing accuracy on the CIFAR-10 dataset compared to existing methods.
Read the full abstract

All authors Yiyang Yue, Jiacheng Yao, Wei Xu, Zhaohui Yang, George K. Karagiannidis, Dusit Niyato

Mathematical Physics

From path integral quantization to stochastic quantization: a pedestrian's journey

We give two novel proofs that the path integral and stochastic quantizations of generic scalar Euclidean quantum field theories are equivalent. Our proofs rely on Taylor interpolations indexed by forests, in the fashion of constructive field theory. The first proof works at the level of individual terms in the Feynman expansion, with the forests appearing as spanning forests in Feynman graphs. The second one works at the level of the path integral and avoids the full expansion of the Feynman perturbation series.
Read the full abstract

Group Theory

An antichain condition for infinite groups

Let $\chi$ be a subgroup-theoretical property. We introduce an antichain condition $\operatorname{ac}_\chi$ which forbids the existence of infinite antichains of mutually permutable non-$\chi$ subgroups whose infinite joins remain non-$\chi$. This is a ”width” analogue of the real chain condition on non-$\chi$ subgroups, and it extends the usual hierarchy of weak chain conditions (double chain condition, deviation, and $\operatorname{RCC}$). Our main results show that, within the universe of generalized radical groups, the antichain condition is as rigid as the corresponding chain conditions. For the properties $\chi$ of normality, almost normality, near normality, permutability, modularity, and pronormality, we prove that a generalized radical group satisfies $\operatorname{ac}_\chi$ if and only if it satisfies $\operatorname{RCC}$ on non-$\chi$ subgroups; equivalently, it satisfies any of the standard weak chain conditions on non-$\chi$ subgroups. In particular, we obtain minimax-type dichotomies: either the group is minimax, or every subgroup satisfies $\chi$. This yields characterizations in terms of Dedekind groups, quasi-Hamiltonian groups, groups with modular subgroup lattice, and $\overline{T}$-groups. In the pronormal case, one has to deal with locally finite simple groups and a use of the Classification of Finite Simple Groups seems unavoidable.
Read the full abstract

Numerical Analysis

On the consistency of the Domain of Dependence cut cell stabilization

So called cartesian cut cell meshes provide efficient ways to generate meshes but do require tailored numerical methods to not suffer from stabilization issues, especially in the hyperbolic regime where the application of explicit time stepping schemes is common. In this scenario, due to potentially arbitrarily small cut cells, an infeasible restriction is imposed on the time step size. The Domain of Dependence (DoD) stabilization allows for a time step size based on the underlying Cartesian mesh. Being an extension of a discontinuous Galerkin (DG) method, one would expect similar accuracy properties as in the pure DG case. While numerical results do support this expectation, on the analytical level this has only been investigated thoroughly for $k=0$. Error analysis typically hinges on a consistency result. In this contribution we prove such a result for the DoD stabilization given an arbitrary polynomial degree and an exact solution of sufficient regularity. This in turn could open the way towards a more refined analysis of the method even in the high-order case.
Read the full abstract

All authors Gunnar Birke, Christian Engwer, Jan Giesselmann, Sandra May

Information Theory

Deep Randomized Distributed Function Computation (DeepRDFC): Neural Distributed Channel Simulation

The randomized distributed function computation (RDFC) framework, which unifies many cutting-edge distributed computation and learning applications, is considered. An autoencoder (AE) architecture is proposed to minimize the total variation distance between the probability distribution simulated by the AE outputs and an unknown target distribution, using only data samples. We illustrate significantly high RDFC performance with communication load gains from our AEs compared to data compression methods. Our designs establish deep learning-based RDFC methods and aim to facilitate the use of RDFC methods, especially when the amount of common randomness is limited and strong function computation guarantees are required.
Read the full abstract

Number Theory

Toroidal families and averages of $L$-functions, II: cubic moments

Generalizing our previous work on “toroidal averages”, we study the average of special values of $L$-functions of the form $L(1/2,\chi^a)L(1/2,\chi^b)L(1/2,\chi^c)$ for integers $a$, $b$ and $c$, where $\chi$ varies over Dirichlet characters of a given prime modulus. We highlight connections with estimates for bilinear forms of trace functions and with bounds for the number of solutions of monoidal equations in three variables in small boxes over finite fields.
Read the full abstract

All authors Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, Will Sawin

Numerical Analysis

Efficient Fine-Scale Simulation of Nonlinear Hyperelastic Lattice Structures

With the growing maturity of additive manufacturing, the fabrication of architected or lattice-based metamaterials has become a reality for industrial applications. These materials combine lightweight design with tailored mechanical properties, most of which exhibit pronounced nonlinear, especially large-deformation, behaviors. The main numerical challenge therefore lies in performing nonlinear simulations of such lattice structures, which may contain thousands of geometrically intricate unit cells, while lacking sufficient scale separation for multiscale homogenization schemes to be applicable straightforwardly. In this work, we propose a dedicated solver for the full volumetric fine-scale simulation of nonlinear hyperelastic lattice structures that drastically reduces both memory and computational costs. The key idea is to exploit the intrinsic self-similarity of the cells through a reduced-order modeling strategy applied within a domain-decomposition framework. At each Newton iteration, a limited set of principal cells is identified through a dedicated, weakly intrusive, EIM-like approach, allowing all local tangent operators to be expressed as linear combinations of a few principal ones. This enables fast and memory-efficient operator assembly, and then feeds an efficient inexact FETI-DP based preconditioner at the solution stage, resulting in a quasi matrix-free algorithm for the nonlinear analysis. Numerical experiments in two and three dimensions demonstrate significant computational gains, with runtime reductions from several hours to a few tens of minutes and memory savings by factors of about three, while maintaining full fine-scale accuracy. Notably, the proposed strategy enables the computation of problems involving thousands of cells (i.e., millions of degrees of freedom) within a few minutes on an off-the-shelf laptop.
Read the full abstract

All authors Clément Guillet, Thibaut Hirschler, Pierre Jolivet, Pablo Antolin, Robin Bouclier