On a problem of B. Mityagin
نویسنده
چکیده
and f(x) sin⟨x, b⟩ ∈ L(R) for all b ∈ B, (2) imply f ∈ L(R) for any measurable function f on R (here ⟨x, b⟩ denotes the inner product of x and b). He showed (for p ≥ 1) that if (i) A = αZ and B = βZ, or (ii) A = {a} and B = {b} are singletons, then (1) and (2) imply f ∈ L(R) if and only if αβ is not an integer multiple of π in case (i) and ⟨a, b⟩ is not an integer multiple of π in case of (ii). He has also conjectured the statement in
منابع مشابه
On the Korteweg-de Vries equation: frequencies and initial value problem
Unspecified Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: http://doi.org/10.5167/uzh-22229 Originally published at: Bättig, D; Kappeler, T; Mityagin, B (1997). On the Korteweg-de Vries equation: frequencies and initial value problem. Pacific Journal of Mathematics, 181(1):1-55. pacific journal of mathematics Vol. 181, No. 1, 1997 ON THE KORTEWEG-DE VRIES EQUAT...
متن کاملSpectral gaps of Schrödinger operators with periodic singular potentials
By using quasi–derivatives we develop a Fourier method for studying the spectral gaps of one dimensional Schrödinger operators with periodic singular potentials v. Our results reveal a close relationship between smoothness of potentials and spectral gap asymptotics under a priori assumption v ∈ H loc (R). They extend and strengthen similar results proved in the classical case v ∈ L loc (R).
متن کاملThe Asymptotic Form of Eigenvalues for a Class of Sturm-Liouville Problem with One Simple Turning Point
The purpose of this paper is to study the higher order asymptotic distributions of the eigenvalues associated with a class of Sturm-Liouville problem with equation of the form w??=(?2f(x)?R(x)) (1), on [a,b, where ? is a real parameter and f(x) is a real valued function in C2(a,b which has a single zero (so called turning point) at point 0x=x and R(x) is a continuously differentiable function. ...
متن کاملHard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set. Motivated by cryptographic applications, we study sets with succinct representation for which the constrained DLP is hard. We draw on earlier results due...
متن کاملOn Best Proximity Points in metric and Banach spaces
Notice that best proximity point results have been studied to find necessaryconditions such that the minimization problemminx∈A∪Bd(x,Tx)has at least one solution, where T is a cyclic mapping defined on A∪B.A point p ∈ A∪B is a best proximity point for T if and only if thatis a solution of the minimization problem (2.1). Let (A,B) be a nonemptypair in a normed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Approximation Theory
دوره 218 شماره
صفحات -
تاریخ انتشار 2017