Papers

Let $\mathcal N$ be a von Neumann algebra equipped with a normal faithful semifinite trace, and let $\gamma$ be a trace-preserving automorphism of $\mathcal N$. We consider the ergodic averages along the prime numbers \[ A_N(x) := \frac1{|P_N|} \sum_{q\in P_N}\gamma^q(x), \qquad P_N:=\{q\leq N:q\ \text{is prime}\}. \] For every $1<p<\infty$, we prove a strong maximal inequality for $(A_N)_{N\geq2}$ on $L_p(\mathcal N)$ and that $A_N(x)$ converges bilaterally almost uniformly for every $x\in L_p(\mathcal N)$. The proof exploits the circle method and a noncommutative sampling principle. For the convergence result, Bourgain's commutative argument uses pointwise maximal functions and exceptional sets. These tools are not available in the noncommutative setting. Instead, we show that the tails of the ergodic averages tend to zero in $L_2(\mathcal N;\ell_\infty)$ and that the difference from the limit belongs to $L_2(\mathcal N;c_0)$. This gives the desired b.a.u. convergence, and provides a positive answer to one question left open in \cite{ChenHongWang+arXiv2024}.

Marton's covering conjecture studies finite sets in high-dimensional binary spaces whose pairwise sums create relatively few new elements. It predicts that every such set can be described efficiently by shifted copies of one linear subspace of comparable size. Gowers, Green, Manners, and Tao [GGMT25] proved the conjecture with exponent $12$. Liao [L24] improved the exponent to $9$. We improve it further to $5.287$.

By slightly adapting Wang's recent important argument for the homoscedastic setting, we prove that every finite heteroscedastic Gaussian mixture has only finitely many critical points, and, consequently, only finitely many modes.

Bergsma–Dassios sign covariance $\tau^*$ is a rank-based population measure of dependence. Building on zero-characterisation results under specific regularity regimes, we prove that $\tau^*(X,Y)=0$ characterises independence for every real-valued bivariate distribution, including mixed and singular laws. For the unnormalised four-sample convention for $\tau^*$ defined in Subsection 4.3 and the unscaled Blum–Kiefer–Rosenblatt functional $\mathscr {B}$, the proof gives the quantitative inequality $\tau^*\ge 2\mathscr {B}$. This is a population identification result; no new sample-level limit theorem is claimed. The argument first encodes finite ordered distributions with rational cell probabilities by labelled path trees and applies a nonnegative sum-of-squares representation for a quartet covariance. Rational approximation and nested quantisation then remove all support and regularity restrictions. On finite uniformly weighted label sets, the tree framework also relates an edge-weighted quartet quantity to empirical distance covariance squared. As a separate combinatorial consequence, it yields the asymptotic $2/3$ upper bound for the quartet distance between binary phylogenetic trees.

Let $G$ be a permutation group that acts $2$-transitively on the finite set $V$ and let $\mathcal{T}=(V,T)$ be a two-graph whose automorphism group contains $G$. In this paper, we classify those strongly regular graphs $\Gamma$ with vertex set $V$ whose automorphism group is a transitive maximal subgroup of $G$ and whose associated two-graph is $\mathcal{T}$. In doing so, we obtain a new family of vertex-transitive strongly regular graphs whose associated two-graph arises from $P\Sigma L(2,q)$.

Loss-versus-Rebalancing (LVR) is the dominant adverse-selection cost borne by liquidity providers on automated market makers. Under geometric Brownian motion, arbitrage profit scales with the probability of a profitable block, which vanishes as the block time $\Delta t \to 0$; this is the standing argument for ever-shorter blocks. Modeling the reference price instead as a jump-diffusion, I show that the constant-product LVR rate splits into a diffusion channel carrying the known multiplier $F(\gamma/(\sigma\sqrt{\Delta t}))$ and a jump channel $\lambda V \cdot G(\gamma;m,\delta^2)$ carrying no $\Delta t$, the two interacting only through an explicitly bounded remainder. The block schedule therefore governs only one channel. For symmetric jump laws the jump channel is moreover an exact lower bound, $\ell(\Delta t) \ge \lambda V G > 0$, so the rate does not vanish as $\Delta t \to 0$, and descends slowly, as $\sqrt{\Delta t}$. At Ethereum's calibrated 12-second slot the rate is 471 bp/yr against a floor of 125, so only three quarters of LP loss is schedule-addressable. At Solana's 400 ms slot the jump channel already dominates. Netting the rate against per-block consensus cost, the LP-side optimal block time is invariant in pool size and in every jump parameter $(\lambda,m,\delta)$: jumps shift the level of LP loss but not the planner's marginal tradeoff. Volatility, the fee tier, and consensus cost set the optimum, near 8 s. However, LVR is only one input to block-time welfare, so this bounds the LP-side contribution rather than settling the design question.

We study the stabilizability of a N -level quantum systems using an indirect control ar- chitecture mediated by a noisy ancilla. After outlining the general theoretical framework for arbitrary N , we focus on the two-level case (N = 2), for which we derive a complete set of necessary and sufficient conditions for asymptotic stability. Finally, we illustrate the analyti- cal results with a simple numerical example on a two-spin system, showing convergence to a Bell state for a set of random initial conditions.

Let $p_n^{(\alpha,\beta)}$ denote the Jacobi polynomial orthonormal for the weight $(1-x)^\alpha(1+x)^\beta$ on $[-1,1]$, where $\alpha,\beta\ge-1/2$, and put $S=\alpha+\beta+1$. We prove the uniform degree–parameter estimate $$ (1-x)^{\alpha+1/2}(1+x)^{\beta+1/2} \bigl|p_n^{(\alpha,\beta)}(x)\bigr|^2 \le C\max\bigl\{1,S^{1/3},S^{1/2}(n+1)^{-1/6}\bigr\}. $$ This proves, in an equivalent symmetric parametrisation, the stronger degree-sensitive conjecture proposed by Krasikov and implies the Erdélyi–Magnus–Nevai conjecture. The proof starts from Krasikov's estimate in the high-parameter quadrant and transports it to the hard edges through weighted contiguous relations whose singular endpoint terms cancel; direct hypergeometric estimates control the remaining endpoint caps. A Bessel turning-point argument shows that the intermediate factor $S^{1/3}$ in the squared estimate cannot be omitted. We also derive degree-sensitive lower bounds for Jacobi Christoffel functions and Gauss–Jacobi quadrature weights.

Di Nezza–Guedj–Lu asked whether local Arnold multiplicities under maximal weak twisted Kähler–Ricci flow with fixed cohomology class satisfy $\lambda(\varphi_t,x)=\max\{\lambda(\varphi_0,x)-t,0\}$. We construct counterexamples with analytic initial singularities in every dimension $n\ge2$. On the Hirzebruch surface $\mathbb F_e$, $e\ge2$, the initial current $[S]+(e+1)[F]$ yields $\lambda(\varphi_t,x)=1/2-t/e$ for $x\in S\setminus F$ and $0<t<e/2$, where $S$ is the negative section and $F$ a fibre. Products with smooth stationary factors give higher-dimensional examples. The Zariski negative part of $\{S\}+\{F\}$, the reduced support class, forces extra divisor mass. For pure divisorial data with simple normal crossings support, a smooth semipositive representative of the reduced support class's positive part gives exact short-time formulas. On one surface we construct flows with identical initial current germs, background data and global initial Arnold multiplicity, but different local rates.

We investigate two families of central elements of the queer super Yangian ${\rm Y}(\mathfrak{q}_1)$, arising from the constructions of Poletaeva-Serganova and from Nazarov's quantum Berezinian. We establish an explicit relation between their generating series, thereby giving an answer to the question raised by Nazarov in \cite{Na22}.

We study properties of characteristic zero variants of Frobenius thresholds $c^J(\mathfrak a)$ inspired by the work of Epstein-McDonald-R.G. and the second author. Suppose $R$ is an excellent domain of equal characteristic zero with a dualizing complex and $\mathfrak a, J \subseteq R$ are nonzero ideals with $\mathfrak a \subseteq \sqrt{J}$. By using a log resolution of singularities $Y$ of $(R, \mathfrak a)$ as well as the derived global sections of a line bundle on $Y$, we construct two analogs of the Frobenius threshold, the Hironaka-threshold and the Koszul-Hironaka threshold. We show that these two thresholds agree for parameter ideals and are always rational numbers. We prove that these thresholds also share many of the properties of the classical Frobenius threshold, especially for parameter ideals. If $R$ is regular, we show that the set of thresholds coincides with the set of possible multiplier-ideal-jumping numbers. Finally, we show that for parameter ideals in a Kawamata log terminal ring, our thresholds coincide with the limit of the Frobenius thresholds of the mod-$p$-reductions as $p$ goes to infinity. There is even a version of this without that Kawamata log terminal hypothesis.

This paper proposes a novel frequency-time hybrid multiple scattering (FTH-MS) integral equation solver for time-dependent wave equation problems in general multi-layered media, with remarkable scalability with respect to the number of layers $N$. In light of the finite speed of wave propagation, the new methodology provides an innovative multiple-scattering idea of re-modeling the original $N$-layered problem into a sequence of $N-1$ two-layered sub-problems, for which the main advantages lie in that (i) each sub-problem enjoys much simpler wave scattering properties compared with the complicated problem in a multi-layered medium, (ii) it enables to develop high-accuracy solver utilizing Fourier transform and frequency-domain boundary integral equation (BIE) method; and (iii) numerical evaluation of the sub-problems in each multiple scattering step can be parallelized. Both multiplicative- and additive-type strategies are developed and equivalence results, which indicate that the $M$-th order multiple scattering sums can provide equivalent representations of the solutions up to a certain time $T(M)$, are rigorously derived. Owing to the existed result of exponential convergence of the perfectly-matched-layer (PML) truncation for two-layered problem, all the sub-problems is numerically resolved by means of the FTH method based on the Fourier transform and the PML-BIE method whose numerical evaluation is addressed utilizing the Chebyshev-based rectangular-polar solver with high accuracy. Numerical examples are presented to validate the efficiency and accuracy of the proposed method.

We find explicit ridge unfoldings of the three exceptional 4D polytopes (24-cell, 120-cell, 600-cell) that result in overlaps of their facets. These failures bring an end to the full classification of regular polytopes with the all-net property.

For a polynomial of degree $n$ whose zeros lie in the closed unit disk, we determine the largest possible distance from a prescribed critical point of modulus $r$ to the nearest zero. If $n$ is even, the sharp radius is $\sqrt{1-r^2}$; if $n$ is odd, the sharp radius is strictly smaller for $r\in(0,1)$ and depends on $n$. Equality cases are also determined. The proof is based on the logarithmic-derivative identity and elementary geometric considerations.

This paper introduces a family of one-step implicit methods for solving scalar ordinary differential equations. At each step, the update uses a scaled angular mean of two vector-field evaluations, and the positive scale may vary from step to step. The leading terms of the local truncation error can be expressed in terms of the derivative of the signed curvature of the scaled solution graph. We prove that the proposed method reproduces the exact solution at the mesh points when the solution graph has constant signed curvature under a fixed positive scaling and each implicit update is unique. When this special geometric condition is not satisfied, we establish second-order consistency and convergence for positive scale sequences satisfying suitable uniform conditions. Furthermore, third- and fourth-order consistency and convergence can be achieved by choosing the scale to cancel the relevant curvature terms in the local truncation error. Using only the given problem data, we classify when these improvements are possible and determine the corresponding scale choices. An example shows that the proposed fourth-order method can yield smaller errors than the classical fourth-order Runge–Kutta method at the same step size.

In this paper it is proved that there exists (in $ZFC$) a separable pseudocompact weak $\lambda$-space $X$ which is not $\Delta_1$-space. It follows that there exists a space $X$ such that $B_1(X,[0, 1])$ is Choquet, while $B_1(X)$ is not Choquet. Also it is proved that there exists a $\gamma$-set $X$ which is not weak $\lambda$-set. It follows that there exists a zero-dimensional separable metrizable space $X$ such that $B_1(X)$ is Baire, while $B_1(X, [0,1])$ is not Choquet. These results answers the previously posed questions.

We construct smooth, strictly log-concave counterexamples to the Gaussian completely monotone conjecture in every dimension. In one dimension, they form an explicit family $f_m$ whose signed $m$th entropy derivative at time zero is negative for every sufficiently large $m$; the inequality persists for all sufficiently small positive times. Tensorization with a broad Gaussian factor gives the higher-dimensional examples. The argument is analytic and self-contained. It reduces the sign to a two-frequency entropy calculation on the circle and transfers the resulting asymptotic to the real line through an exact heat-flow formula for Gaussian-windowed Fourier modes. The proof was developed by GPT-5.6 Sol Pro under the authors' guidance.

The exact Shannon capacity is unknown for every odd cycle beyond the five-cycle $C_5$, making odd cycles a central open problem in zero-error information theory. Improving the known lower bounds requires constructing large independent sets in strong powers of these graphs. Recent AI-assisted work has produced a rapid sequence of improvements: building on the construction of Itty et al., Gao developed a recursive product construction for combining structured independent sets, and Buys, Polak, and Zuiddam (BPZ) subsequently strengthened this through a richer recursion framework. We continue this line of AI-assisted exploration and introduce a heterogeneous refinement of these constructions. The central observation is that the usefulness of an intermediate construction depends not only on the size of its current main independent set, but also on the auxiliary structure it carries into subsequent recursion. Consequently, different parts of that auxiliary structure need not use the same independent set, and different occurrences in a recursion need not use the same intermediate representation. We formalize this for Gao's binary product and derive explicit propagation rules showing how heterogeneous choices strengthen the resulting gadget while leaving its current code size unchanged, then extend the principle to the more general BPZ framework, tailoring constructions to the distinct roles they play within the recursion. Applying these refinements to the seven-cycle $C_7$, we obtain an independent set in $C_7^{\boxtimes 500}$ yielding $\Theta(C_7)\ge 3.25883262\ldots$, improving the best known lower bound. Beyond the numerical gain, the results illustrate a general principle for recursive zero-error constructions: intermediate structures with the same dimension and current code size can have different downstream value depending on where and how they are used in the recursion.

We study decentralized online optimization of upper-linearizable payoffs over an action set under efficient separation access, with applications to online continuous diminishing-return (DR) submodular maximization. We propose Decentralized Barrier Follow-the-Regularized-Leader (Dec-BFTRL), and evaluate each agent's played action against the average of all local objectives. Each agent maps an internal iterate to a feasible action through an approximate gauge projection, communicates only a cumulative surrogate-gradient dual state, and invokes the local HybridNewton procedure to approximately minimize its post-communication BFTRL potential. For every agent, we achieve expected network-aggregate regret of $\widetilde O(\sqrt{T})$. Over $T$ rounds, each agent uses $T$ neighbor-mixing steps and $\widetilde O(T)$ separation-oracle calls. We give wrapper instantiations covering four up-concave or DR-submodular maximization problems.

Let $1\leq k\leq n$. We prove that $k$-dimensional intrinsic Lipschitz graphs in the Heisenberg group $\mathbb{H}^n$ satisfy a geometric lemma $\mathrm{GLem}(\beta_{2,\mathcal{V}_k},p)$ for horizontal $\beta$-numbers with an exponent $p=p(k)$. Previously, this result was known only in the case $k=1$; our proof recovers the sharp exponent $p=4$ in this setting. For $k>1$, we adapt an integral geometric approach originally developed by Orponen for Euclidean and parabolic Lipschitz functions. In addition, for $k=n$, we show how to deduce a geometric lemma with $p=4$ directly from an isotropic Dorronsoro theorem in $\mathbb{R}^{2n}$ using a Poincaré inequality. Building on the new geometric lemmas, we establish a necessary condition for $k$-regular sets in $\mathbb{H}^n$ to admit corona decompositions by intrinsic Lipschitz graphs. The condition is known to be sufficient by earlier work of the last two authors together with Pinamonti. It involves additional flatness coefficients besides $\beta_{2,\mathcal{V}_k}$. Along the way, we therefore extend the known stability results for geometric lemmas under the “big pieces” functor to a larger class of coefficients.

We give the recurrence relation for counting polynomials for permutations avoiding the $\321$ vincular pattern, with respect to inversion numbers and descent numbers, and consequently give the $q$-exponential generating function for these counting polynomials. Furthermore, we give another explanation for these counting polynomials in terms of restricted-growth words.

Independently weighted semidefinite penalties arise in augmented-Lagrangian and constrained formulations. This paper characterizes when an exact additive subspace-correction preconditioner remains uniformly effective over all nonnegative penalty weights on a fixed finite-dimensional space. Robustness holds precisely when the correction spaces decompose every joint kernel generated by a nonempty subset of penalties. If one condition fails, a computable constant determines the exact first-order decay of the smallest preconditioned eigenvalue along the associated parameter ray, and the condition number grows linearly; none of the subset conditions can be discarded in general. Filtered decompositions provide computable sufficient bounds on parameter-ordering cones, while distributive kernel lattices permit a single common splitting. Exact-additive computations confirm the characterization and predicted rates. Separate Scott-Vogelius experiments produce stable multilevel iteration counts over the tested weights and mesh levels. The analysis does not establish mesh-uniformity.

We resolve the threshold part of Question 4 of the COLT 2025 open problem "Data Selection for Regression Tasks" of Hanneke, Moran, Shlimovich and Yehudayoff. We study vector-valued linear regression with square loss $\ell_{(x,y)}(W)=\lVert Wx-y\rVert_2^2$, where $x\in\mathbb{R}^d$ and $y\in\mathbb{R}^m$. The learner returns the minimum-Frobenius-norm empirical risk minimizer. We prove that the minimal budget of weighted examples for recovering the full-data loss on every finite dataset is exactly $n^{\star}(d,m)=(m+1)d$. We determine the weighted selection profile $F_{\mathrm{weighted}}(d,m,n)$ at the near-threshold budget: $F_{\mathrm{weighted}}(d,m,(m+1)d-1)=1+1/(dm^2)$. We recover the known spanning-budget value $F_{\mathrm{weighted}}(d,m,d)=d+1$ for every $m$, and $F_{\mathrm{weighted}}(d,m,n)=\infty$ for $n<d$. For the smallest open intermediate cell $(d,m)=(2,2)$ we prove $F_{\mathrm{weighted}}(2,2,3)\in[13/8,15/8]$ and $F_{\mathrm{weighted}}(2,2,4)\in[5/4,3/2]$. We reduce the conjectured exact values $13/8$ and $5/4$ to a finite moment problem on the circle with at most seven atoms and assemble structural evidence for it. The upper bounds use a fixed-basis conic compression lemma, a determinant–facet rigidity theorem for maximal certificates, and sharp sparsification lemmas for zero-mean weighted point systems. These tools may be of independent interest. We also exhibit an explicit six-point integer dataset with $d=m=2$ on which no weighted selection of $2d$ points recovers the optimal loss. Thus the scalar sufficient budget $2d$ does not extend to vector-valued outputs. Our new regression-profile results for $m\ge2$ extend the scalar theory for $m=1$.

We consider the collision-transport operator for vector-valued two-relaxation-time lattice Boltzmann schemes linearized about a uniform rest state. Assume that the equilibrium blocks are positive definite and that the link-even and link-odd relaxation parameters satisfy s_+ + s_- = 2 and 0 < s_- < 2. If the homogeneous transport is unitary in the equilibrium metric and reversible under velocity exchange, then the powers of the amplification operator are bounded uniformly with respect to the number and arrangement of lattice nodes. The admissible transports include periodic transport, vector halfway bounce-back, coordinate-aligned specular reflection, tangential orthogonal involutions, and compatible multi-channel scattering. The proof reduces the population equation to a two-step macroscopic recurrence generated by a contraction. An inclusion of the numerical range in an ellipse, combined with the Crouzeix-Palencia theorem, yields a dimension-independent estimate for the companion operator and hence the population bound. For a three-coefficient off-midpoint boundary interpolation, we give an exact rational D2N5 example whose finite-domain amplification matrix has a real eigenvalue larger than one, although the interpolation coefficients and bulk parameters are admissible. Thus coefficient convexity alone does not ensure stability for this boundary family.

The homogeneous space $\operatorname{O}_{m,n}(\mathbb{R})/(\operatorname{O}_{p,q}(\mathbb{R}) \times \operatorname{O}_{m-p,n-q}(\mathbb{R}))$ is an object that has received scant attention, with just two brief mentions in existing literature, and christened the indefinite Grassmannian in one of them. In this article, we develop some of its basic properties, building it from ground up. We will see that, aside from its homogeneous space description, the indefinite Grassmannian may be characterized in several other ways: set-theoretically, it is the manifold of indefinite $(p+q)$-dimensional subspaces in $(m +n)$-dimensional space; it is an adjoint orbit of a Lie group; a semialgebraic smooth manifold of matrices; a base space of a principal bundle whose total space is the indefinite Stiefel manifold, a natural corresponding notion. It may also be naturally equipped with various structures, turning the indefinite Grassmannian into a pseudo-Riemannian manifold; a Einstein manifold; a symplectic manifold; and a pseudo-Kähler manifold (last two only over $\mathbb{C}$). As a centerpiece of this article, we establish two attributes of the indefinite Grassmannian in relation to the standard Grassmannian: (i) any Grassmannian has a Whitney stratification whose highest dimensional strata are indefinite Grassmannians; (ii) the indefinite Grassmannian is a strong deformation retract of a product of two Grassmannians, thereby allowing us to completely ascertain the topology of the former. We will also determine some of the indefinite Grassmannian's features that are within reach — both geometric (Riemann, Ricci, sectional, and scalar curvatures; second fundamental form) and topological (cohomology ring, homotopy groups, characteristic classes).

The fundamental theorem of statistical learning states that, under suitable measurability assumptions, finite Vapnik–Chervonenkis (VC) dimension guarantees that every proper consistent learning rule is probably approximately correct (PAC). Blumer, Ehrenfeucht, Haussler, and Warmuth showed, assuming the Continuum Hypothesis, that the "well-behavedness" condition of the concept class cannot be omitted: they constructed a concept class of Borel sets of VC dimension one admitting a consistent learning rule that is not PAC. We show that the Continuum Hypothesis is unnecessary. Working in Zermelo–Fraenkel set theory with the Axiom of Choice (ZFC) alone, we construct a concept class of Borel sets on $[0,1]$ of VC dimension one and a proper consistent learning rule that is not PAC. More precisely, for a suitable Borel probability measure and target concept, the rule has true risk one at every sample size on a set of samples of outer probability one. Consequently, finite VC dimension and Borel measurability of the individual concepts do not suffice to guarantee that every proper consistent learning rule is PAC. The result shows, with no need of extra set-theoretical assumptions, that the additional regularity assumption in the fundamental theorem cannot in general be omitted.

In 2004, Khoroshkin proved that the extremal projector is equivalent to the dynamical twist. The Arnaudon-Buffenoir-Ragoucy-Roche (ABRR) equation, satisfied by the dynamical twist, yields a recursive formula for the coefficients in the extremal projector. The resulting summation formula is uniform and powerful in its applications to representation theory and Mickelsson-Zhelobenko reduction algebras. In this paper we generalize this recursive formula to the relative extremal projector, introduced by Conley and Sepanski in 2003. When the Levi subalgebra is the Cartan subalgebra, we recover the usual ABRR recursion. We also find a compact and explicit expression for the solution to the recursion. Our setting includes infinite-dimensional contragredient Lie superalgebras, Kac-Moody algebras, basic classical Lie superalgebras, and finite-dimensional reductive Lie algebras.

This paper presents a novel model-free algorithm for the finite-population linear quadratic Gaussian (LQG) decentralized social control problem with multiplicative noise. The state and control weights in the cost functional are not limited to be positive semidefinite. For both finite-horizon and infinite-horizon cases, the goal is to obtain a social optimum by solving two algebraic Riccati equations (AREs), without requiring prior knowledge of the system matrices. Then, we complete the design of a model-free algorithm for solving the decentralized social control problem. Especially, in the infinite-horizon case, the algorithm's convergence is based on analyzing the spectral property of the Lyapunov-type operator. The differences of reinforcement learning (RL) solutions between the finite-horizon and infinite-horizon cases are compared. Finally, the effectiveness of the proposed algorithm is demonstrated by a numerical example.

The aim of this paper is to study the Segre invariant for rank $2$ vector bundles on Hirzebruch surfaces $\mathbb{F}_e$, $e \geq 0$. We give necessary conditions in order to determine what numbers can appear as the Segre Invariant of a rank $2$ vector bundle on $\mathbb{F}_e$ with fixed Chern classes. We compute a bound of the dimensions of the strata whenever are non-empty. Finally, we present applications to Brill-Noether Theory and describe differences between moduli spaces under change of polarization for rank $2$ vector bundles on $\mathbb{F}_e$.

We prove the strong unique continuation property for the fractional Schrödinger equation \[ (-\Delta)^s u=Vu \] with scaling-critical potentials $ V\in L^{\frac{n}{2s}}_{\mathrm{loc}}$ for all $0<s<1$. Our result constitutes the nonlocal counterpart to the classical Jerison–Kenig result for Schrödinger operators.