Papers

We study the robustness of stochastic mirror descent (SMD) under heavy-tailed noise, focusing on whether the method retains its convergence guarantees when run with infinite-variance stochastic gradient input. To address this question in a principled manner, we begin by introducing a continuous-time model of SMD as a stochastic differential equation (SDE) driven by a centered Lévy noise process with finite $p$-th order moments, $1 < p \leq 2$. This scheme – which we call the Lévy mirror flow (LMF) – arises naturally as the scaling limit of SMD in the presence of heavy-tailed noise. In particular, when $p < 2$ – the heavy noise regime – the trajectories of LMF generically exhibit jump discontinuities of arbitrary magnitude which, if frequent enough, lead to infinite variance. Nonetheless, despite this highly singular behavior, we show that LMF attains $\epsilon$-optimality within $\mathcal{O}(\epsilon^{-p/(p-1)})$ time in the convex case, and within $\mathcal{\tilde O}(\epsilon^{-1/(p-1)})$ time for (relatively) strongly convex objectives. These guarantees provide a transparent characterization of the impact of frequent long jumps on the convergence of the process, and percolate to a series of matching discrete-time guarantees for several variants of SMD under heavy-tailed noise.

We propose a novel method for computing invariant densities of certain multidimensional continued fraction algorithms. Inspired by Rauzy induction, our approach builds on the formalism of simplicial systems developed by Fougeron. We introduce a win-lose induction on a graph that is conjugate to the original algorithm, and construct its natural extension by introducing the notion of a dual graph. This method explicitly reconstructs the complete dynamics of the algorithm, yielding a partition of the invariant domain of the natural extension into pieces that map to one another. We further study the ergodic properties of the algorithms within this framework; in particular, we prove that the Modified Triangle algorithm in any dimension admits a unique ergodic measure equivalent to the Lebesgue measure.

For an integer $k\ge 0$ and a graph $G$, the \emph{token-sliding reconfiguration graph $\mathsf{TS}_k(G)$} has the independent $k$-sets of $G$ as vertices. Two vertices are adjacent if one token can slide along an edge of $G$ and the resulting $k$-set is still independent. We study the following realizability problem: for fixed $k\ge 2$, which graphs are isomorphic to $\mathsf{TS}_k(G)$ for some graph $G$? This inverse viewpoint asks which abstract state spaces can occur exactly under a local token rule. We give positive realizability results for the complement targets $\overline{K_n}$, $\overline{K_{m,n}}$, and $\overline{K_n-e}$, and we determine sharp cutoffs for complements of paths and cycles. We also prove a product formula for token-sliding graphs of disjoint unions and apply it to Cartesian products of complete graphs, paths, and cycles. For every grid $\Gamma_{m,n}=P_m\square P_n$ with $2\le m\le n$, we realize $\Gamma_{m,n}$ at token value $m+n-2$ and at every token value $k\ge 4$. At small token values, we prove that $C_4\square C_n$ is not a $\mathsf{TS}_2$-graph for $n\ge 4$, classify ladders $\Gamma_{2,n}$, and settle the first non-ladder grid: for $k\ge 2$, $\Gamma_{3,3}$ is realizable if and only if $k\ge 4$.

The (generalized) Hu algebra is a nontrivial quantization of the wreath product $\Sigma_m \wr \Sigma_d$ between symmetric groups, whose representation theory controls the Hecke algebra of the complex reflection group $G(d,d,md)$. In this paper, we construct a unified basis for this algebra and establish its cellular algebra structure in the case $d = 2$. As an application, our construction provides an elementary realization of the simple modules for the Hecke algebra of type $D_{2m}$ that are parameterized by bipartitions of size $(m,m)$.

We study Ulam stability for approximate *-homomorphisms of C*-algebras. We prove stability results for several classes of nuclear C*-algebras with respect to von Neumann algebra targets, including abelian C*-algebras and large classes arising in the Elliott classification program. We also discuss permanence properties, counterexamples, and related stability phenomena. As applications, we obtain rigidity and independence results for corona algebras.

Carlen, Frank and Lieb studied stability estimates for the lowest eigenvalue of a Schrödinger operator by decomposing the problem into a stability estimate for Hölder's inequality and a stability estimate for a Gagliardo–Nirenberg–Sobolev inequality. In this note we point out that, if the Hölder step is replaced by the optimal $L^1$-stability theorem of Leng and Lu in probabilistic form, then one obtains a density-distance version of the Carlen–Frank–Lieb stability theorem. The new formulation measures the $L^1$ distance between the normalized density $V_-^s/\int V_-^s$ induced by the negative part of the potential and the corresponding density induced by an optimal potential, where $s=\gamma+d/2$. As a geometric application of the same idea, we also derive a density-stability version of the $L_p$ mixed volume inequality. In the case where one of the two convex bodies is centrally symmetric and both bodies are trapped between two concentric Euclidean balls, this gives an averaged stability estimate for the non-evenness of the support function.

LLM pipelines waste substantial token budgets on low-information content: repeated context, verbose responses, and redundant boilerplate. We introduce Entropy Gate, a token compression framework applying entropy quenching $-$ a thermodynamic process that progressively freezes out low-energy tokens while preserving semantic fidelity. Each token receives a multi-factor information energy $E(t)$ combining statistical, structural, and positional components. An adaptive quenching schedule $T(\tau) = T_0 / (1 + \alpha \tau)$ removes tokens whose Boltzmann survival probability $p_i = \exp(-E_i / kT)$ falls below threshold, with a fidelity gate halting compression when energy-weighted similarity drops below $\theta$. We prove token selection by descending $E(t)$ maximizes expected semantic preservation, that quenching produces nested survival sets, and that achievable compression approaches the information-theoretic limit $\text{CR} \to 1 - I(P; T)/H(P)$. A Phase 1 heuristic achieves 40-60% compression across five prompt categories while maintaining $S_E > 0.80$, with energy-squared amplification $E \to E^2$ adding 10-25 percentage points. Context deduplication adds 50-70% savings on repeated blocks. Output-side quenching, motivated by findings that brevity improves accuracy, further reduces response overhead. Combined with external memory, reduction composes multiplicatively to 88-96% for agentic workloads. The framework is stateless, model-agnostic, and deploys as an OpenAI-compatible HTTP proxy.

The Borel lifting problem asks when a nonsingular near action of a Polish group can be represented by a genuine Borel action. For locally compact Polish groups, a classical theorem of Mackey and Ramsay gives an affirmative answer. At the opposite extreme, Glasner–Tsirelson–Weiss proved that every probability preserving Borel action of a Lévy group is trivial, and asked whether a Lévy group can admit a nontrivial nonsingular Borel action. We prove a fixed-point theorem which gives a negative answer for most of the standard Lévy groups in the literature: if $G$ is a locally Wasserstein group, then every quasi-invariant $\sigma$-finite Borel measure for a Borel action of $G$ is supported on the fixed points. The proof introduces Wasserstein stability, a local-to-global principle for compact measure metric groups that refines the Gromov–Milman framework for concentration of measure in topological groups. It asserts that for a compact measure metric group, on average, the total variation of locally distorted density kernels on the group controls their global Wasserstein distance from the Haar measure. We show that Wasserstein stability implies concentration, and prove a functional inequality using martingales in the spirit of Milman–Schechtman, which is governed by $\ell^{1}$-sums of martingale increments. This gives a geometric criterion by which most of the standard Lévy groups in the literature are Wasserstein or locally Wasserstein, including $L^{0}$-groups with compact targets, measure preserving and nonsingular automorphism groups, full groups of amenable equivalence relations, isometry groups of $L^{p}$-spaces for $p\neq2$, the unitary group of the hyperfinite $\mathrm{II}_{1}$-factor, the infinite dimensional unitary and orthogonal groups, the Cameron–Martin affine group, and the isometry group of the Urysohn space.

We consider the compressible time-dependent Navier-Stokes equations in a bounded perforated domain in dimensions two and three. Provided the perforations are small enough, we show that the limiting equations do not change their form when the perforation size goes to zero while their number increases to infinity. The novelty of this result is the form of the pressure: we consider a hard-sphere pressure law, giving an a priori bound for the density while, compared to the barotropic case, having worse regularity for the pressure, therefore causing significant problems in the homogenization procedure. To the best of our knowledge, the homogenization for this kind of pressures has not been addressed in the literature yet.

Spectral characterizations of algebraic structure have a long history in the theory of Banach algebras. It is known that weak spectral information may force strong algebraic consequences, such as commutativity throughout the algebra or centrality of a single element. In this paper we study when spectral invariance, applied to the Jordan product $x \circ y = (xy + yx)/2$, forces commutativity or centrality in a semisimple Banach algebra $A$. We first investigate permutations of three elements, proving that equality of the spectral radii $\rho(xyz)=\rho(xzy)$ for all $x,y,z\in A$ implies $A$ is commutative, thereby complementing earlier cardinality and diameter results of Braatvedt et al. We next consider Jordan products and show that if the spectrum (or spectral radius) cannot distinguish the Jordan product from the ordinary product then $A$ must be commutative. By using representation-theoretic methods, we also obtain local spectral characterizations of central elements, showing that boundedness or omission properties of the spectrum (or spectral argument) of the Jordan product $x\circ(ax^{-1})$, as $x$ runs through the exponential group of $A$, imply $a$ belongs to the center of $A$. These results show that coarse spectral data associated with the Jordan product can determine commutativity and centrality.

We use recent results, among which modular inequalities for curves, to determine the Alexander polynomials for some classes of pencil-type conic-line arrangements. For these classes of curves we prove that the Alexander polynomial is (at least partially) combinatorial. To this end, we exemplify new techniques that are suitable for broader use, lending themselves to more general classes of curves.

We find a necessary and sufficient condition for a smooth functional on a subspace to admit a norm-preserving smooth extension to the entire space in polyhedral norms. The characterization is geometric: such an extension exists if and only if the unique absolute norm-attaining point of the smooth functional is an extreme point of both the unit ball of the subspace and that of the ambient space. We show by example that such a result is not true in non-polyhedral norms, even under sufficiently strong hypothesis. Extremity of the norm preserving restrictions of extreme functionals are also discussed.

A classical theorem of Nash-Williams states that if $G$ is a $2$-connected graph on $n$ vertices with minimum degree at least $(n+2)/3$, then for every longest cycle $C$ of $G$, the graph $G-V(C)$ is edgeless. Motivated by a higher-connectivity analogue, Bondy conjectured in 1980 that if $G$ is a $k$-connected graph on $n$ vertices with minimum degree at least $(n+k(k-1))/(k+1)$, then for every longest cycle $C$ of $G$, every path in $G-V(C)$ has at most $k-1$ vertices. This conjecture is known for $k\le 3$ and remains open for all $k\ge 4$. In this paper, we prove Bondy's conjecture for all sufficiently large graphs. The key ingredient is a new Dirac-type theorem that gives a lower bound on the length of a longest cycle in a $k$-connected graph, which also yields a partial solution to a conjecture of Jung from 1990. Along the way, we develop several new tools, including a DFS lemma and an average-degree analogue of the Bondy–Jackson theorem. We conclude with a discussion of related problems and a counterexample to a conjecture of Voss from 1991.

Integrated sensing and communication (ISAC) has emerged as a promising key technology for future wireless networks, enabling the efficient coordination of sensing and communication functions within limited resources. This work investigates a secure ISAC system assisted by an uncrewed aerial vehicle (UAV). By incorporating the extended Kalman filter (EKF), the proposed system is capable of delivering communication services to legitimate users while simultaneously jamming eavesdroppers and performing joint prediction and tracking of the trajectories of both legitimate and illegitimate users. Considering practical constraints such as {sensing beamwidth}, transmit power, and UAV's propulsion energy consumption, the secrecy rate is maximized through the joint design of transmit beamforming and UAV trajectory. To tackle the resulting highly non-convex optimization problem, an efficient iterative algorithm is developed by integrating block coordinate descent, successive convex approximation, and EKF, thereby yielding a high-quality suboptimal solution. Extensive simulation results validate the superior performance of the proposed scheme compared to benchmarks.

The $r$-neighbor bootstrap percolation process on a graph $G$ is a vertex-activation process that begins with a set of initially active vertices. In each subsequent round, every inactive vertex having at least $r$ active neighbors becomes active. Denote by $m(G,r)$ the minimum number of initially active vertices whose activation eventually spreads to all vertices of $G$. Let \(\mathbbmsl{O}_k\) and \(\mathbbmsl{B}_k\) be the odd graph and the bipartite odd graph, respectively, both defined on a ground set of size \(2k+1\). In this article, among other results, we prove that $m(\mathbbmsl{O}_k, 2)=\lceil(k^2+3k+2)/4\rceil$ and $m(\mathbbmsl{B}_k, 2)=\lceil(k^2+2k+3)/2\rceil$. The former result confirms a conjecture posed in 2021 by Grippo, Pastine, Torres, Valencia-Pabon, and Vera.

We prove that, on a bounded open convex domain $\Omega\subset\mathbb{R}^n$, the first Dirichlet eigenfunction of the Laplacian or the Ornstein–Uhlenbeck operator is $\alpha$-logconcave for every $\alpha\in(0,1/2]$. This extends the recent $1/2$-logconcavity theorem of Crasta–Fragalà for the Laplacian to the weighted Gaussian setting and, simultaneously, to a broader range of exponents. More precisely, if $u$ denotes the first eigenfunction normalized by $\|u\|_\infty=1$, then for every $\alpha\in(0,1/2]$, the function $-\bigl(-\log(\kappa u(x))\bigr)^{\alpha}$ is concave in $\Omega$ provided the scaling parameter $\kappa$ lies below an explicit threshold $\kappa_\alpha(\Omega)\in(0,1)$, which depends on the first Dirichlet eigenvalue and on the diameter of~$\Omega$. For the Ornstein–Uhlenbeck operator, $\kappa_\alpha(\Omega)$ also depends on the distance between $\Omega$ and the origin. Moreover, we establish a local counterpart: for every $\kappa\in(0,1)$, the function $\bigl(-\log(\kappa u)\bigr)^{\alpha}$ is convex on a convex neighborhood $\Omega_\kappa$ of the unique maximum point of~$u$. We also provide counterexamples showing that unscaled $1/2$-logconcavity may fail for the first Dirichlet eigenfunction of a Schrödinger operator with a smooth convex potential, and for the first Dirichlet eigenfunction of a weighted Laplacian associated with an affine log-concave weight.

A $\mathbf{GL}$-variety is a typically infinite dimensional variety equipped with a suitable action of the infinite general linear group $\mathbf{GL}$. In earlier work, we established the unirationality theorem: an irreducible $\mathbf{GL}$-variety admits a dominant map from a particularly simple $\mathbf{GL}$-variety, namely, the product of an irreducible finite-dimensional variety with trivial $\mathbf{GL}$-action and an infinite-dimensional affine space on which $\mathbf{GL}$ acts linearly. The main result of this paper states that this map can in fact be constructed to be surjective rather than merely dominant. An immediate application is that secant varieties to varieties of tensors, which are typically constructed as image closures of certain $\mathbf{GL}$-equivariant maps, are in fact also images of (more complicated) $\mathbf{GL}$-equivariant maps. We derive several consequences of this improved unirationality theorem.

This paper studies the global regularity problem for the two-dimensional incompressible Boussinesq equations with fractional dissipation given by $(-\Delta)^{\frac\alpha2}u$ and $(-\Delta)^{\frac\beta2} \theta$. Attention is focused on the subcritical regime where $\alpha+ \beta>1$. The case $\alpha >\frac23$ was recently settled in a joint work of the authors [Math. Ann., 391 (2025), 5965-6012], which established global regularity under this condition. This paper addresses the remaining case $\alpha \leq \frac23$. We obtain the sharpest regularity result by minimizing assumptions on $\alpha$ and $\beta$. We derive nonlinear lower bounds for the fractional Laplacian operator and implement an iterative procedure.

We study projection-based diagnostics for distinguishing directional asymmetry from tail-ratio departure in multivariate data. The procedure reduces the problem to one-dimensional projections and computes two quantile-based summaries: a directional skewness measure evaluated over several quantile levels, and an interquantile tail-ratio evaluated relative to a chosen benchmark. The two summaries lead to a four-regime classification: symmetric benchmark-tail, symmetric tail-departed, skewed benchmark-tail, and skewed tail-departed. The quantile formulation avoids relying on third and fourth moments, which can be unstable in heavy-tailed settings. We establish population properties under central symmetry and ellipticity, uniform finite-sample bounds over the searched directions, and consistency of the threshold classifier under separated regimes. A sparse rank-one calculation is also used to show why coordinate directions can complement random directions in high dimensions. The resulting diagnostic is meant to guide subsequent modelling choices, for example whether a symmetric, skewed, tail-departed, or combined multivariate model is appropriate.

In this work we introduce a class of non-local differential operators defined through a beta-weighted averaging of the ordinary derivative. We investigate their analytical properties and establish connections with the Caputo and Erdélyi-Kober operators. Differential equations involving the beta-weighted derivative are studied by Mellin transform methods, leading to solutions represented in terms of Barnes G-functions and a new class of G-hypergeometric functions. We also analyze asymptotic properties, Laplace transforms, and the second-order equation involving the sequential beta-weighted derivative. Finally, we present stochastic applications of these results, showing that continuous-time random walks, with waiting times characterized by the beta-weighted derivative, converge to Brownian motions time-changed by a scaled inverse stable subordinator. We compare this anomalous-diffusion model with a time-changed Brownian motion whose one-dimensional distribution solve a heat-type equation with beta-weighted derivative.

We study Gromov's problem on the minimal normal curvature of immersions. Our main result is a lower bound for the average normal curvature of a closed submanifold immersed in a Riemannian domain. The bound is expressed in terms of an invariant measuring the optimal $n$-trace convexity of the domain under a unit-gradient normalization. As applications, we recover and extend Petrunin's lower bound for closed submanifolds immersed in Euclidean balls to geodesic balls in Cartan-Hadamard manifolds and, more generally, to Riemannian domains satisfying suitable convexity conditions. In the Cartan-Hadamard setting, under a natural assumption on the average scalar curvature, we show that equality forces the submanifold to lie minimally in the boundary sphere and that the radial sectional curvature vanishes along it. We also obtain sharper estimates for immersions into hyperbolic balls and Euclidean tubes.

Non-negative reduced biquaternion matrix factorization (NRBMF) uses the product of reduced biquaternion (RB) matrices to incorporate the non-negativity constraints of color image pixels into the factorization process. However, NRBMF mainly focuses on reconstruction accuracy and does not explicitly exploit the local geometric structure of image data, which may limit the discriminative ability of the obtained low-dimensional coefficient representations. To address this issue, we propose a graph regularized non-negative reduced biquaternion matrix factorization (GNRBMF) model for color image recognition. The proposed model incorporates a graph Laplacian regularizer into the reduced biquaternion coefficient matrix, encouraging nearby samples in the original space to have similar coefficient representations. Meanwhile, GNRBMF retains the non-negativity property of NRBMF in the reduced biquaternion algebra. To solve the optimization problem, a component-wise alternating projected gradient algorithm is derived, and its convergence properties are analyzed. Experimental results on three color image datasets show that the proposed GNRBMF model achieves competitive or superior recognition performance compared with several methods in most tested settings.

We study the $b$-$6j$ symbols – an analytic extension of the $6j$-symbols for the principal series of the modular double of $\mathrm U_q\mathfrak{sl}(2;\mathbb R)$ – with complex index $b,$ refereed to as the \emph{complex $b$-$6j$ symbols}. Then we relate their asymptotics, when the six parameters scale according to the dihedral angles of a hyperideal hyperbolic tetrahedron, to the volume and the determinant of the Gram matrix of the tetrahedron. In the case $\arg b=\pm \frac{\pi}{4},$ we believe that this work is closely related to the complex Liouville string\,\cite{CEMR}.

This paper presents a novel application of Jet Transport, a high-order automatic differentiation technique, to enhance classical numerical methods, with a focus on Newton's method. We prove a central theorem establishing that, under appropriate conditions, applying Jet Transport within a Newton iteration doubles the number of correct coefficients in the Taylor series approximation of the solution. This theoretical result is then extended to the practical case where the exact solution is unknown, demonstrating the expected quadratic convergence (error reduction from \( \varepsilon \) to \( \varepsilon^2 \)) while simultaneously doubling the order of accuracy in the series expansion. The efficacy of the resulting Jet-Newton method is demonstrated through three illustrative examples: an academic problem validating the theoretical convergence rates, the solution of Kepler's equation, and a new continuation algorithm for computing zero-velocity curves in the circular restricted three-body problem. These examples showcase the method's capability to provide high-order semi-analytical approximations.

Let $P(G)$ be the Grothendieck ring of the semiring of endomorphisms of the point in the $1$-category of bispans of finite $G$-sets for a finite group $G$. This is the bispan analogue of the Burnside ring of $G$. The ring $P(G)$ admits a third operation from composition of bispans. We produce a character map for $P(G)$ landing in a plethory built out of polynomial rings and the poset of conjugacy classes of subgroups of $G$. We prove that the character map sends composition of bispans to the plethysm operation – which is a generalization of composition of polynomials.

Cyclic codes with dimensions exceeding half of the code length and minimum distance greater than the square root of the code length are of significant interest due to their high transmission efficiency and strong error-correcting capability. Such codes are well suited for demanding applications, including communication and storage systems, post-quantum cryptography, radar and sonar systems, wireless sensor networks, and space communications. Motivated by the work of Ding \cite{P3}, this paper extends the binary framework of Ding and Zhou \cite{P2} to a non-binary setting. By employing power functions with known differential uniformity over finite fields of odd characteristic, we present several infinite families of $q$-ary cyclic codes of length $q^m-1$ with dimensions exceeding $(q^m-1)/2$ and the lower bounds on the minimum distances greater than the square root of the code length, thereby achieving a favorable balance between code rate and error-correcting capability. We also determine the exact minimum distance of some of these codes. Furthermore, we partially resolve Open Problem $5.31$ posed by Ding in \cite{P3}.

This article presents a finite-horizon linear quadratic regulator for the control of the first-order Lighthill-Whitham-Richards traffic model with a triangular fundamental diagram. The in-domain control action is realized through variable speed limits implemented as a source term in the governing hyperbolic partial differential equation. Unlike prior studies on infinite-horizon formulations, this article develops a finite-horizon LQR framework, deriving a space and time varying state feedback function for hyperbolic PDEs. The solution to the finite time optimal control problem relies on the solution of another PDE, called the Riccati PDE. The resulting nonlinear Riccati PDE is solved analytically via the parametric method of characteristics. The Riccati PDE solution is a function of both time and space, as well as the traffic regime. A sensitivity analysis demonstrates the effects of the LQR parameters for both the infinite and finite time horizon problem in different traffic situations, while siulations validate the finite-horizon LQR's ability to guarentee finite-time convergence. Comapred to the infinite-horizon LQR, the proposed approach achieves significantly improved control performance across various scenarios, making it particularly suitable for time-sensitive traffic management applications.

Let $p$ be an odd prime. We prove the sharp extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every sphere of nonzero radius $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq3$, uniformly in $p$ and $j$. The proof combines arithmetic Hecke operator bounds with a refined fourth moment and an orthogonal decomposition. We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence on the size of the physical support. This conjecture remains open and would yield distance estimates for almost every pin at the conjectured Erdős–Falconer exponent in four dimensions, with an arbitrarily small power loss in the size hypothesis. Unconditionally, our localized estimates imply that, for every $\varepsilon>0$, sets of size at least $p^{7/3+\varepsilon}$ determine $(1+o_\varepsilon(1))p$ distances from almost every pin, together with asymmetric two-set versions.

Let $\mathcal{A}$ be a (not necessarily rational) conformal net with an action of a discrete group $G$. We show that the category $\text{Rep}^G(\mathcal{A})$ of $G$-twisted representations of $\mathcal{A}$ is canonically a $G$-crossed balanced $\mathrm{W}^*$-tensor category. This extends the results of Müger arXiv:math/0403322, in the language of localized endomorphisms, that $\text{Rep}^G(\mathcal{A})$ is a $G$-crossed braided tensor category.

This paper extends the short-time Fourier transform (STFT), a fundamental tool in time-frequency analysis, to the quantum group setting of unimodular Kac algebras. For a unimodular Kac algebra \mathbb{G}, we introduce a time-frequency shift operator that combines left translation and modulation operators. Using a window vector in the Hilbert space L^2(\mathbb{G}), we define the corresponding STFT and establish its essential analytic properties, including a Plancherel theorem, the Moyal identity, an inversion formula, and a fundamental identity. Furthermore, we explore the projective corepresentation structure of the time-frequency shift operator, and prove that its reflected version induces a continuous projective left representation of the dual quantum group of the quantum double. Finally, we derive the covariance principle and several uncertainty principles.