Sums of Two Exact Powers

An asymptotic formula is obtained for the number of representations of an element of a finite field as a weighted sum of two prescribed powers of primitive elements. This generalises previous work on sums of primitive elements, including that relating to some conjectures of Golomb.     

临界可压缩模类与弱Jacobson根

本文讨论临界可压缩模类和结合环的弱Ｊａｃｏｂｓｏｎ根．首先，我们证明了非平凡的临界可压缩模类是素模的特殊类．其次，我们引入结合环的弱Ｊａｃｏｂｓｏｎ根．弱Ｊａｏｎｂｓｏｎ根是特殊根．最后，我们给出有关弱本原环，半弱本原环和弱Ｊａｃｏｂｓｏｎ根环的某些性质．     

A continuous function space with a Faber basis

Let be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (P_n)_n=0^∞ with deg P_n=n such that every fC(S) has a unique representation f=∑_i=0^∞ α_iP_i and call such a basis Faber basis. In the special case of , 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(S_q)≠U(S_q)=C(S_q), where A(S_q) is the so-called Wiener algebra and U(S_q) is the set of all fC(S_q) which are uniquely represented by its Fourier series.     

A new algorithm for fixed design regression and denoising

In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise (standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising and of compression.     

微分多项式的值分布

文[2-6]讨论了亚纯函数或代数体函数的微分多项式ω‘(z)-αω^n(z)及ω（z)ω^n(z)的例外值问题。本文利用代数体函数的Nevanlinna值分布理论方法，研究了代数体函数的微分多项式P（ω^(k)(z))-aΠk=1^s(ω(z)-ak)^pk,及a(w^(k)(z)^tw^n(t)的Picard值问题，推广了他们的结果。     

A new summation identity for the Srivastava-Singhal polynomials

In his recent investigations involving differential operators for some generalizations of the classical Laguerre polynomials, H. Bavinck [J. Phys. A Math. Gen. 29 (1996) L277-L279] encountered and proved a certain summation identity for the classical Laguerre polynomials. The main object of this sequel to Bavinck's work is to prove a generalization of this summation identity for the Srivastava-Singhal polynomials. The demonstration, which is presented here in the general case, differs markedly from the earlier proof given for the known special case. It is also indicated how the general summation identity can be applied to derive the corresponding result for one class of the Konhauser biorthogonal polynomials.     

Some families of hypergeometric polynomials and associated integral representations

The main object of this paper is to investigate several general families of hypergeometric polynomials and their associated single-, double-, and triple-integral representations. Some known or new consequences of the general results presented here, involving such classical orthogonal polynomials as the Jacobi, Laguerre, Hermite, and Bessel polynomials, and various other relatively less familiar hypergeometric polynomials, are also considered. Each of the integral representations, which are derived in this paper, may be viewed also as a linearization relationship for the product of two different members of the associated family of hypergeometric polynomials.     

A Law of Large Numbers for the Zeroes of Heine–Stieltjes Polynomials

We determine the limiting density of the zeroes of Heine–Stieltjes polynomials (or of any set of points satisfying the conclusion of Heine–Stieltjes Theorem) in the thermodynamic limit and use this to prove a strong law of large numbers for the zeroes.     

关于正形置换多项式的注记

n为正整数，m为大于1的正整数，本文证明了当n≡0，1（mod m）时，F2^n上不存在2^m-1次正形置换多项式，并给出了该结果的几个推论：F2^n上不存在次数为3的正形置换多项式；n〉2时，F2^n上的4次正形置换多项式都是仿射多项式．     

Efficiency of four different techniques in coupled HPLC-UV/VIS to quantify overlapping peaks with known spectral features

Summary Four different techniques to quantify unresolved chromatographic peaks with known spectral features combined with photodiode array detection, are investigated as regards their efficiency for the accurate and precise determination of drugs in the low g-range. The comparison includes peak suppression utilising difference chromatograms, first-order derivative chromatograms, selective chromatograms, generated by the calculation of orthogonal polynomial shares, and the powerful least-squares multicomponent analysis approach. Each of these methods uses UV-spectra taken throughout, the peak. The results presented and conclusions reached should enable the chromatographer to come to a decision about the reasonable use of these options now provided by multichannel detection in HPLC.