Periodic and Homoclinic Solutions of Extended Fisher–Kolmogorov Equations

In this paper we study the existence of periodic solutions of the fourth-order equations u^iv − pu″ − a(x)u + b(x)u³ = 0 and u^iv − pu″ + a(x)u − b(x)u³ = 0, where p is a positive constant, and a(x) and b(x) are continuous positive 2L-periodic functions. The boundary value problems (P₁) and (P₂) for these equations are considered respectively with the boundary conditions u(0) = u(L) = u″(0) = u″(L) = 0. Existence of nontrivial solutions for (P₁) is proved using a minimization theorem and a multiplicity result using Clark's theorem. Existence of nontrivial solutions for (P₂) is proved using the symmetric mountain-pass theorem. We study also the homoclinic solutions for the fourth-order equation u^iv + pu″ + a(x)u − b(x)u² − c(x)u³ = 0, where p is a constant, and a(x), b(x), and c(x) are periodic functions. The mountain-pass theorem of Brezis and Nirenberg and concentration-compactness arguments are used.     

On Some Problems of P. Turán Concerning Lm Extremal Polynomials and Quadrature Formulas

The L_m extremal polynomials in an explicit form with respect to the weights (1−x)^−1/2 (1+x)^(m−1)/2 and (1−x)^(m−1)/2 (1+x)^−1/2 for even m are given. Also, an explicit representation for the Cotes numbers of the corresponding Turán quadrature formulas and their asymptotic behavior is provided.     

On generalized Hadamard matrices of minimum rank

Generalized Hadamard matrices of order qⁿ⁻¹ (q—a prime power, n2) over GF(q) are related to symmetric nets in affine 2-(qⁿ,qⁿ⁻¹,(qⁿ⁻¹−1)/(q−1)) designs invariant under an elementary abelian group of order q acting semi-regularly on points and blocks. The rank of any such matrix over GF(q) is greater than or equal to n−1. It is proved that a matrix of minimum q-rank is unique up to a monomial equivalence, and the related symmetric net is a classical net in the n-dimensional affine geometry AG(n,q).     

Crooked binomials

A function f : GF(2 ^r ) → GF(2 ^r ) is called crooked if the sets {f(x) + f(x + a)|x ∈ GF(2 ^r )} is an affine hyperplane for any nonzero a ∈ GF(2 ^r ). We prove that a crooked binomial function f(x) = x ^d + ux ^e defined on GF(2 ^r ) satisfies that both exponents d, e have 2-weights at most 2.      

Estimates of Freud-Christoffel functions for some weights with the whole real line as support

Upper and lower bounds for generalized Christoffel functions, called Freud-Christoffel functions, are obtained. These have the form λ_n,p(W,j,x) = infPW_Lp(R)/|P^(j)(X)| where the infimum is taken over all polynomials P(x) of degree at most n − 1. The upper and lower bounds for λ_n,p(W,j,x) are obtained for all 0 < p ∞ and J = 0, 1, 2, 3,… for weights W(x) = exp(−Q(x)), where, among other things, Q(x) is bounded in [− A, A], and Q″ is continuous in β(−A, A) for some A > 0. For p = ∞, the lower bounds give a simple proof of local and global Markov-Bernstein inequalities. For p = 2, the results remove some restrictions on Q in Freud's work. The weights considered include W(x) = exp(− ¦x¦^α/2), α > 0, and W(x) = exp(− exp(¦x¦)), > 0.     

Recursive constructions of -polynomials over

This paper presents procedures for constructing irreducible polynomials over GF(2^s) with linearly independent roots (or normal polynomials or N-polynomials). For a suitably chosen initial N-polynomial F₀(x)GF(2^s) of degree n, polynomials F_k(x)GF(2^s) of degrees n2^k are constructed by iteratively applying the transformation x→x+x^-1, and their roots are shown to form a normal basis of GF(2^sn2k) over GF(2^s). In addition, the sequences are shown to be trace compatible, i.e., the trace map T_{GF(2^sn2k+1)/GF(2^sn2k)} fromGF(2^sn2k+1) onto GF(2^sn2k) maps the roots of F_k+1(x) onto those of F_k(x).     

On the convergence of averaging Hermite interpolators

We investigate two sequences of polynomial operators, H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x), of degrees 2n − 2 and 2n − 3, respectively, defined by interpolatory conditions similar to those of the classical Hermite-Féjer interpolators H_{2n − 1}(f, x). If H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x) are based on the zeros of the jacobi polynomials P_n^(α,β)(x), their convergence behaviour is similar to that of H_{2n − 1}(f;, x). If they are based on the zeros of (1 − x²)T_{n − 2}(x), their convergence behaviour is better, in some sense, than that of H_{2n − 1}(f, x).     

Estimates for the first and second derivatives of the Stieltjes polynomials

Let w_λ(x)(1−x²)^λ−1/2 and P_n^(λ) be the ultraspherical polynomials with respect to w_λ(x). Then we denote E_n+1^(λ) the Stieltjes polynomials with respect to w_λ(x) satisfyingIn this paper, we give estimates for the first and second derivatives of the Stieltjes polynomials E_n+1^(λ) and the product E_n+1^(λ)P_n^(λ) by obtaining the asymptotic differential relations. Moreover, using these differential relations we estimate the second derivatives of E_n+1^(λ)(x) and E_n+1^(λ)(x)P_n^(λ)(x) at the zeros of E_n+1^(λ)(x) and the product E_n+1^(λ)(x)P_n^(λ)(x), respectively.     

Summability of orthogonal expansions of several variables

Summability of spherical h-harmonic expansions with respect to the weight function ∏_j=1^d |x_j|^2κ_j (κ_j0) on the unit sphere S^d−1 is studied. The main result characterizes the critical index of summability of the Cesàro (C,δ) means of the h-harmonic expansion; it is proved that the (C,δ) means of any continuous function converge uniformly in the norm of C(S^d−1) if and only if δ>(d−2)/2+∑_j=1^d κ_j−min_1jd κ_j. Moreover, it is shown that for each point not on the great circles defined by the intersection of the coordinate planes and S^d−1, the (C,δ) means of the h-harmonic expansion of a continuous function f converges pointwisely to f if δ>(d−2)/2. Similar results are established for the orthogonal expansions with respect to the weight functions ∏_j=1^d |x_j|^2κ_j(1−|x|²)^μ−1/2 on the unit ball B^d and ∏_j=1^d x_j^κ_j−1/2(1−|x|₁)^μ−1/2 on the simplex T^d. As a related result, the Cesàro summability of the generalized Gegenbauer expansions associated to the weight function |t|^2μ(1−t²)^λ−1/2 on [−1,1] is studied, which is of interest in itself.     

Necessary and sufficient conditions for functions involving the tri- and tetra-gamma functions to be completely monotonic

The psi function ψ(x) is defined by ψ(x)=Γ^′(x)/Γ(x), where Γ(x) is the gamma function. We give necessary and sufficient conditions for the function ψ^″(x)+[ψ^′(x+α)]² or its negative to be completely monotonic on (−α,∞), where . We also prove that the function [ψ^′(x)]²+λψ^″(x) is completely monotonic on (0,∞) if and only if λ1. As an application of the latter conclusion, the monotonicity and convexity of the function e^pψ(x+1)−qx with respect to x(−1,∞) are thoroughly discussed for p≠0 and .     

Admissibility and complete class results for the multinomial estimation problem with entropy and squared error loss

Let X ≡ (X₁, …, X_t) have a multinomial distribution based on N trials with unknown vector of cell probabilities p ≡ (p₁, …, p_t). This paper derives admissibility and complete class results for the problem of simultaneously estimating p under entropy loss (EL) and squared error loss (SEL). Let and f(x¦p) denote the (t − 1)-dimensional simplex, the support of X and the probability mass function of X, respectively. First it is shown that δ is Bayes w.r.t. EL for prior P if and only if δ is Bayes w.r.t. SEL for P. The admissible rules under EL are proved to be Bayes, a result known for the case of SEL. Let Q denote the class of subsets of of the form T = _j=1^kF_j where k ≥ 1 and each F_j is a facet of which satisfies: F a facet of such that F naF_jF ncT. The minimal complete class of rules w.r.t. EL when N ≥ t − 1 is characterized as the class of Bayes rules with respect to priors P which satisfy P( ⁰) = 1, ξ(x) ≡ ∫ f(x¦p) P(dp) > 0 for all x in {x : sup ^₀ f(x¦p) > 0} for some ⁰ in Q containing all the vertices of . As an application, the maximum likelihood estimator is proved to be admissible w.r.t. EL when the estimation problem has parameter space Θ = but it is shown to be inadmissible for the problem with parameter space Θ = ( minus its vertices). This is a severe form of “tyranny of boundary.” Finally it is shown that when N ≥ t − 1 any estimator δ which satisfies δ(x) > 0 x is admissible under EL if and only if it is admissible under SEL. Examples are given of nonpositive estimators which are admissible under SEL but not under EL and vice versa.     

A connection between a generalized Pascal matrix and the hypergeometric function

The n × n generalized Pascal matrix P(t) whose elements are related to the hypergeometric function ₂F₁(a, b; c; x) is presented and the Cholesky decomposition of P(t) is obtained. As a result, it is shown that

Full-size image

is the solution of the Gauss's hypergeometric differential equation,

x(1 − x)y″ + [1 + (a + b − 1)x]y′ − ABY = 0

. where a and b are any nonnegative integers. Moreover, a recurrence relation for generating the elements of P(t) is given.     

Nonlinear equations with mixed derivatives

The nonlinear hyperbolic equation ∂²u(x, y)/∂x ∂y + g(x, y)f(u(x, y)) = 0 with u(x, 0) = φ(x) and u(0, y) = Ψ(y), considered by [1.], 31–45) under appropriate smoothness conditions, is solvable by the author's decomposition method (“Stochastic Systems,” Academic Press, 1983 and “Nonlinear Stochastic Operator Equations,” Academic Press, 1986).     

Lacunary Quadrature Formulae and Interpolation Singularity

Birkholl quadrature formulae (q.f.), which have algebraic degree of precision (ADP) greater than the number of values used, are studied. In particular, we construct a class of quadrature rules of ADP = 2n + 2r + 1 which are based on the information {ƒ^(j)(−1), ƒ^(j)(−1), j = 0, ..., r − 1 ; ƒ(x_i), ƒ^(2m)(x_i), i = 1, ..., n}, where m is a positive integer and r = m, or r = m − 1. It is shown that the corresponding Birkhoff interpolation problems of the same type are not regular at the quadrature nodes. This means that the constructed quadrature formulae are not of interpolatory type. Finally, for each In, we prove the existence of a quadrature formula based on the information {ƒ(x_i), ƒ^(2m)(x_i), i = 1, ..., 2m}, which has algebraic degree of precision 4m + 1.     

Global bifurcation of a class of periodic boundary-value problems

We prove that λ=0 is a global bifurcation point of the second-order periodic boundary-value problem (p(t)x^′(t))^′−λx(t)−λ²x^′(t)−f(t,x(t),x^′(t),x^″(t));x(0)=x(1),x^′(0)=x^′(1). We study this equation under hypotheses for which it may be solved explicitly for x^″(t). However, it is shown that the explicitly solved equation does not satisfy the usual conditions that are sufficient to conclude global bifurcation. Thus, we need to study the implicit equation with regard to global bifurcation.     

On the Behaviour of Zeros of Jacobi Polynomials

Denote by x_n,k(α,β) and x_n,k(λ)=x_n,k(λ−1/2,λ−1/2) the zeros, in decreasing order, of the Jacobi polynomial P^(α,β)_n(x) and of the ultraspherical (Gegenbauer) polynomial C^λ_n(x), respectively. The monotonicity of x_n,k(α,β) as functions of α and β, α,β>−1, is investigated. Necessary conditions such that the zeros of P^(a,b)_n(x) are smaller (greater) than the zeros of P^(α,β)_n(x) are provided. A. Markov proved that x_n,k(a,b)<x_n,k(α,β) (x_n,k(a,b)>x_n,k(α,β)) for every n and each k, 1kn if a>α and b<β (a<α and b>β). We prove the converse statement of Markov's theorem. The question of how large the function f_n(λ) could be such that the products f_n(λ)x_n,k(λ), k=1,…,[n/2] are increasing functions of λ, for λ>−1/2, is also discussed. Elbert and Siafarikas proved that f_n(λ)=(λ+(2n²+1)/(4n+2))^1/2 obeys this property. We establish the sharpness of their result.     

Minimal cyclic codes of length pq

Explicit expressions for all the 3n+2 primitive idempotents in the ring R_pⁿq=GF(ℓ)[x]/(x^pnq−1), where p,q,ℓ are distinct odd primes, ℓ is a primitive root modulo pⁿ and q both, , are obtained. The dimension, generating polynomials and the minimum distance of the minimal cyclic codes of length pⁿq over GF(ℓ) are also discussed.     

Compact causal data interpolation

Consider a Hilbert space equipped with a time-structure, i.e., a resolution E of the identity on defined on subsets of some linearly ordered set Λ. For which x and y in is it possible to find a causal (time respecting) compact operator T, so that Tx = y? When T is required to be a Hilbert-Schmidt operator and (Λ, E) is sufficiently regular, this question is answered in terms of the “time-densities” of x and y. The condition is that the integral ∝_gLμ_x({s t})⁻¹ dμ_y(t) should be finite, where μ_x and μ_y are the measures on Λ given by μ_x(Ω) = ¦|E(Ω)x¦|² and μ_y(Ω) = ¦|E(Ω)y¦|². Further a solution is given for the related problem of minimizing the sum of ¦|Tx − y¦|² and the squared Hilbert-Schmidt norm ¦|R¦|₂² of T.     

Reed-Muller codes and Barnes-Wall lattices: Generalized multilevel constructions and representation over GF(2<Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>)

Generalized multilevel constructions for binary RM(r,m) codes using projections onto GF(2 ^q ) are presented. These constructions exploit component codes over GF(2), GF(4),..., GF(2 ^q ) that are based on shorter Reed-Muller codes and set partitioning using partition chains of length-2 ^l codes. Using these constructions we derive multilevel constructions for the Barnes-Wall Λ(r,m) family of lattices which also use component codes over GF(2), GF(4),..., GF(2 ^q ) and set partitioning based on partition chains of length-2 ^l lattices. These constructions of Reed-Muller codes and Barnes-Wall lattices are readily applicable for their efficient decoding.      

Singular Perturbation Theory for a Class of Fredholm Integral Equations Arising in Random Fields Estimation Theory

A basic integral equation of random fields estimation theory by the criterion of minimum of variance of the estimation error is of the form Rh = f, where and R(x, y) is a covariance function.The singular perturbation problem we study consists of finding the asymptotic behavior of the solution to the equation as 0.$$" align="middle" border="0"> The domain D can be an interval or a domain in Rⁿ, n > 1. The class of operators R is defined by the class of their kernels R(x,y) which solve the equation Q(x, D_x)R(x, y) = P(x, D_x)δ(x − y), where Q(x, D_x) and Px, D_x) are elliptic differential operators.