We investigate the Fourier transforms of functions in the Sobolev spaces $W_1^{r_1,...,r_n}$. It is proved that for any function $f\in W_1^{r_1,...,r_n}$ the Fourier transform f̂ belongs to the Lorentz space $L^{n/r,1}$, where $r=n{({\sum }_{j=1}^{n}1/r_j)}^{-1}\le n$. Furthermore, we derive from this result that for any mixed derivative $D^{s}f(f\in C_0^{\infty },s=(s_1,...,s_n))$ the weighted norm $\parallel {\left(D^{s}f\right)}^{\wedge }{\parallel }_{L^1\left(w\right)}(w\left(\xi \right)={\left|\xi \right|}^{-n})$ can be estimated by the sum of $L^1$-norms of all pure derivatives of the same order. This gives an answer to a question posed by A. Pełczyński and M. Wojciechowski.

We study one-dimensional oscillator integrals which arise as Fourier-Stieltjes transforms of smooth, compactly supported measures on smooth curves in Euclidean spaces and determine their decay at infinity, provided the curves satisfy certain geometric conditions.

We consider the maximal function $\left|\right|\left(S^{a}f\right)\left[x\right]{\left|\right|}_{L^{\infty }[-1,1]}$ where $\left(S^{a}f\right){\left(t\right)}^{\wedge }\left(\xi \right)=e^{{it\left|\xi \right|}^a}f̂\left(\xi \right)$ and 0 < a < 1. We prove the global estimate $\left|\right|S^{a}f{\left|\right|}_{L²(ℝ,L^{\infty }[-1,1])}{\le C\left|\right|f\left|\right|}_{H^s\left(ℝ\right)}$, s > a/4, with C independent of f. This is known to be almost sharp with respect to the Sobolev regularity s.

The aim of this paper is the study of the convergence of algorithms involved in the resolution of two scale equations. They are fixed point algorithms, often called cascade algorithms, which are used in the construction of wavelets. We study their speed of convergence in Lebesgue and Besov spaces, and show that the quality of the convergence depends on two independent factors. The first one, as we could foresee, is the regularity of the scaling function which is the solution of the equation. The...

We prove an exact controllability result for thin cups using the Fourier method and recent improvements of Ingham type theorems, given in a previous paper [2].

A set S of integers is called ε-Kronecker if every function on S of modulus one can be approximated uniformly to within ε by a character. The least such ε is called the ε-Kronecker constant, κ(S). The angular Kronecker constant is the unique real number α(S) ∈ [0,1/2] such that κ(S) = |exp(2πiα(S)) - 1|. We show that for integers m > 1 and d ≥ 1, $\alpha 1,m,...,m^{d-1}=(m^{d-1}-1)/\left(2(m^d-1)\right)$ and α1,m,m²,... = 1/(2m).