Search Results

You are looking at 1 - 1 of 1 items for

  • Author or Editor: Т. КОВАЛЬСКИ x
  • Refine by Access: All Content x
Clear All Modify Search

Abstract  

In this paper we consider the behaviour of partial sums of Fourier—Walsh—Paley series on the group62-01. We prove the following theorems: Theorem 1. Let {n k} k =1/∞ be some increasing convex sequence of natural numbers such that

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathop {\lim sup}\limits_m m^{ - 1/2} \log n_m< \infty$$ \end{document}
. Then for anyfL (G)
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\left( {\frac{1}{m}\sum\limits_{j = 1}^m {|Sn_j (f;0)|^2 } } \right)^{1/2} \leqq C \cdot \left\| f \right\|_\infty$$ \end{document}
. Theorem 2. Let {n k} k =1/∞ be a lacunary sequence of natural numbers,n k+1/n kq>1. Then for anyfεL (G)
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\sum\limits_{j = 1}^m {|Sn_j (f;0)| \leqq C_q \cdot m^{1/2} \cdot \log n_m \cdot \left\| f \right\|_\infty }$$ \end{document}
. Theorems. Let µk=2k+2k-2+2k-4+...+2α 0,α 0=0,1. Then
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\begin{gathered} \{ \{ S_{\mu _k } (f:0\} _{k = 1}^\infty ;f \in L^\infty (G)\} = \{ \{ a_k \} _{k = 1}^\infty ;\sum\limits_{k = 1}^m {a_k^2 = 0(m)^2 \} .} \hfill \\ \{ \{ S_{\mu _k } (f:0\} _{k = 1}^\infty ;f \in C(G)\} = \{ \{ a_k \} _{k = 1}^\infty ;\sum\limits_{k = 1}^m {a_k^2 = o(m)^2 \} = } \hfill \\ = \{ \{ S_{\mu _k } (f:0\} _{k = 1}^\infty ;f \in C(G),f(0) = 0\} \hfill \\ \end{gathered}$$ \end{document}
. Theorem 4. {{S 2 k(f: 0)} k =1/∞ ,fL (G)}=m.
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\{ \{ S_{2_k } (f:0\} _{k = 1}^\infty ;f \in C(G)\} = c. \{ \{ S_{2_k } (f:0\} _{k = 1}^\infty ;f \in C(G),f(0) = 0\} = c_0$$ \end{document}
.

Restricted access