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 23 March

Combinatorics

On Coprime-Preserving Transformations and Dynamic Coprime Labeling

In this paper, we introduce dynamic coprime labeling (DCL), a novel extension of coprime labeling for time-sensitive networks. In particular, we explore whether there exists a graph labeling scheme that maintains relative coprimality among adjacent vertices as the graph evolves over time. We extend the definition of coprime labeling to include an injective labeling function, a time variable, and a transformation function. A DCL on a finite simple graph is a sequence of injective vertex labelings with the property that every edge is labeled by coprime integers at each time step, and the evolution is given by a time-independent coprime-preserving transformation. We prove that a graph admits a DCL if and only if it admits a classical coprime labeling (existence equivalence). We characterize families of coprime-preserving transformations and provide proofs of the existence of DCLs for paths, wheels, cycles, and the $n$-hypercube. We also introduce two classes of coprime-preserving transformations and present an application of DCL to Carmichael's theorem. These results establish DCL as a rigorous framework for further algorithmic and applied investigations.
Read the full abstract

General Mathematics

Axial Morphology of the Partition Graph: Self-Conjugate Axis, Spine, and Concentration

We study the partition graph $G_n$, whose vertices are the partitions of $n$ and whose edges correspond to elementary unit transfers between parts. We define the self-conjugate axis, its distance neighborhoods, and the thin spine, a first off-axis layer built from common neighbors of distinct axial vertices. We prove that distinct self-conjugate vertices are never adjacent, that the thin spine is a conjugation-invariant induced subgraph, and that axial and spinal concentration radii differ by at most one. Computations for $1 \le n \le 30$ show that the main local invariants are maximized near the axis and the spine.
Read the full abstract

Number Theory

Density of Visible Lattice Points on Hyperplanes and their Intersections

A lattice point $\vec x=(x_1,\dots,x_n)\in\mathbb Z^{n}$ is said to be visible if the line segment between $\vec x$ and the origin contains no other lattice point. In this paper, we compute the asymptotic density of visible lattice points on hyperplanes and their intersections. In particular, we show that the hyperplane $\vec a \cdot \vec x = b$ in $\mathbb R^{n}$ has visible point density $J_{n-1}(b)/b^{n-1}$ where $J$ is the Jordan totient function. We extend this basic result to find the density of visible points on the intersection of hyperplanes and to the density of $k$-th power free points. Finally, for a fixed dimension $n$, we consider the closure of the set of all possible densities that occur.
Read the full abstract

Geometric Topology

Detecting embedded surfaces using finite quotients

We give conditions on a Haken hyperbolic rational homology three sphere that imply that any other 3-manifold with profinitely equivalent fundamental group must also be Haken. In the appendix, we show that a regular finite-sheeted cover of an aspherical integral homology three-sphere with positive first Betti number must have first Betti number at least four. We also show that this lower bound is sharp.
Read the full abstract

Probability

Convex bounds for last passage percolation with dependent identically distributed weights

On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths connecting the two. Point-to-line LPP time $R_N$ is the maximum of these maximal total weights over $M$. Asymptotic distributions and fluctuations of these LPP times have been studied for i.i.d. weights. The current study deals with identically distributed but not necessarily independent weights, and maximizes LPP times in the sense of increasing convex dominance. In particular, maximal expected LPP times are identified, in the class of all weight couplings with a given marginal distribution. For the case of mean-$1$ exponentially distributed weights, there is a coupling for which $R_N$ is the shifted exponential variable $R_N^* = N W(1,1) + \log(N!)$, such that $E[\Psi(R_N)] \le E[\Psi(R_N^*)]$ for all couplings and all convex non-decreasing functions $\Psi$ for which these expectations are well defined. In contrast to ${{R_N^*} \over N}= W(1,1)+{{\log(N!)} \over N}$, with variance $1$ and mean diverging to $\infty$ like $\log(N)$, ${{R_N} \over N}$ converges a.s. to $2$ for the commonly studied i.i.d. weights. As for small LPP, expected LPP time is at least $NE[W(1,1)]$, attained by assigning to each anti-diagonal identical weights. The minimal possible variance of $R_N$ is asymptotically zero for exponential weights.
Read the full abstract

Numerical Analysis

Continuous-data-assimilation-enabled fast and robust convergence of an Uzawa-based solver for Navier-Stokes equations with large Reynolds number

This paper shows how continuous data assimilation (CDA) can be used to provably enable and accelerate convergence of a (efficient at each iteration due to a physics-splitting, but generally slowly converging and not robust) nonlinear solver for incompressible Navier-Stokes equations (NSE). Herein we develop, analyze and test an Uzawa-based nonlinear solver for incompressible NSE that incorporates partial solution data into the iteration through continuous data assimilation (CDA-Uzawa). We rigorously prove that i) CDA-Uzawa will accelerate a converging Uzawa iteration, and more partial solution data yields more acceleration, and ii) with enough partial solution data CDA-Uzawa will converge for arbitrarily large Reynolds numbers, even if multiple NSE solutions exist. In the case of noisy data, we prove that the convergence results hold down to the size of the noise, and we propose a strategy to pass to Newton once CDA-Uzawa convergence reaches its lower limit. Results of several numerical tests illustrate the theory and show CDA-Uzawa is a very effective and efficient solver. While this paper focuses a particular splitting-based solver for the NSE, the key ideas are quite general and extendable to a wide class of nonlinear solvers.
Read the full abstract

Group Theory

How Many Reflections Make a Dihedral Set Large?

Given a size-$k$ subset $S$ of a group $G$, how large can the product set $S^n$ be? We study this question, at several layers of refinement, for the infinite dihedral group. First, we give an explicit formula for the maximum size of $S^n$ among all size-$k$ subsets with a prescribed number of reflections. We then determine the optimal number of reflections that a size-$k$ set should contain in order to maximize $|S^n|$. When $k$ is fixed and $n\to\infty$, we obtain a clean asymptotic expression for the maximal size of $S^n$. Moreover, we compute this asymptotic separately for each fixed number of reflections in $S$. We show that the number of reflections influences the asymptotic size of $S^n$ only through a multiplicative coefficient, which admits a direct probabilistic interpretation. Finally, we compute the growth exponent of the maximum of $|S^n|$ when~$k=~n$.
Read the full abstract

All authors Be'eri Greenfeld, George King, Xiaoxuan Li, Sam Tacheny

Complex Variables

Contraction properties for holomorphic functions via isoperimetric stability on the Bergman ball

We prove a local contraction property for holomorphic functions that are nearly constant, relating weighted Bergman spaces $A^p_\alpha(\B_n)$ and $A^q_\beta(\B_n)$. Our approach converts geometric information on weighted superlevel sets into analytic deficit inequalities and rests crucially on a quantitative stability result (of Fuglede type) for the isoperimetric inequality in the Bergman ball. As an application, along the contractive line $q/p=\beta/\alpha$, we obtain a deficit contraction near the extremizer $f\equiv 1$: if $f=1+\phi$ with $\phi$ small and its weighted level sets are nearly spherical (after recentering), then the $A^q_\beta$-deficit is controlled by the $A^p_\alpha$-deficit, and the same deficit quantitatively controls the deviation of the level sets from spheres.
Read the full abstract

Mathematical Physics

Spectral topology and edge modes for one-dimensional non-Hermitian photonic crystals

This work investigates edge modes in non-Hermitian photonic crystals with broken spectral reciprocity. In such systems, the spectra of the underlying operators generally form closed loops over the complex plane with nontrivial spectral topology, which gives rise to the so-called skin effect characterized by edge modes localized at interfaces. For discrete lattice models, the skin effect can be understood through the spectral theory of Toeplitz matrices. However, this mathematical framework no longer applies to continuous wave models, where finite-dimensional approximations break down. In this work, we employ a transfer matrix approach to describe wave propagation in one-dimensional periodic media and introduce a new spectral topological invariant based on the eigenvalues of the transfer matrix. The new topological invariant is equivalent to the winding number of the non-Hermitian spectrum and it enables the characterization of edge modes in one-dimensional non-Hermitian photonic crystals. The mathematical theory provides the theoretical foundation for the skin effect in continuous wave models.
Read the full abstract

Information Theory

Communication-Efficient Approximate Gradient Coding

Large-scale distributed learning aims at minimizing a loss function $L$ that depends on a training dataset with respect to a $d$-length parameter vector. The distributed cluster typically consists of a parameter server (PS) and multiple workers. Gradient coding is a technique that makes the learning process resilient to straggling workers. It introduces redundancy within the assignment of data points to the workers and uses coding theoretic ideas so that the PS can recover $\nabla L$ exactly or approximately, even in the presence of stragglers. Communication-efficient gradient coding allows the workers to communicate vectors of length smaller than $d$ to the PS, thus reducing the communication time. While there have been schemes that address the exact recovery of $\nabla L$ within communication-efficient gradient coding, to the best of our knowledge the approximate variant has not been considered in a systematic manner. In this work we present constructions of communication-efficient approximate gradient coding schemes. Our schemes use structured matrices that arise from bipartite graphs, combinatorial designs and strongly regular graphs, along with randomization and algebraic constraints. We derive analytical upper bounds on the approximation error of our schemes that are tight in certain cases. Moreover, we derive a corresponding worst-case lower bound on the approximation error of any scheme. For a large class of our methods, under reasonable probabilistic worker failure models, we show that the expected value of the computed gradient equals the true gradient. This in turn allows us to prove that the learning algorithm converges to a stationary point over the iterations. Numerical experiments corroborate our theoretical findings.
Read the full abstract

Logic

The Reverse Mathematics of Analytic Measurability

A classical theorem of Lusin states that all analytic sets are Lebesgue-measurable. In this article we established the reverse mathematical strength of Lusin's theorem, which depends on how precisely it is formalized. By doing so, we answer to a question of Simpson. Our main proof is motivated towards proving a specific version of that result, namely that analytic sets are Lesbesgue-regular, which requires the equality of the outer and inner measures of the set in question. We prove this statement to be equivalent to $\Sigma^{1}_{1}$-$\mathrm{IND}$ over $\mathrm{ATR}_{0}$. The full statement of the theorem, that is the one implying the existence of the measure as a real number, is equivalent to $\Pi^{1}_{1}$-$\mathrm{CA}_{0}$, again provably over $\mathrm{ATR}_{0}$. In our main proof, we draw inspiration from Solovay's construction of a model of Zermelo-Fraenkel set theory where every set is Lebesgue measurable. In our case the argument requires the use of class forcing over a family of standard and non-standard models of a very weak set theory obtained through the method of pseudohierarchies.
Read the full abstract

Functional Analysis

A twisted Hilbert space not isomorphic to its dual

We show: 1) The existence of the first twisted Hilbert space that is not isomorphic to its dual; this solves a problem posed by Cabello in [Nonlinear centralizers in homology, Math. Ann. 358 (2014), no. 3-4, 779-798]. 2) The existence of a large coneable family of relatively incomparable such examples, improving the coneable family obtained in [W.H. Corrêa, S. Dantas, D.L. Rodríguez-Vidanes, Twisted Hilbert spaces defined by Lipschitz embeddings, Israel J. of Mathematics, to appear]. 3) The existence of quasilinear maps between Hilbert spaces not isomorphic to Kalton centralizers; which solves another question of Cabello. 4) The existence of a large family of mutually incomparable elements in the ordered set of twisted Hilbert exact sequences. This complements earlier results in [J.M.F. Castillo, W. Cuellar, V. Ferenczi, Y. Moreno, Complex structures on twisted Hilbert spaces, Israel J. Math. 222 (2017) 787-814] – where it was proved that the ordered set did not have a first element – and [F. Cabello Sánchez, J.M.F. Castillo, W.H.G. Corrêa, V. Ferenczi, R. García, On the $Ext^2$-problem in Hilbert spaces, J. Funct. Anal. 280 (2021) 108863] – where two incomparable elements were obtained.
Read the full abstract

Number Theory

Anticyclotomic Iwasawa main conjectures for modular forms

Let $f$ be a newform of even weight at least $4$, level $N$ and trivial character. Let $p\nmid N$ be an odd prime number that is ordinary for $f$ and let $K$ be an imaginary quadratic field satisfying a generalized Heegner hypothesis relative to $N$. In this paper, we prove (under mild arithmetic assumptions) Iwasawa main conjectures for $f$ over the anticyclotomic $\mathbb Z_p$-extension of $K$ both in the definite setting and in the indefinite setting (in the second case, we prove a main conjecture à la Perrin-Riou for modular forms). Our strategy of proof follows the approach of Bertolini-Darmon via congruences combined with our previous results on an analogue for $f$ of Kolyvagin's conjecture on the non-triviality of his $p$-adic system of derived Heegner points on elliptic curves. As a second contribution, when $p$ splits in $K$ we prove an Iwasawa-Greenberg main conjecture for the $p$-adic $L$-functions of Bertolini-Darmon-Prasanna and Brooks.
Read the full abstract

Analysis of PDEs

Traveling Waves for Nonlocal Derivative Nonlinear Schrödinger Equations: A Variational Characterization

We establish several existence results for traveling-wave solutions of the nonlocal derivative nonlinear Schrödinger equation with general coefficients by variational methods. We study associated minimization problems in the subcritical and critical cases and prove the existence of a minimizer in each case. Finally, we derive Pohozaev-type identities and use them to establish corresponding nonexistence results.
Read the full abstract

Optimization and Control

Cognitive Training for Language Models: Towards General Capabilities via Cross-Entropy Games

Defining a constructive process to build general capabilities for language models in an automatic manner is considered an open problem in artificial intelligence. Towards this, we consider the problem of building a curriculum of tasks that grows a model via relevant skill discovery. We provide a concrete framework for this task, using a family of tasks called Cross-Entropy Games, which we postulate is universal in a suitable sense. We show that if it is possible to grow the curriculum for relevant skill discovery by iterating a greedy optimization algorithm, then, under natural assumptions, there is essentially only one meta-objective possible (up to a few hyper-parameters). We call the resulting process cognitive training. We postulate that, given sufficiently capable language models as players and meta-samplers, cognitive training provides a principled way to relevant skill discovery; and hence to the extent general capabilities are achievable via greedy curriculum learning, cognitive training would be a solution.
Read the full abstract

All authors Clément Hongler, Franck Gabriel, Valentin Hartmann, Arthur Renard, Andrew Emil

Mathematical Physics

Multivariable Painleve'-II equation: connection formulas for asymptotic solutions

For an integrable generalization of the Painleve'-II equation (P-II) to a system of coupled equations with symmetry breaking terms, an asymptotically exact WKB analysis is applied to obtain connection formulas for solutions at different infinities. The analysis relies on an exact solution of the quantum mechanical Demkov–Osherov model (DOM), revealing a possible deeper relation between classical integrable systems and solvable multistate Landau–Zener models. An application of the connection formulas to the problem of unstable vacuum decay during a second-order phase transition provides precise scaling of the number of excitations, including subdominant contributions.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Stability-Preserving Online Adaptation of Neural Closed-loop Maps

The growing complexity of modern control tasks calls for controllers that can react online as objectives and disturbances change, while preserving closed-loop stability. Recent approaches for improving the performance of nonlinear systems while preserving closed-loop stability rely on time-invariant recurrent neural-network controllers, but offer no principled way to update the controller during operation. Most importantly, switching from one stabilizing policy to another can itself destabilize the closed-loop. We address this problem by introducing a stability-preserving update mechanism for nonlinear, neural-network-based controllers. Each controller is modeled as a causal operator with bounded $\ell_p$-gain, and we derive gain-based conditions under which the controller may be updated online. These conditions yield two practical update schemes, time-scheduled and state-triggered, that guarantee the closed-loop remains $\ell_p$-stable after any number of updates. Our analysis further shows that stability is decoupled from controller optimality, allowing approximate or early-stopped controller synthesis. We demonstrate the approach on nonlinear systems with time-varying objectives and disturbances, and show consistent performance improvements over static and naive online baselines while guaranteeing stability.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

SPDE Methods for Nonparametric Bayesian Posterior Contraction and Laplace Approximation

We derive posterior contraction rates (PCRs) and finite-sample Bernstein von Mises (BvM) results for non-parametric Bayesian models by extending the diffusion-based framework of Mou et al. (2024) to the infinite-dimensional setting. The posterior is represented as the invariant measure of a Langevin stochastic partial differential equation (SPDE) on a separable Hilbert space, which allows us to control posterior moments and obtain non-asymptotic concentration rates in Hilbert norms under various likelihood curvature and regularity conditions. We also establish a quantitative Laplace approximation for the posterior. The theory is illustrated in a nonparametric linear Gaussian inverse problem.
Read the full abstract

Information Theory · Cross-listed from cs.LG

A Theoretical Framework for Energy-Aware Gradient Pruning in Federated Learning

Federated Learning (FL) is constrained by the communication and energy limitations of decentralized edge devices. While gradient sparsification via Top-K magnitude pruning effectively reduces the communication payload, it remains inherently energy-agnostic. It assumes all parameter updates incur identical downstream transmission and memory-update costs, ignoring hardware realities. We formalize the pruning process as an energy-constrained projection problem that accounts for the hardware-level disparities between memory-intensive and compute-efficient operations during the post-backpropagation phase. We propose Cost-Weighted Magnitude Pruning (CWMP), a selection rule that prioritizes parameter updates based on their magnitude relative to their physical cost. We demonstrate that CWMP is the optimal greedy solution to this constrained projection and provide a probabilistic analysis of its global energy efficiency. Numerical results on a non-IID CIFAR-10 benchmark show that CWMP consistently establishes a superior performance-energy Pareto frontier compared to the Top-K baseline.
Read the full abstract

Analysis of PDEs

Kazdan-Warner obstructions for a 4$th-$order boundary problem

We derive Kazdan-Warner type identities for the boundary problem of prescribing nonconstant interior $Q$ curvature and boundary $T$ curvature on the upper hemisphere $\mathbb{S}^4_+$ by a conformal change of the standard metric. Using the natural variational formulation and conformal variations generated by boundary-preserving conformal vector fields, we obtain nontrivial integral obstructions to solvability.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Data-Driven Synthesis of Robust Positively Invariant Sets from Noisy Data

This paper develops a method to construct robust positively invariant (RPI) tube sets from finite noisy input-state data of an unknown linear time-invariant (LTI) system, yielding tubes that can be directly embedded in tube-based robust data-driven predictive control. Data-consistency uncertainty sets are constructed under process/measurement noise with polytopic/ellipsoidal bounds. In the measurement-noise case, we provide a deterministic and data-consistent procedure to certify the induced residual bound from data. Based on these sets, a robustly stabilizing state-feedback gain is certified via a common quadratic contraction, which in turn enables constructive polyhedral/ellipsoidal RPI tube computation. Numerical examples quantify the conservatism induced by noisy data and the employed certification step.
Read the full abstract

Algebraic Geometry

The relative movable cone conjecture for K-trivial fibrations in varieties with well-clipped movable cones

We prove the weak relative Kawamata-Morrison movable cone conjecture for K-trivial fibrations whose very general fibre is a quotient, by a finite group of automorphisms acting freely in codimension one, of a product of certain Calabi-Yau pairs whose underlying varieties have well-clipped movable cones, a notion recently introduced by Cécile Gachet. Our main result applies in particular when the fibre is a finite product of an abelian variety, smooth rational surfaces underlying klt Calabi-Yau pairs, projective irreducible holomorphic symplectic manifolds and Enriques manifolds, both of a known type. As a consequence, there are only finitely many minimal models over the base, up to isomorphism. When the relative movable cone is non-degenerate, we obtain the full relative movable cone conjecture.
Read the full abstract

Combinatorics

Hypercube Embeddings And Median Structure In The Intersection Lattice Of Discriminantal Arrangements B(n,k)

We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making it a partial cube and a median graph, with distances given by the Hamming distance and geodesics described by symmetric differences. We also prove a Poisson limit and a sharp threshold for overlaps of random circuit families, revealing an underlying hypercube geometry.
Read the full abstract

Geometric Topology

The search for exotic knot traces

Two distinct knots are said to be friends if their complements, filled along the 0-slope, produce diffeomorphic 3-manifolds. In this article, we develop a practical algorithm, implemented using SnapPy and Regina, to search for a friend of a given knot. As an application, we construct a census of simple knots that admit friends and use these data to formulate conjectures about knot friends.
Read the full abstract

Probability · Cross-listed from cs.DM

On sampling diluted Spin-Glasses with unbounded interactions

Spin-glasses are natural Gibbs distributions that have been studied in Theoretical CS for many decades. Recently, they have been gaining attention from the community as they emerge naturally in neural computation and learning, network inference, optimisation and other areas. We study the problem of efficiently sampling from spin-glass distributions when the underlying graph is a typical instance of $G(n,d/n)$, i.e., the random graph on $n$ vertices such that each edge appears independently with probability $d/n$, and $d=\Theta(1)$. Our focus is on the 2-spin model at inverse temperature $\beta$. We consider this distribution to be one of the most interesting case of spin-glasses, and one of the most challenging to analyse, since its Gaussian couplings give rise to unbounded interaction. We employ the well-known Glauber dynamics to sample from the aforementioned distribution. We show that for the typical instances of the 2-spin model on $G(n,d/n)$, the mixing time of Glauber dynamics is $O\left(n^{1+\Theta(\frac{1}{\sqrt{d}})}\right)$, for any $\beta\leq \frac{1}{4\sqrt{d}}$. Our results can also be adapted for the case of spin-glass distributions with bounded interactions. In that respect, we obtain rapid mixing of Glauber dynamics for the Viana-Bray model on $G(n,d/n)$ when $\beta\leq \frac{1}{4\sqrt{d}}$. This improves on the current best bound which is $\beta<\frac{0.18}{\sqrt{d}}$. We utilise stochastic localisation, and in particular, we build and improve on the scheme introduced in [Liu, Mohanty, Rajaraman and Wu: FOCS 2024]. This is the first time that stochastic localisation is used for diluted spin-glasses, where both degrees and interactions can be unbounded.
Read the full abstract

Analysis of PDEs

Korn's inequality from the viewpoint of calculus of variations

We study the best possible constants in Korn-type inequalities and their connection with Morrey's problem in the calculus of variations. We adapt techniques from the analysis of the Beurling-Ahlfors transform to Korn's inequality. In dimension $2$, we obtain a bound that is sharp up to a factor of $1.158$. In general, we show that the constant in Korn's inequality admits a dimension-free bound, and we obtain an estimate that is sharp up to a factor of $\sqrt 3$. We also establish several improvements to estimates in various other function spaces. Using a weighted version of Burkholder's differential subordination theorem, recently introduced in [J. Reine Angew. Math. 824 (2025), pp. 137-166], we also prove a dimension-free weighted version of the inequality for Muckenhoupt weights.
Read the full abstract

Geometric Topology

Finiteness of Cannon–Thurston fibers

Let $Y\to X$ be a proper map between proper hyperbolic metric spaces. A Cannon–Thurston map is a continuous extension $\partial Y \to \partial X$. We prove that in most known settings in which a Cannon–Thurston map exists it is uniformly finite-to-one. This answers a question due to Swarup from Bestvina's problem list and generalizes previous results of Cannon–Thurston, Kapovich–Lustig, Dowdall–Kapovich–Taylor and Ghosh.
Read the full abstract

All authors Indranil Bhattacharyya, Rakesh Halder, Nir Lazarovich, Mahan Mj

General Mathematics

Convexity of Picture Fuzzy Multisets

In this paper, the notion of convexity of picture fuzzy multisets was introduced and some of their properties were presented after studying the concept of picture fuzzy multisets.

Probability

Itô perspective on variance renormalisation

We show that the Itô solutions of the nonlinear stochastic heat equation $$ \partial_t u^\varepsilon- \Delta u^\varepsilon =\varepsilon^{3/4} g (u^\varepsilon) \nabla \xi_\varepsilon, $$ where $ \xi_\varepsilon$ denotes the mollification in space at scale $\varepsilon>0$ of a space-time white noise $\xi$, converge in law, as $\varepsilon\to 0$, to the solution of the stochastic heat equation with right-hand side $cg'g(u)\xi$ with a constant $c>0$. Since the noise $\nabla\xi$ is supercritical, the small prefactor is not unexpected to obtain a limit, but the exponent $3/4$ is not predicted by naive scaling arguments. The case $g(u)=u$, modulo a Cole-Hopf transform, corresponds to the result of [Hai25] for the KPZ equation. Our argument is relatively short and relies solely on stochastic analytic techniques.
Read the full abstract