Irreducibility and the distribution of some exponential sums

We relate the distribution of the absolute value of some generalized Gauss sums to the absolute irreducibility of some polynomials in two variables in characteristic 0 and p.     

New perturbation bounds for the subunitary polar factors

In this article, we present some new perturbation bounds for the (subunitary) unitary polar factors of the (generalized) polar decompositions. Two numerical examples are given to show the rationality and superiority of our results, respectively. In terms of the one-to-one correspondence between the weighted case and the non-weighted case, all these bounds can be applied to the weighted polar decomposition.     

Construction of the extremal function for a functional on the classH ω (n)

For a functional on the classH _ω ⁽ⁿ⁾ ,n≥3, we construct the extremal function on which the upper bound obtained by A. I. Stepanets is attained. Translated fromMatematicheskie Zametki, Vol. 61, No. 4, pp. 519–529, April, 1997. Translated by N. K. Kulman     

无线搜索下仿射尺度算法的收敛性

本文我们考虑求解边界约束优化问题的一个仿射尺度算法。该方法的主要特点是在每次迭代过程中不需要任何线搜索,从而避免了多次调用目标函数的计算。在一定条件下,获得了算法的全局收敛性,数值测试证明了方法的有效性。     

Global well-posedness and scattering for the defocusing -subcritical Hartree equation in

We prove the global well-posedness and scattering for the defocusing -subcritical (that is, 2<γ<3) Hartree equation with low regularity data in , d3. Precisely, we show that a unique and global solution exists for initial data in the Sobolev space with s>4(γ−2)/(3γ−4), which also scatters in both time directions. This improves the result in [M. Chae, S. Hong, J. Kim, C.W. Yang, Scattering theory below energy for a class of Hartree type equations, Comm. Partial Differential Equations 33 (2008) 321–348], where the global well-posedness was established for any s>max(1/2,4(γ−2)/(3γ−4)). The new ingredients in our proof are that we make use of an interaction Morawetz estimate for the smoothed out solution Iu, instead of an interaction Morawetz estimate for the solution u, and that we make careful analysis of the monotonicity property of the multiplier m(ξ)ξ^p. As a byproduct of our proof, we obtain that the H^s norm of the solution obeys the uniform-in-time bounds.     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

Tail Bounds for the Supremums of Empirical Processes over Unbounded Classes of Functions

So far the study of exponential bounds of an empirical process has been restricted to a bounded index class of functions. The case of an unbounded index class of functions is now studied on the basis of a new symmetrization idea and a new method of truncating the original probability space; the exponential bounds of the tail probabilities for the supremum of the empirical process over an unbounded class of functions are obtained. The exponential bounds can be used to establish laws of the logarithm for the empirical processes over unbounded classes of functions.