An Isolated Umbilical Point of the Graph of a Homogeneous Polynomial

Suppose that the origin o of R ³ is an isolated umbilical point of the graph of a homogeneous polynomial in two real variables of degree k3. Then we see that the index of o is an element of the set 1–k/2+i ^[k/2] _i=0. Moreover, we see that each element of 1–k/2+i ^[k/2] _i=0 may be the index of o on the graph of a suitable homogeneous polynomial of degree k.     

Sur l'approximation de fonctions intégrables sur [0, 1] par des polynômes de Bernstein modifies

We study here a new kind of modified Bernstein polynomial operators on L¹(0, 1) introduced by J. L. Durrmeyer in [4]. We define for f integrable on [0, 1] the modified Bernstein polynomial M_n f: M_nf(x) = (n + 1) ∑ⁿ_{k = o}P_nk(x)∝¹₀ P_nk(t) f(t) dt. If the derivative d^r f/dx^r with r 0 is continuous on [0, 1], d^r/dx^rM_n f converge uniformly on [0,1] and sup_xε[0,1] ¦M_n f(x) − f(x)¦ 2ω_f(1/trn) if ω_f is the modulus of continuity of f. If f is in Sobolev space W_l,p(0, 1) with l 0, p 1, M_n f converge to f in w^l,p(0, 1).     

On Hilbert''s Integral Inequality

In this paper, we generalize Hilbert's integral inequality and its equivalent form by introducing three parameterst,a, andb.Iff, g L²[0, ∞), then[formula]where π is the best value. The inequality (1) is well known as Hilbert's integral inequality, and its equivalent form is[formula]where π²is also the best value (cf. [[1], Chap. 9]). Recently, Hu Ke made the following improvement of (1) by introducing a real functionc(x),[formula]wherek(x) = 2/π∫^∞₀(c(t²x)/(1 + t²)) dt − c(x), 1 − c(x) + c(y) ≥ 0, andf, g ≥ 0 (cf. [[2]]). In this paper, some generalizations of (1) and (2) are given in the following theorems, which are other than those in [ [2]].     

Boundary effects on convergence rates for Tikhonov regularization

We consider the Tikhonov regularizer f_λ of a smooth function f ε H^2m[0, 1], defined as the solution (see [1]) to We prove that if f^(j)(0) = f^(j)(1) = 0, J = m, …, k < 2m − 1, then ¦f − f_λ¦_j² Rλ^{(2k − 2j + 3)/2m}, J = 0, …, m. A detailed analysis is given of the effect of the boundary on convergence rates.     

An Asymptotic Property of Schachermayer's Space under Renorming

Let X be a Banach space with closed unit ball B. Given k , X is said to be k-β, respectively, (k + 1)-nearly uniformly convex ((k + 1)-NUC), if for every ε > 0 there exists δ, 0 < δ < 1, so that for every x B and every ε-separated sequence (x_n) B there are indices (n_i)^k_{i = 1}, respectively, (n_i)^{k + 1}_{i = 1}, such that (1/(k + 1))||x + ∑^k_{i = 1} x_ni|| ≤ 1 − δ, respectively, (1/(k + 1))||∑^{k + 1}_{i = 1} x_ni|| ≤ 1 − δ. It is shown that a Banach space constructed by Schachermayer is 2-β, but is not isomorphic to any 2-NUC Banach space. Modifying this example, we also show that there is a 2-NUC Banach space which cannot be equivalently renormed to be 1-β.     

A Remez-Type Inequality for Non-dense Müntz Spaces with Explicit Bound

LetΛ :=(λ_k)^∞_k=0be a sequence of distinct nonnegative real numbers withλ₀ :=0 and ∑^∞_k=1 1/λ_k<∞. Let(0, 1) and(0, 1−) be fixed. An earlier work of the authors shows that [formula]is finite. In this paper an explicit upper bound forC(Λ, , ) is given. In the special caseλ_k :=k^α,α>1, our bounds are essentially sharp.     

Optimal broadcast on parallel locality models

In this paper matching upper and lower bounds for broadcast on general purpose parallel computation models that exploit network locality are proven. These models try to capture both the general purpose properties of models like the PRAM or BSP on the one hand, and to exploit network locality of special purpose models like meshes, hypercubes, etc., on the other hand. They do so by charging a cost l(|i−j|) for a communication between processors i and j, where l is a suitably chosen latency function.An upper bound T(p)=∑_i=0^loglogp2ⁱ·l(p^1/2i) on the runtime of a broadcast on a p processor H-PRAM is given, for an arbitrary latency function l(k).The main contribution of the paper is a matching lower bound, holding for all latency functions in the range from l(k)=Ω(logk/loglogk) to l(k)=O(log²k). This is not a severe restriction since for latency functions l(k)=O(logk/log¹⁺log(k)) with arbitrary >0, the runtime of the algorithm matches the trivial lower bound Ω(logp) and for l(k)=Θ(log¹⁺k) or l(k)=Θ(k), the runtime matches the other trivial lower bound Ω(l(p)). Both upper and lower bounds apply for other parallel locality models like Y-PRAM, D-BSP and E-BSP, too.     

Error bounds for least squares approximation by polynomials

Let f ε Cⁿ⁺¹[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial approximation to f with respect to the orthonormal polynomials q_k associated with a distribution dα on [−1, 1]. It is shown that if q_n+1/q_n max(q_n+1(1)/q_n(1), −q_n+1(−1)/q_n(−1)), then f − H[f] f^{n + 1} · q_n+1/q_{n + 1}^{(n + 1)}, where · denotes the supremum norm. Furthermore, it is shown that in the case of Jacobi polynomials with distribution (1 − t)^α (1 + t)^β dt, α, β > −1, the condition on q_n+1/q_n is satisfied when either max(α,β) −1/2 or −1 < α = β < −1/2.     

Remarks Concerning Completeness of Translates in Function Spaces

This note explains how to translate the author's old result on cyclic vectors of the multiple shift operator into the language of completeness theorems for integer translates. This translation, together with those results, turns out to be a source for many completeness theorems. In particular, there follows the existence of functions f whose positive integer translates f(x−k), where k ₊ are complete in the spaces C^l₀( ), L^p( ), W^l_p( ), 2<p<∞, l=0, 1, …, as well as in their weighted and/or vector-valued analogues.     

A Coding Theory Bound and Zero-Sum Square Matrices

For a code C=C(n,M) the level k code of C, denoted C _k , is the set of all vectors resulting from a linear combination of precisely k distinct codewords of C. We prove that if k is any positive integer divisible by 8, and n=k, M=k2k then there is a codeword in C _k whose weight is either 0 or at most . In particular, if <(4–2)²/48 then there is a codeword in C _k whose weight is n/2–(n). The method used to prove this result enables us to prove the following: Let k be an integer divisible by p, and let f(k,p) denote the minimum integer guaranteeing that in any square matrix over Z _p , of order f(k,p), there is a square submatrix of order k such that the sum of all the elements in each row and column is 0. We prove that lim inf f(k,2)/k<3.836. For general p we obtain, using a different approach, that f(k,p)p( ^{k / ln k )(1+ o} _k ⁽¹⁾⁾.     

Comparison of some modules of the Lie algebra of vector fields

The Lie algebra of vector fields of a smooth manifold M acts by Lie derivatives on the space of differential operators of order ≤ p on the fields of densities of degree k of M. If dim M ≥ 2 and p ≥ 3, the dimension of the space of linear equivariant maps from into is shown to be 0, 1 or 2 according to whether (k, l) belongs to 0, 1 or 2 of the lines of ² of equations k = 0,k = − 1, k = l and k + l + 1 = 0. This answers a question of C. Duval and V. Ovsienko who have determined these spaces for p ≤ 2[2].     

On improved estimators of the generalized variance

Treated in this paper is the problem of estimating with squared error loss the generalized variance | Σ | from a Wishart random matrix S: p × p W_p(n, Σ) and an independent normal random matrix X: p × k N(ξ, Σ I_k) with ξ(p × k) unknown. Denote the columns of X by X₍₁₎ ,…, X_(k) and set ψ⁽⁰⁾(S, X) = {(n − p + 2)!/(n + 2)!} | S |, ψ⁽ⁱ⁾(X, X) = min[ψ⁽ⁱ⁻¹⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!} | S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |] and Ψ⁽ⁱ⁾(S, X) = min[ψ⁽⁰⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!}| S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |], i = 1,…,k. Our result is that the minimax, best affine equivariant estimator ψ⁽⁰⁾(S, X) is dominated by each of Ψ⁽ⁱ⁾(S, X), i = 1,…,k and for every i, ψ⁽ⁱ⁾(S, X) is better than ψ⁽ⁱ⁻¹⁾(S, X). In particular, ψ^(k)(S, X) = min[{(n − p + 2)!/(n + 2)!} | S |, {(n − p + 2)!/(n + 2)!} | S + X₍₁₎X′₍₁₎|,…,| {(n − p + k + 2)!/(n + k + 2)!} | S + X₍₁₎X′₍₁₎ + + X_(k)X′_(k)|] dominates all other ψ's. It is obtained by considering a multivariate extension of Stein's result (Ann. Inst. Statist. Math. 16, 155–160 (1964)) on the estimation of the normal variance.     

On the Iwasawa invariants of totally real number fields

We shall show two sufficient conditions under which the Iwasawa invariants λ _k and μ _k of a totally real fieldk vanish for an odd primel, based on the results obtained in [1], [3] and [4]. LetK _n be the composite ofk and thel ⁿ-th cyclotomic extension of the fieldQ of rational numbers. LetC _n be the factor group of thel-class group ofK _n by a subgroup generated by ideals whose prime factors divide the principal ideal (l). Let ϕ₁ be an idempotent of the group ringZ _l[Gal(K ₁/k)] defined in the below. We shall prove λ _k = μ _k =0 if there is a natural numbern such that ε₁ C _n vanishes, under additional conditions concerning ramifications inK _n/k.     

Reflection sieve obstructions in finite groups of type dn

In [4] we constructed certain homology representations of a finite group G of type A_n, B_n or C_n, and showed that these representations can be used to sift out the reflection compound characters of G. In the present note, we show that for a group G of type D_n, each reflection compound character π^(k), 2 k n − 2, determines a unique “obstruction” character θ^(k), which occurs with positive multiplicity in every homology representation containing π^(k).     

Matrices dont deux lignes quelconque coïncident dans un nombre donne de positions communes

Le nombre maximal de lignes de matrices seront désignées par:

1. (a) R(k, λ) si chaque ligne est une permutation de nombres 1, 2,…, k et si chaque deux lignes différentes coïncide selon λ positions;

2. (b) S⁰(k, λ) si le nombre de colonnes est k et si chaque deux lignes différentes coïncide selon λ positions et si, en plus, il existe une colonne avec les éléments y₁, y₂, y₃, ou y₁ = y₂ ≠ y₃;

3. (c) T⁰(k, λ) si c'est une (0, 1)-matrice et si chaque ligne contient k unités et si chaque deux lignes différentes contient les unités selon λ positions et si, en plus, il existe une colonne avec les éléments 1, 1, 0.

La fonction T⁰(k, λ) était introduite par Chvátal et dans les articles de Deza, Mullin, van Lint, Vanstone, on montrait que T⁰(k, λ) max(λ + 2, (k − λ)² + k − λ + 1). La fonction S⁰(k, λ) est introduite ici et dans le Théorème 1 elle est étudiée analogiquement; dans les remarques 4, 5, 6, 7 on donne les généralisations de problèmes concernant T⁰(k, λ), S⁰(k, λ), dans la remarque 9 on généralise le problème concernant R(k, λ). La fonction R(k, λ) était introduite et étudiée par Bolton. Ci-après, on montre que R(k, λ) S⁰(k, λ) T⁰(k, λ) d'où découle en particulier: R(k, λ) λ + 2 pour λ k + 1 − (k + 2)^1/2; R(k, λ) = 0(k²) pour k − λ = 0(k); R(k, λ) (k − 1)² − (k + 2) pour k 1191.     

On the L convergence of Lagrange interpolating entire functions of exponential type

Let f: be a continuous, 2π-periodic function and for each n ε let t_n(f; ·) denote the trigonometric polynomial of degree n interpolating f in the points 2kπ/(2n + 1) (k = 0, ±1, …, ±n). It was shown by J. Marcinkiewicz that lim_{n → ∞} ∝₀^2π¦f(θ) − t_n(f θ)¦^p dθ = 0 for every p > 0. We consider Lagrange interpolation of non-periodic functions by entire functions of exponential type τ > 0 in the points kπ/τ (k = 0, ± 1, ± 2, …) and obtain a result analogous to that of Marcinkiewicz.     

On optimal simultaneous rational approximation to with being some kind of cubic algebraic function

It is shown that each rational approximant to (ω,ω²)^τ given by the Jacobi–Perron algorithm (JPA) or modified Jacobi–Perron algorithm (MJPA) is optimal, where ω is an algebraic function (a formal Laurent series over a finite field) satisfying ω³+kω-1=0 or ω³+kdω-d=0. A result similar to the main result of Ito et al. [On simultaneous approximation to (α,α²) with α³+kα-1=0, J. Number Theory 99 (2003) 255–283] is obtained.     

2-Colored triangles in edge-colored complete graphs, II

The largest number n = n(k) for which there exists a k-coloring of the edges of k_n with every triangle 2-colored is found to be n(k) = 2^r5^m, where k = 2m + r and r = 0 or 1, and all such colorings are given. We also prove the best possible result that a k-colored K_p satisfying 1 < k < 1 + √p contains at most k − 2 vertices not in a bichromatic triangle.     

Behavior of Automorphic <Emphasis Type="Italic">L</Emphasis>-Functions at the Points s=1 and s=1/2

Let S_k(N)⁺ be the set of primitive cusp forms of even weight k for Γ₀(N) and let L(s, sym ²f) be the symmetric square L-function L(s, f) of a form f ∈ S_k(N)⁺. The moments of the variable L(1, sym ²f), f ∈ S₂(N)⁺, are computed for N = p, and the corresponding limiting distribution is determined in N-aspect. Let f ∈ S_k(1)⁺, g ∈ S_l(1)⁺, and ω_f = Γ(k - 1)/(4π)^k-1 〈f, f〉. Asymptotic formulas for and as k → ∞ are obtained. Bibliography: 17 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 302, 2003, pp. 149–167.     

Multi-Resolution Analysis of Multiplicity d: Applications to Dyadic Interpolation

This paper studies the Multi-Resolution Analyses of multiplicity d (d *), that is, the families (V_n)_n of closed subspaces in ²( ) such that V_n V_{n + 1}, V_{n + 1} = DV_n, where Dƒ(x) = ƒ(2x), and such that there exists a Riesz basis for V₀ of the form {φ_i(· − k), i = 1, . . . , d,k }, with φ₁, . . . , φ_d V₀. Using the Fourier transform, we prove that (λ) = ^t[ ₁(λ), . . . , _d(λ)] = H(λ/2) (λ/2), where H is in the set _d of continuous 1-periodic functions taking values in (d, ). If d = 1, the definition corresponds to the standard Multi-Resolution Analyses, and one can characterize the regular 1-periodic complex-valued functions H (called, then, scaling filters) which yield a Multi-Resolution Analysis. In this paper, we generalize this study to d ≥ 2 by giving conditions on H _d so that there exists = ^t[ ₁, . . . , _d] in ²( , ^d) solution of (λ) = H(λ/2) (λ/2), and so that the integer translates of φ₁, . . . , φ_d form a Riesz family. Then, the latter span the space V₀ of a Multi-Resolution Analysis of multiplicity d. We show that the conditions on H focus on the zeros of det H(·) and on simple spectral hypotheses for the operator P_H defined on _d by P_HF(λ) = H(λ/2)F(λ/2)H(λ/2)* + H(λ/2 + 1/2)F(λ/2 + 1/2)H(λ/2 + 1/2)*. Finally, we explore connections with the order r dyadic interpolation schemes, where r *.