Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 22 February
We obtain a cohomological interpretation for Batyrev's stringy Hodge numbers in the full generality in which they are defined. In a previous paper, the second and third authors used motivic integration to define the stringy Hodge–Deligne invariant of a smooth Artin stack $\mathcal{X}$ and proved that when $\mathcal{X}$ is a crepant resolution of a variety $Y$ with log-terminal singularities, the generating function for the stringy Hodge numbers of $Y$ is equal to the stringy Hodge–Deligne invariant of $\mathcal{X}$. In this paper, we introduce a cohomology theory $H_{\mathrm{str}}^*(\mathcal{X})$ that computes the stringy Hodge–Deligne invariant of $\mathcal{X}$. Since, by previous work of the second and third authors, all varieties with log-terminal singularities admit a crepant resolution by an Artin stack, this gives a cohomological interpretation for stringy Hodge numbers of any variety with log-terminal singularities. We also show that in the special case where $\mathcal{X}$ is Deligne–Mumford, $H_{\mathrm{str}}^*(\mathcal{X})$ coincides with the orbifold cohomology of $\mathcal{X}$.
Complex Variables
Frequently hypercyclic sequences of differential operators on the space of entire functions
A criterion to obtain frequent hypercyclicity for a sequence of convolution operators on the space of entire functions on the complex plane is provided. The criterion involves that the generating functions of the operators do not vanish on an appropriate annulus, in the boundary of which the modulus of each term of the sequence is in some sense controlled by the preceding ones or the following ones.
Read the full abstract
Rings and Algebras
Structure and arithmetic of multivariate Ore extensions
We give the basic structure of the multivariable Ore extensions $S=A[\underline{t} ; \sigma, \underline{\delta}]$ introduced in the work of Martínez-Peñas and Kschischang. The Pseudo multilinear transformations (PMT's) are introduced and correspond to modules over $S$. These maps are strongly connected to the evaluation of polynomials in $S$. A general product formula is obtained. PMT's help to put some structure on the set of roots of a polynomial $f(t) \in S$.
Read the full abstract
Group Theory
Finite groups with many elements of the same order
We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by presenting some counterexamples. By restricting to a fixed $k$, the conjecture may or may not hold depending on $k$. We prove that if $k$ is a power of a prime other than $2$ or $3$, or if $k=2, 3$ or $4$, then the conjecture holds, while it fails for many other choices of $k$ including all multiples of $2$ and $3$ which are larger than $5$. For $k=4$ we also find the sharp upper bound of the ratio of elements of order $4$ in non-soluble groups. We also prove that for all $k>1$, it is always possible to find a finite non-soluble group where at least $2/15$ of the elements have order $k$.
Read the full abstract
Functional Analysis
The conjugate orbit of a unitary operator
This paper discusses various aspects of the collection of unitary operators $CUC$, where $U$ is a fixed unitary operator on a complex Hilbert space $\mathcal{H}$ and $C$ varies over the set of all conjugations on $\mathcal{H}$ (antilinear, isometric, involutions). We call this class of unitary operators, the conjugate orbit of $U$ and denote it by $\mathfrak{O}_c(U)$. We will see that $U^{*}$, the Hilbert space adjoint of $U$, always belongs to $\mathfrak{O}_c(U)$, while $U$ belongs to $\mathfrak{O}_c(U)$ only when $U$ is unitarily equivalent to $U^{*}$, making $U$ a member of $\mathfrak{O}_c(U)$ an uncommon event. We completely describe the conjugate orbit of the classical bilateral shift and discuss when a unitary multiplication operator on the classical Lebesgue space of the unit circle belongs to this conjugate orbit. We also broaden this discussion to include the bilateral shifts of higher multiplicity which, via unitary equivalence, makes connections to other interesting unitary operators such as the translation and dilation operators on the Lebesgue space of the real line. Finite unitary matrices provide us with a rich source of examples of conjugate unitary orbits to discuss. In particular, we determine which diagonal matrices, if any, belong to the conjugate orbit of a fixed unitary matrix. Closely related to the finite unitary matrices are the diagonalizable unitary operators with respect to some, possibly infinite, orthonormal basis. We give a large class of variations of these unitary operators that belong to the conjugate orbit and establish a connection to the classical Fourier–Plancherel and Hilbert transforms. Finally, we develop a model for a unitary operator using real Hilbert spaces and use it to describe the conjugate orbit as well as revisit some of our previous discussions in another light.
Read the full abstract
Optimization and Control · Cross-listed from physics.flu-dyn
Squirmers with arbitrary shape and slip: modeling, simulation, and optimization
We consider arbitrary-shaped microswimmers of spherical topology and propose a framework for expressing their slip velocity in terms of tangential basis functions defined on the boundary of the swimmer using the Helmholtz decomposition. Given a time-independent slip velocity profile, we show that the trajectory followed by the microswimmer is a circular helix. We derive analytical expressions for the translational and rotational velocities of a prolate spheroid swimmer in terms of its Helmholtz decomposition modes and explore the effect of aspect ratio on these rigid body velocities. Then, for a given arbitrary swimmer shape of spherical topology, we investigate which slip profile minimizes the total power loss. A partial minimization is performed in which the direction of net motion of the swimmer is prescribed, followed by a global optimization procedure in which the best net motion direction is determined. The optimization results suggest that the competition between linear and rotational optimal motion is linked to symmetries in the shape of the microswimmer.
Read the full abstract
Optimization and Control
Implementation of Time-Varying Controllers for a Nonholonomic Mobile Robot: Experimental Studies
We consider a kinematic model of a wheeled mobile robot controlled by translational and angular velocities. For this class of nonholonomic systems, a family of time-varying feedback controllers was proposed in our previous works using gradient flow approximation techniques. In the present study, these controllers are implemented on a TurtleBot3 Burger (TB3) mobile robot to provide experimental validation of the stabilization problem with oscillating input signals. In addition, the admissibility problem of a gradient flow is investigated to justify the construction of a Lyapunov function candidate. The presented experimental results demonstrate the possibility of stabilizing the reference position of the robot using feedback controls with practically acceptable parameters.
Read the full abstract
Optimization and Control
Potentiality-Based Smoothed Randomized Stochastic Gradient Schemes for Solving Nonconvex Nonsmooth Games under Uncertainty
We develop a potentiality-based gradient-response framework for computing Clarke-Nash equilibria (CNE) in stochastic $N$-player nonconvex nonsmooth potential games. The key observation is that under smoothness and potentiality, the concatenated vector of player-specific gradients coincides with the gradient of the potential function, thereby providing a synchronous gradient-response framework whose dynamics are subsequently analyzed. In the smooth regime, we introduce a randomized stochastic gradient (RSG) scheme and establish the optimal sample complexity $\mathcal{O}(N^{2}\epsilon^{-4})$ for computing a point with expected residual norm at most $\epsilon$. When the potential function is pseudoconvex, this guarantee can be strengthened to Nash equilibrium (NE) convergence. We then incorporate player-wise randomized smoothing and propose a randomized smoothed RSG (RS-RSG) scheme for Lipschitz continuous objectives, deriving complexity guarantees for the smoothed game and an approximation guarantee for CNE of the original nonsmooth game. Finally, biased variants of these schemes are developed to accommodate hierarchical settings with inexact lower-level solutions.
Read the full abstract
Algebraic Geometry
Universal extension spaces and modular maps: unveiling irreducible components of Brill-Noether loci of stable bundles on a general $\nu$-gonal curve
We investigate the Brill-Noether theory of rank-two, degree-$d$ stable vector bundles of speciality $3$ on a general $\nu$-gonal curve of genus $g$, $3 \leq \nu < \lfloor \frac{g+3}{2} \rfloor$. Our approach leverages universal extension spaces, modular maps, and recent advancements in rank-one Brill-Noether theory over Hurwitz spaces. We establish existence criteria for the corresponding Brill-Noether loci and provide a comprehensive description of their irreducible components. We moreover prove that these components exhibit diverse geometric behaviors, categorized by their regularity, superabundance, and the properties of their general points. Notably, for specific degrees $d$, we prove the coexistence of multiple superabundant components alongside a regular one. Using specialization techniques, we uncover a stratification into locally closed subschemes within these components and provide insights into their birational geometry and local structure. Furthermore, our results yield also consequences for Brill-Noether loci of stable, rank-two bundles with a fixed general determinant.
Read the full abstract
Algebraic Geometry
Dualizable abelian fibrations
In his proof of the fundamental lemma of the Langlands program, Ngô initiated the study of the decomposition theorem for abelian fibrations. When an abelian fibration admits a duality structure, the decomposition theorem and the perverse filtration on cohomology exhibit rich structures. The purpose of these notes is to describe a framework for dualizable abelian fibrations and to discuss some recent progress and applications.
Read the full abstract
Metric Geometry
Distance Equilibrium Measures and Curvature in Metric Spaces
Let $(X,d)$ be a compact metric space. We consider the behavior of probability measures $\mu$ with the property that $$ \int_{X} d(x, y) d\mu(y) \qquad \mbox{is independent of}~x \in X.$$ It appears that such measures, when they exist, encode a `curvature-type' quantity. We investigate this in the special case where $X$ is a closed, convex curve in $\mathbb{R}^2$ and $d = \| \cdot \|_2$ is the Euclidean distance: even a single point with small curvature implies non-existence of such a measure. Conversely, such a measure $\mu$ exists for all curves whose curvature is sufficiently close to constant. Curvature is usually defined by second derivatives; this one is defined via an integral equation which makes sense in much rougher spaces. Connections to curvature on graphs, the Gross-Stadje Theorem and magnitude are discussed.
Read the full abstract
Analysis of PDEs
Finiteness of Nonscattering Wavenumbers for Herglotz Incident Waves
This paper continues the study initiated in \cite{VogXia25} on nonscattering phenomena for inhomogeneous media. We investigate star-shaped domains in $\mathbb{R}^2$ and establish finiteness results for nonscattering wavenumbers associated with Herglotz incident waves of fixed density. First, for ellipses we establish finiteness for all constant contrasts $q\neq 1$, removing the geometric restrictions required in previous work. Second, for admissible star-shaped domains with $q\in(0,1)$, we introduce a flexible interval-wise geometric framework that unifies and generalizes earlier finiteness results. Our results reveal that infinite sequences of nonscattering wavenumbers are tied to exact radial symmetry and cannot persist under admissible geometric perturbations. %extend those of \cite{VogXia25} to the regime $0<q<1$ and reveal a rigidity phenomenon for nonscattering behavior beyond the radially symmetric setting.
Read the full abstract
Metric Geometry
Pál's isominwidth inequality for ball convex bodies in planes of constant curvature
Pál's classical isominwidth inequality states that the regular triangle has minimal area among plane convex bodies of minimal width $w$. A similar result is the Blaschke–Lebesgue inequality that states that Reuleaux triangles minimize the area among bodies of constant width $w$ in the plane. In this paper, we connect these two problems by solving the isominwidth problem for $r$-ball convex bodies in the Euclidean, hyperbolic and spherical planes.
Read the full abstract
Algebraic Topology
Discrete homotopy hypothesis for n-types
We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical set to a graph, we are also able to give explicit computations of several previously unknown discrete homotopy groups of boundaries of cubes and suspensions of cycles.
Read the full abstract
Information Theory · Cross-listed from cs.GT
Strategic Gaussian Signaling under Linear Sensitivity Mismatch
We analyze Stackelberg Gaussian signaling games where the encoder and decoder have a linear sensitivity mismatch. Unlike the standard additive-bias model, a sensitivity mismatch means the encoder prefers the decoder to track a linear transformation of the state rather than a shifted one. We derive the equilibrium structure for both noiseless (cheap-talk) and noisy signaling channels. In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regime, we derive analytical thresholds for informative signaling, showing that communication collapses if the sensitivity mismatch or transmission cost exceeds a channel-dependent threshold.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Distributional Discontinuity Design
Regression discontinuity and kink designs are typically analyzed through mean effects, even when treatment changes the shape of the entire outcome distribution. To address this, we introduce distributional discontinuity designs, a framework for estimating causal effects for a scalar outcome at the boundary of a discontinuity in treatment assignment. Our estimand is the Wasserstein distance between limiting conditional outcome distributions; a single scale-interpretable measure of distribution shift. We show that this weakly bounds the average treatment effect, where equality holds if and only if the treatment effect is purely additive; thus, departure from equality measures effect heterogeneity. To further encode effect heterogeneity we show that the Wasserstein distance admits an orthogonal decomposition into squared differences in $L$-moments, thereby quantifying the contribution from location, scale, skewness, and higher-order shape components to the overall distributional distance. Next, we extend this framework to distributional kink designs by evaluating the Wasserstein derivative at a policy kink; this describes the flow of probability mass through the kink. In the case of fuzzy kink designs, we derive new identification results. Finally, we apply our methods on real data by re-analyzing two natural experiments to compare our distributional effects to traditional causal estimands.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Entanglement dynamics of many-body quantum states: sensitivity to system conditions and a hidden universality
We consider physical Hamiltonians that can be represented by the multiparametric Gaussian ensembles, theoretically derive the state ensembles for its eigenstates and analyze the effect of varying system conditions on its bipartite entanglement entropy. Our approach leads to a single parametric based common mathematical formulation for the evolution of the entanglement statistics of different states of a given Hamiltonian or different Hamiltonians subjected to same symmetry constraints. The parameter turns out to be a single functional of the system parameters and thereby reveals a deep web of connection hidden underneath different quantum states.
Read the full abstract
Optimization and Control
Dynamic Repair and Maintenance of Heterogeneous Machines Dispersed on a Network: A Rollout Method for Online Reinforcement Learning
We consider a problem in which a single repairer is responsible for the maintenance and repair of a collection of machines, positioned at different locations on a network of nodes and edges. Machines deteriorate according to stochastic processes and incur increasing costs as they approach complete failure. The times needed for repairs to be performed, and the amounts of time needed for the repairer to switch between different machines, are random and machine-dependent. The problem is formulated as a Markov decision process (MDP) in which the objective is to minimize long-run average costs. We prove the equivalence of an alternative formulation based on rewards and use this to develop an index heuristic policy, which is shown to be optimal in certain special cases. We then use rollout-based reinforcement learning techniques to develop a novel online policy improvement (OPI) approach, which uses the index heuristic as a base policy and also as an insurance option at decision epochs where the best action cannot be selected with sufficient confidence. Results from extensive numerical experiments, involving randomly-generated network layouts and parameter values, show that the OPI heuristic is able to achieve close-to-optimal performance in fast-changing systems with state transitions occurring 100 times per second, suggesting that it is suitable for online implementation.
Read the full abstract
Optimization and Control
Time-iteration methods for controllability
These notes are based on a short course delivered at the Summer School EUR MINT 2025 "Control, Inverse Problems and Spectral Theory", held in June 2025 in Toulouse, France. The course presents three important strategies in control theory, formulated as time-iteration methods, where each time step brings the state of the system closer to the desired target. For linear PDEs, we survey the classical Lebeau-Robbiano method and its more recent developments. This method combines spectral inequalities and dissipation estimates to prove null controllability of a dissipative linear system. For nonlinear PDEs, we reinterpret the Liu-Takahashi-Tucsnak method, which establishes local controllability of a nonlinear system by analyzing the control cost of its linearization. We provide an easily applicable black-box formulation of their method. Finally, for nonlinear ODEs, we present the tangent vectors method, which establishes local exact controllability starting from approximately reachable directions.
Read the full abstract
Algebraic Geometry
Perfect complexes on finite flat affine groupoids
We compute the Balmer spectrum of the category of perfect complexes on an algebraic stack admitting a finite locally free cover by an affine scheme and identify it with the homogeneous spectrum of the cohomology ring.
Algebraic Topology
Embedding, compression, and the relative Hopf invariant
We establish Poincaré embedding results in the relative setting, generalizing previously known results in the absolute case. Our primary motivation comes from applications to non-simply connected Poincaré surgery, which will be developed in a forthcoming paper. Along the way, we introduce a new tool: the relative Hopf invariant in the equivariant setting.
Read the full abstract
Dynamical Systems
Slow-fast dynamics in a planar parasite–host model with an extinction singularity
We study a slow-fast parasite–host model featuring a singularity at the extinction state. Using techniques from Geometric Singular Perturbation Theory (GSPT), and in particular the so-called blow-up method, we desingularize that point and reconstruct the local and global dynamics. The system we consider is in non-standard GSPT form and is characterized by a rich dynamical behavior: families of slow-fast homoclinic orbits, canard-like transitions generated by trajectories that remain close to a repelling critical manifold, and topological changes produced by infinitesimal variations of the infection rate, including the creation and destruction of an endemic equilibrium. We also show that our model is able to reproduce dynamics observed in the spread of the Tasmanian devil facial tumor disease (DFTD), whose behavior resembles the one of a parasite. We conclude with a numerical exploration of the model, to illustrate our analytical results.
Read the full abstract
Dynamical Systems
Polynomial entropy on regular curves
We show that the polynomial entropy of homeomorphisms on regular curves is bounded above by one. Moreover, the polynomial entropy equals one under the fairly mild condition that the homeomorphism possesses a wandering point. We obtain a rigidity result for homeomorphisms on local dendrites (and therefore on graphs and dendrites): their polynomial entropy is either zero or one.
Read the full abstract
Combinatorics
Statistical Analysis of Hairpins and BasePairs in RNA Secondary Structures
We derive precise asymptotic expressions for the expectations, variances, covariance, and quite a few further mixed moments for the number of hairpins and the number of basepairs in RNA secondary structures, and give convincing evidence that the central-scaled distribution of the pair of random variables (hairpins, basepairs) tends in distribution to the bi-variate normal distribution with correlation $\sqrt{5 \sqrt{5} -11}/2= 0.2123322205\dots$
Read the full abstract
Complex Variables
The Burgers Transform: From Holomorphic Functions to Rigid Elliptic Structures
We introduce the Burgers transform $\mathcal{B}$, a nonlinear bijection between holomorphic functions $f\colon U\to\mathbb{C}^+$ and rigid variable elliptic structures on the plane, defined implicitly by $\lambda = f(y-\lambda x)$. The output automatically satisfies the conservative complex Burgers equation $\lambda_x+\lambda\lambda_y=0$. Our main result is that holomorphicity of the seed $f$ is necessary, not merely sufficient, for rigidity: any $C^1$ function whose implicit solution satisfies $\lambda_x+\lambda\lambda_y=0$ must be holomorphic. This closes a gap in the existing literature and identifies $\operatorname{Hol}(U,\mathbb{C}^+)$ as the maximal seed space compatible with rigidity. The obstruction formula $H|_{x=0} = 2i\,(\operatorname{Im} f)\,f_{\bar{w}}$ quantifies the cost of non-holomorphicity at the level of the initial data. We characterise the domain of $\mathcal{B}$ through shock formation, its interaction with affine automorphisms of $\mathbb{C}^+$, and the infinitesimal structure: the propagator $\mathcal{P}_f = D\mathcal{B}_f$ satisfies a Jacobian-twisted multiplicativity that deforms the seed algebra by the density of characteristics. Four worked examples – affine, exponential, inverse, and trigonometric seeds – show that the complexity class of a seed and that of the resulting structure are generically unrelated.
Read the full abstract
Group Theory
Hopfian combinatorial wreath products
Let $A$ be an abelian group. We consider sufficient conditions for the combinatorial wreath product $A \wr_X B$ to be Hopfian generalising results of Bradford and Fournier-Facio. For an integer $m \geq 2$ we show an example where $\mathbb{Z}/ \mathbb{Z}_m \wr_X B$ is not Hopfian but $B$ is Hopfian. We describe $Aut(A \wr_X B)$ under some restrictions on $A$, $B$ and $X$.
Read the full abstract
Functional Analysis
Shift-invariant spaces on finite undirected graphs
Shift-invariant spaces (SISs) on the real line provide a natural framework for representing, analyzing and processing signals with inherent shift-invariant structure. In this paper, we extend this framework to the finite undirected graph setting by introducing the concept of graph shift-invariant spaces (GSISs). We examine several properties of GSISs, including their characterization via range functions and fiber functions in the Fourier domain, their connections to shift-invariant filters and polynomial filters, the frame and Riesz basis structures of finitely generated GSISs, and their intricate relationships with bandlimited spaces, finitely generated GSISs, and graph reproducing kernel Hilbert spaces with shift-invariant reproducing kernels (SIGRKHSs). Our analysis reveals several distinctions between SISs on the line and GSISs, such as the shift-invariance of the frame operator, the existence of shift-invariant dual frames, the emergence of fractional shift-invariance, and the interrelationships among GSISs, finitely generated GSISs, SIGRKHSs and bandlimited spaces. In this paper, we also introduce a spectral decomposition of the identity associated with graph shifts and propose a novel definition of the graph Fourier transform (GFT) of spectral type, together with explicit formulations for the GFTs on complete graphs and circulant graphs. In addition, we establish a clear connection between polynomial filters and shift-invariant filters, and we derive a graph uncertainty principle governing the essential supports of a nonzero graph signal and its GFT.
Read the full abstract
Combinatorics
Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications
A famous conjecture of Erdős asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem has been central in extremal combinatorics, with substantial progress in the literature, including a complete solution for $k=3$ due to the first author. In this paper, we make progress towards the $4$-uniform case, proving the conjecture for $n\ge 5s$ and sufficiently large $n$, thereby taking a first step analogous to the $3$-uniform case. The main technical contribution is a stability result of independent interest. We further apply this stability to resolve two new instances of conjectures on the minimum $d$-degree threshold for matchings in $5$- and $6$-uniform hypergraphs, in a strengthened form.
Read the full abstract
Logic · Cross-listed from cs.LO
Hypersequent Calculi Have Ackermannian Complexity
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence arguments. For hypersequent calculi, that argument lifted the ordering to the powerset, since a hypersequent is a (multi)set of sequents. This induces a jump from Ackermannian to hyper-Ackermannian complexity in the fast-growing hierarchy, suggesting that cut-free hypersequent calculi for extensions of the commutative Full Lambek calculus with contraction or weakening ($\mathbf{FL_{ec}}$/$\mathbf{FL_{ew}}$) inherently entail hyper-Ackermannian upper bounds. We show that this intuition does not hold: every extension of $\mathbf{FL_{ec}}$ and $\mathbf{FL_{ew}}$ admitting a cut-free hypersequent calculus has an Ackermannian upper bound on provability. To avoid the powerset, we exploit novel dependencies between individual sequents within any hypersequent in backward proof search. The weakening case, in particular, introduces a Karp-Miller style acceleration, and it improves the upper bound for the fundamental fuzzy logic $\mathbf{MTL}$. Our Ackermannian upper bound is optimal for the contraction case (realized by the logic $\mathbf{FL_{ec}}$).
Read the full abstract
Probability
Mean-field games with rough common noise: the linear-quadratic case
Motivated by mean-field games (MFG) with common noise on the one hand and pathwise stochastic control theory on the other, we formulate here a linear-quadratic (LQ) MFG with rough common noise, along with a satisfactory well-posedness theory for the linear-quadratic case. A novel Volterra-type (or mild) formulation allows to keep technical (rough-stochastic) consideration to a minimum. We derive a characterization of the optimal state and optimal control through a rough forward-backward SDE (rough FBSDE), and provide an existence and uniqueness result under the usual assumptions. Our theory is accompanied by stability estimates with respect to initial data and common noise while we also establish continuity of what we call the Itô-Lions-Lyons map for rough mean-field games. Finally, we discuss randomization of the rough common noise under appropriate conditions on the coefficients. When the latter is given by the Stratonovich lift of a Brownian motion independent of the idiosyncratic noise, we show that solutions of the rough LQ MFG coincide with those obtained by conditioning on the common noise.