On Kneser solutions of higher order nonlinear ordinary differential equations

The equationx ⁽ⁿ⁾(t)=(−1) ⁿ │x(t)│ ^k withk>1 is considered. In the casen≦4 it is proved that solutions defined in a neighbourhood of infinity coincide withC(t−t₀)^−n/(k−1), whereC is a constant depending only onn andk. In the general case such solutions are Kneser solutions and can be estimated from above and below by a constant times (t−t ₀)^−n/(k−1). It is shown that they do not necessarily coincide withC(t−t₀)^−n/(k−1). This gives a negative answer to two conjectures posed by Kiguradze that Kneser solutions are determined by their value in a point and that blow-up solutions have prescribed asymptotics. Dedicated to Professor Vladimir Maz'ya on the occasion of his 60th birthday. The author was supported by the Swedish Natural Science Research Council (NFR) grant M-AA/MA 10879-304.     

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^k n ^-a, whereP _n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x ²) ^k f ^(2k)(x)∈C[−1,1] is established. A similar result is shown forE _n(f)= ‖f−P _n‖ _C[−1,1]. Rates other thann ^-a are also discussed. Supported by NSERC grant A4816 of Canada.     

Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that

Asymptotic behavior of solutions to viscous conservation laws with slowly varying external forces

This paper considers the existence and large time behavior of solutions to the convection-diffusion equation u _t −Δu+b(x)·∇(u|u| ^{q −1})=f(x, t) in ℝ ⁿ ×[0,∞), where f(x, t) is slowly decaying and q≥1+1/n (or in some particular cases q≥1). The initial condition u ₀ is supposed to be in an appropriate L ^p space. Uniform and nonuniform decay of the solutions will be established depending on the data and the forcing term.This work is partially supported by an AMO Grant     

On the degree growth of birational mappings in higher dimension

Let ƒ be a birational map of C ^d ,and consider the degree complexity or asymptotic degree growth rate δ(ƒ) = lim_n → ∞ (deg(ƒⁿ))^1/n.We introduce a family of elementary maps, which have the form ƒ = L o J, where L is (invertible) linear, and J(x ₁ ⁻¹ ,..., x_d) = (x ₁ ⁻¹ ,...,x _d ⁻¹ .We develop a method of regularization and show how it can be used to compute δ for an elementary map.     

The perfectB-splines and a time-optimal control problem

Letx _v =cos (πν/n) (v=0, 1, …,n). It is shown that theB-splineM(x)=M(x; x ₀ ,x ₁ ,…, x _n ) is such thatM _n ⁽ⁿ⁾ (x) has a constant absolute value (=2 ⁿ⁻² (n−1)!) in [−1, 1]. Its integralf ₀(x)=∫ ₋₁ ^x M(t)dt is shown to have an optimal property that allows to solveexplicitly a certain time-optimal control problem.     

On the Greatest Common Divisor of u ? 1 and v ? 1 with u and v Near S{\cal S}-units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality gcd (f(n)aⁿ+g(n), f₁(n)bⁿ+g₁(n)) < exp(ne){\rm gcd}\, (f(n)a^n+g(n), f_1(n)b^n+g_1(n)) < \exp(n\varepsilon) holds for all but finitely many positive integers n.     

Explicit evaluations of Turán expressions

Summary Positive representations for [P _n ^(λ) (x)]²−P _n ^−1/(λ) (x)P _n ^+1/(λ) (x) and for analogous expressions involving orthogonal polynomials are obtained. This is an excerpt from the author's doctoral dissertation, written under the direction of ProfessorW. Seidel, to whom the author is grateful for his encouragement and assistance.     

Minimal full polarized embeddings of dual polar spaces

Let Δ be a thick dual polar space of rank n ≥ 2 admitting a full polarized embedding e in a finite-dimensional projective space Σ, i.e., for every point x of Δ, e maps the set of points of Δ at non-maximal distance from x into a hyperplane e∗(x) of Σ. Using a result of Kasikova and Shult [11], we are able the show that there exists up to isomorphisms a unique full polarized embedding of Δ of minimal dimension. We also show that e∗ realizes a full polarized embedding of Δ into a subspace of the dual of Σ, and that e∗ is isomorphic to the minimal full polarized embedding of Δ. In the final section, we will determine the minimal full polarized embeddings of the finite dual polar spaces DQ(2n,q), DQ ⁻(2n+1,q), DH(2n−1,q ²) and DW(2n−1,q) (q odd), but the latter only for n≤ 5. We shall prove that the minimal full polarized embeddings of DQ(2n,q), DQ ⁻(2n+1,q) and DH(2n−1,q ²) are the `natural' ones, whereas this is not always the case for DW(2n−1, q).B. De Bruyn: Postdoctoral Fellow of the Research Foundation - Flanders.     

On the values of the divisor function

For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we obtain lower and upper bounds for the average value of the ratio τ(n + 1)/τ(n) as n ranges through positive integers in the interval [1,x]. We also study the cardinality of the sets {τ(p − 1) : p ≤ x prime} and {τ(2ⁿ − 1) : n ≤ x}. Authors’ addresses: Florian Luca, Instituto de Matemáticas, Universidad Nacional Autónoma'de'México, C.P. 58089, Morelia, Michoacán, México; Igor E. Shparlinski, Department of Computing, Macquarie University, Sydney, NSW 2109, Australia     

Norm inequalities for a certain class of ∞ functions

In 1936 the author showed that the function sin(π(x+1)/4) is the entire function of least exponential type (=π/4) among all entire functionsf(z) with the property thatf ⁽ⁿ⁾(z) vanishes somewhere in the real interval [−1, 1] (n=0, 1,2,…). Now more precise results of this kind are obtained by working within the class ∞[−1, 1]. For Paul Montel on his 95th birthday     

On the weak non-defectivity of veronese embeddings of projective spaces

Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<( _n ^n+x ). Here we prove that the order x Veronese embedding ofP ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ singular at each point of S has dimension ( _n ^/n+x )−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I _2S (x)| has an ordinary double point at each P∈ S and Sing (F)=S. The author was partially supported by MIUR and GNSAGA of INdAM (Italy).     

Equations fonctionnelles et estimations de normes de matrices

We solve independently the equations 1/θ(x)θ(y)=ψ(x)−ψ(y)+φ(x−y)/θ(x−y) and 1/θ(x)θ(y)=σ(x)−σ(y)/θ(x−y)+τ(x)τ(y), τ(0)=0. In both cases we find θ²=aθ⁴+bθ²+c. We deduce estimates for the spectral radius of a matrix of type(1/θ(x _r −x _s )) (the accent meaning that the coefficients of the main diagonal are zero) and we study the case where thex _r are equidistant.

Dédié to à Monsieur le Professeur Otto Haupt à l'occasion de son cententiare avec les meilleurs voeux     

Characterizations of BMO associated with Gauss measures via commutators of local fractional integrals

Let dγ(x) ≡ π ^−n/2 e ^{−|x| 2} dx for all x ∈ ℝ ⁿ be the Gauss measure on ℝ ⁿ . In this paper, the authors establish the characterizations of the space BMO(γ) of Mauceri and Meda via commutators of either local fractional integral operators or local fractional maximal operators. To this end, the authors first prove that such a local fractional integral operator of order β is bounded from L ^p (γ) to L ^p/(1−pβ)(γ), or from the Hardy space H ¹(γ) of Mauceri and Meda to L ^1/(1−β)(γ) or from L ^1/β (γ) to BMO(γ), where β ∈ (0, 1) and p ∈ (1, 1/β).     

Propertyf −1(S) =g −1(S) for entire and meromorphicP-adic functions

LetW be an algebraically closed filed of characteristic zero, letK be an algebraically closed field of characteristic zero, complete for an ultrametric absolute value, and letA(K) (resp. ℳ(K)) be the set of entire (resp. meromorphic) functions inK. For everyn≥7, we show that the setS _n(b) of zeros of the polynomialx ⁿ−b (b≠0) is such that, iff, g ∈W[x] or iff, g ∈A(K), satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), thenf ⁿ=g ⁿ. For everyn≥14, we show thatS _n(b) is such that iff, g ∈W({tx}) or iff, g ∈ ℳ(K) satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), then eitherf ⁿ=g ⁿ, orfg is a constant. Analogous properties are true for complex entire and meromorphic functions withn≥8 andn≥15, respectively. For everyn≥9, we show that the setY _n(c) of zeros of the polynomial , (withc≠0 and 1) is an ursim ofn points forW[x], and forA(K). For everyn≥16, we show thatY _n(c) is an ursim ofn points forW(x), and for ℳ(K). We follow a method based on thep-adic Nevanlinna Theory and use certain improvement of a lemma obtained by Frank and Reinders.     

New degree bounds for polynomial threshold functions

A real multivariate polynomial p(x ₁, …, x _n ) is said to sign-represent a Boolean function f: {0,1} ⁿ →{−1,1} if the sign of p(x) equals f(x) for all inputs x∈{0,1} ⁿ . We give new upper and lower bounds on the degree of polynomials which sign-represent Boolean functions. Our upper bounds for Boolean formulas yield the first known subexponential time learning algorithms for formulas of superconstant depth. Our lower bounds for constant-depth circuits and intersections of halfspaces are the first new degree lower bounds since 1968, improving results of Minsky and Papert. The lower bounds are proved constructively; we give explicit dual solutions to the necessary linear programs.     

On the Greatest Common Di visor of u − 1 and v − 1 with u and v Near ${\cal S}$- units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality holds for all but finitely many positive integers n.     

On the difference between the number of prime divisors at consecutive integers

Suppose thatg(n) is equal to the number of divisors ofn, counting multiplicity, or the number of divisors ofn, a≠0 is an integer, andN(x,b)=|{n∶n≤x, g(n+a)−g(n)=b orb+1}|. In the paper we prove that sup _b N(x,b)≤C(a)x)(log log 10 _x )^−1/2 and that there exists a constantC(a,μ)>0 such that, given an integerb |b|≤μ(log logx)^1/2,x≥x _o, the inequalityN(x,b)≥C(a,μ)x(log logx(^−1/2) is valid. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 579–595, October, 1999.     

The Johnson–Lindenstrauss Lemma Almost Characterizes Hilbert Space, But Not Quite

Let X be a normed space that satisfies the Johnson–Lindenstrauss lemma (J–L lemma, in short) in the sense that for any integer n and any x ₁,…,x _n ∈X, there exists a linear mapping L:X→F, where F⊆X is a linear subspace of dimension O(log n), such that ‖x _i −x _j ‖≤‖L(x _i )−L(x _j )‖≤O(1)⋅‖x _i −x _j ‖ for all i,j∈{1,…,n}. We show that this implies that X is almost Euclidean in the following sense: Every n-dimensional subspace of X embeds into Hilbert space with distortion 2^2O(log*n)2^{2^{O(\log^{*}n)}} . On the other hand, we show that there exists a normed space Y which satisfies the J–L lemma, but for every n, there exists an n-dimensional subspace E _n ⊆Y whose Euclidean distortion is at least 2^Ω(α(n)), where α is the inverse Ackermann function.