Two-side estimates for sums of absolute values of Fourier coefficients of functions from Hω(Tm)

The class of functions H ^ω is considered, where ω(t) is a continuity modulus monotone in the sense of Hardy and satisfying some condition C. The behavior of the value is obtained, where is the sum of absolute values of Fourier coefficients of a function f ∈ L(T ^m ) in pth power. Original Russian Text ? D.M. D’yachenko, 2008, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2008, Vol. 63, No. 3, pp. 19–26.     

Two-side estimates for sums of absolute values of Fourier coefficients of functions from Hω(Tm) with the use of partial moduli of smoothness

Two-side estimates of sums of absolute values of Fourier coefficients for functions of many variables from the classes H ^ω (T ^m ) are established in the paper with the help of partial moduli of smoothness.     

Ueber das volle Formensystem der tern?ren biquadratischen Formf=x13x2+x23x3+x33x1

Ohne ZusammenfassungHieizu cme Tale     

Vector subdivision schemes in (Lp(?s))r(1?p?∞) spaces

The purpose of this paper is to investigate the refinement equations of the form

Model-theoretic independence in the banach lattices Lp(μ)

We study model-theoretic stability and independence in Banach lattices of the form L _p (X, U, μ), where 1 ≤ p < ∞. We characterize non-dividing using concepts from analysis and show that canonical bases exist as tuples of real elements.     

Balanced colombeau products of the distributions x±-p and x-p

Results on singular products of the distributions x _± ^-p and x ^-p for natural p are derived, when the products are balanced so that their sum exists in the distribution space. These results follow the pattern of a known distributional product published by Jan Mikusiski in 1966. The results are obtained in the Colombeau algebra of generalized functions, which is the most relevant algebraic construction for tackling nonlinear problems of Schwartz distributions.     

The Boundedness of High Order Riesz-Bessel Transformations Generated by the Generalized Shift Operator in Weighted Lp,ω,γ-spaces with General Weights

In this study, the boundedness of the high order Riesz-Bessel transformations generated by generalized shift operator in weighted L _p,ω,γ -spaces with general weights is proved.     

Homogenization of the elliptic Dirichlet problem: Error estimates in the (L2 → H1)-norm

Let      

On the linearity of ω-primality in numerical monoids

In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.     

On the subspace L((x ∧ y)m) of Sm(∧2?4)

We take the exterior power ℝ⁴ ∧ ℝ⁴ of the space ℝ⁴, its mth symmetric power V = S ^m (∧²ℝ⁴) = (ℝ⁴ ∧ ℝ⁴) ∨ (ℝ⁴ ∧ ℝ⁴) ∨ ... ∨(ℝ⁴ ∧ ℝ⁴), and put V ₀ = L((x ∧ y)∨ ... ∨(x ∧ y): x, y ∈ ℝ⁴). We find the dimension of V ₀ and an algorithm for distinguishing a basis for V ₀ efficiently. This problem arose in vector tomography for the purpose of reconstructing the solenoidal part of a symmetric tensor field. Original Russian Text Copyright ? 2009 Gubarev V. Yu. The author was supported by the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-344.2008.1). __________ Novosibirsk. Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 50, No. 3, pp. 503–514, May–June, 2009.     

A new technique of integral representations in ?n

A new technique of integral representations in ℂ ⁿ , which is different from the well-known Henkin technique, is given. By means of this new technique, a new integral formula for smooth functions and a new integral representation of solutions of the ∂-equations on strictly pseudoconvex domains in ℂ ⁿ are obtained. These new formulas are simpler than the classical ones, especially the solutions of the ∂-equations admit simple uniform estimates. Moreover, this new technique can be further applied to arbitrary bounded domains in ℂ ⁿ so that all corresponding formulas are simplified.     

Embedding into l ∞2 Is Easy, Embedding into l ∞3 Is?NP-Complete

We give a new algorithm for enumerating all possible embeddings of a metric space (i.e., the distances between every pair within a set of n points) into ℝ² Cartesian space preserving their l _∞ (or l ₁) metric distances. Its expected time is (i.e., within a poly-log of the size of the input) beating the previous algorithm. In contrast, we prove that detecting l _∞³ embeddings is NP-complete. The problem is also NP-complete within l ₁² or l _∞² with the added constraint that the locations of two of the points are given or alternatively that the two dimensions are curved into a three-dimensional sphere. We also refute a compaction theorem by giving a metric space that cannot be embedded in l _∞³; however, it can be embedded if any single point is removed. This research is partially supported by NSERC grants. I would like to thank Steven Watson for his extensive help on this paper.     

KO?i groups of G3(?n), n odd

We use the work of Karoubi and Mudrinski on the real Grothendieck's groups of certain complex projective bundles to show that the torsion of the KO ^–i groups of G ₃( ⁿ ), n odd, are related to the known torsion of the KO ^–i groups of G₂( ⁿ ).     

The Lindel?f number of Cp(X)×Cp(X) for strongly zero-dimensional X

We prove that if X is a strongly zero-dimensional space, then for every locally compact second-countable space M, C _p (X, M) is a continuous image of a closed subspace of C _p (X). It follows in particular, that for strongly zero-dimensional spaces X, the Lindel?f number of C _p (X)×C _p (X) coincides with the Lindel?f number of C _p (X). We also prove that l(C _p (X ⁿ )^κ) ≤ l(C _p (X)^κ) whenever κ is an infinite cardinal and X is a strongly zero-dimensional union of at most κcompact subspaces.     

Cωp空间中的插值多项式逼近

本文证明了对任意函数f(z)∈C_ω^p.     

Equivalence of Minimal ?0- and ?p-Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p

For a bounded system of linear equalities and inequalities, we show that the NP-hard ℓ ₀-norm minimization problem is completely equivalent to the concave ℓ _p -norm minimization problem, for a sufficiently small p. A local solution to the latter problem can be easily obtained by solving a provably finite number of linear programs. Computational results frequently leading to a global solution of the ℓ ₀-minimization problem and often producing sparser solutions than the corresponding ℓ ₁-solution are given. A similar approach applies to finding minimal ℓ ₀-solutions of linear programs.