A note on the oscillatory property for nonlinear difference equations and differential equations

Criteria are given to determine the oscillatory property of solutions of the nonlinear difference equation: Δ^du_n + ∑_{i = 1}^mp_inf_i(u_n, Δu_n,…,Δ^{d ? 1}u_n) = 0, n = 0, 1, 2,…, where d is an arbitrary integer, generalizing results that have been obtained by B. Szmanda (J. Math. Anal. Appl.79 (1981), 90–95) for d = 2. Analogous results are given for the differential equation: u^(d) + ∑_{i = 1}^mp_i(t)f_i(u, u′,…, u^{(d ? 1)}) = 0, t ? t₀, which coincide with the criteria given by 2., 3., 599–602) and 4., 5., 6., 715–719) for the case m = 1.     

Positivity, local smoothing, and Harnack inequalities for very fast diffusion equations

We investigate qualitative properties of local solutions u(t,x)?0 to the fast diffusion equation, t_∂u=Δ(um)/m with m<1, corresponding to general nonnegative initial data. Our main results are quantitative positivity and boundedness estimates for locally defined solutions in domains of the form [0,T]×Ω, with Ω⊆Rd. They combine into forms of new Harnack inequalities that are typical of fast diffusion equations. Such results are new for low m in the so-called very fast diffusion range, precisely for all m?mc=(d−2)/d. The boundedness statements are true even for m?0, while the positivity ones cannot be true in that range.     

On a nonlocal problem for semilinear differential equations with upper semicontinuous nonlinearities in general Banach spaces

Sufficient conditions on the existence of mild solutions for the following semilinear nonlocal evolution inclusion with upper semicontinuous nonlinearity: u^′(t)∈A(t)u(t)+F(t,u(t)), 0<t?d, u(0)=g(u), are given when g is completely continuous and Lipschitz continuous in general Banach spaces, respectively. An example concerning the partial differential equation is also presented.     

Convergence of the Kato approximants for evolution equations involving functional perturbations

The existence of a unique strong solution of the nonlinear abstract functional differential equation $\text{u′(t) + A(t)u(t) = F(t,u}{}_{\mathrm{t}}\text{), u}{}_0\text{= φεC}{}^1\text{(¦?r,0¦,X),tε¦0, T¦}$, (E) is established. X is a Banach space with uniformly convex dual space and, for $\text{t? ¦0, T¦, A(t)}$ is m-accretive and satisfies a time dependence condition suitable for applications to partial differential equations. The function F satisfies a Lipschitz condition. The novelty of the paper is that the solution u(t) of (E) is shown to be the uniform limit (as n → ∞) of the sequence u_n(t), where the functions u_n(t) are continuously differentiate solutions of approximating equations involving the Yosida approximants. Thus, a straightforward approximation scheme is now available for such equations, in parallel with the approach involving the use of nonlinear evolution operator theory.     

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic sequences whose general term has the form un=an(n+t)+b with (a,t,b)∈Z³, a?5, t?0, gcd(a,b)=1. From this, we deduce for instance the lower bound: lcm{¹²+1,²²+1,…,n²+1}?0,32n(1,442) (for all n?1). In the last part of this article, we study the integer lcm(n,n+1,…,n+k) (k∈N, n∈N^∗). We show that it has a divisor dn,k simple in its dependence on n and k, and a multiple mn,k also simple in its dependence on n. In addition, we prove that both equalities: lcm(n,n+1,…,n+k)=dn,k and lcm(n,n+1,…,n+k)=mn,k hold for an infinitely many pairs (n,k).     

Optimal interleaving schemes for correcting two-dimensional cluster errors

We present an elementary theory of optimal interleaving schemes for correcting cluster errors in two-dimensional digital data. It is assumed that each data page contains a fixed number of, say n, codewords with each codeword consisting of m code symbols and capable of correcting a single random error (or erasure). The goal is to interleave the codewords in the m×n array such that different symbols from each codeword are separated as much as possible, and consequently, an arbitrary error burst with size up to t can be corrected for the largest possible value of t. We show that, for any given m, n, the maximum possible interleaving distance, or equivalently, the largest size of correctable error bursts in an m×n array, is given by if n?⌈m²/2⌉, and t=m+⌊(n-⌈m²/2⌉)/m⌋ if n?⌈m²/2⌉. Furthermore, we develop a simple cyclic shifting algorithm that can provide a systematic construction of an m×n optimal interleaving array for arbitrary m and n. This extends important earlier work on the complementary problem of constructing interleaving arrays that, given the burst size t, minimize the interleaving degree, that is, the number of different codewords in a 2-D (or 3-D) array such that any error burst with given size t can be corrected. Our interleaving scheme thus provides the maximum burst error correcting power without requiring prior knowledge of the size or shape of an error burst.     

Limit Theory for Moderate Deviations from a Unit Root Under Innovations with a Possibly Infinite Variance

An asymptotic theory was given by Phillips and Magdalinos (J Econom 136(1):115–130, 2007) for autoregressive time series Y _t ?=?ρY _t?1?+?u _t , t?=?1,...,n, with ρ?=?ρ _n ?=?1?+?c/k _n , under (2?+?δ)-order moment condition for the innovations u _t , where δ?>?0 when c?<?0 and δ?=?0 when c?>?0, {u _t } is a sequence of independent and identically distributed random variables, and (k _n ) _n?∈?? is a deterministic sequence increasing to infinity at a rate slower than n. In the present paper, we established similar results when the truncated second moment of the innovations $l(x)=\textsf{E} [u_1^2I\{|u_1|\le x\}]$ is a slowly varying function at ∞, which may tend to infinity as x?→?∞. More interestingly, we proposed a new pivotal for the coefficient ρ in case c?<?0, and formally proved that it has an asymptotically standard normal distribution and is nuisance parameter free. Our numerical simulation results show that the distribution of this pivotal approximates the standard normal distribution well under normal innovations.     

On the null-controllability of nonlinear delay systems with restrained controls

Sufficient conditions are developed for the null-controllability of the nonlinear delay process (1) $\text{x}\text{?}\text{(t) = L(t, x}{}_{\mathrm{t}}\text{) + B(t) u(t) + f(t, x}{}_{\mathrm{t}}\text{, u(t))}$ when the values of the control functions u lie in an m-dimensional unit cube C^m of E^m. Conditions are placed on f which guarantee that if the uncontrolled system $\text{x}\text{?}\text{(t) = L(t, x}{}_{\mathrm{t}}\text{)}$ is uniformly asymptotically stable and if the linear control system x(t) = L(t, x_t) + B(t) u(t) is proper, then (1) is null-controllable.     

On the Fourier transforms of retarded Lorentz-invariant functions

In this article we evaluate the Fourier transforms of retarded Lorentz-invariant functions (and distributions) as limits of Laplace transforms. Our method works generally for any retarded Lorentz-invariant functions φ(t) (t?Rⁿ) which is, besides, a continuous function of slow growth. We give, among others, the Fourier transform of G_R(t, α, m², n) and G_A(t, α, m², n), which, in the particular case α = 1, are the characteristic functions of the volume bounded by the forward and the backward sheets of the hyperboloid u = m² and by putting α = ?k are the derivatives of k-order of the retarded and the advanced-delta on the hyperboloid u = m². We also obtain the Fourier transform of the function W(t, α, m², n) introduced by M. Riesz (Comm. Sem. Mat. Univ. Lund4 (1939)). We finish by evaluating the Fourier transforms of the distributional functions G_R(t, α, m², n), G_A(t, α, m², n) and W(t, α, m², n) in their singular points.     

Construction of generators of quasi-interpolation operators of high approximation orders in spaces of polyharmonic splines

The paper presents a simple procedure for the construction of quasi-interpolation operators in spaces of m-harmonic splines in R^d, which reproduce polynomials of high degree. The procedure starts from a generator ?₀, which is easy to derive but with corresponding quasi-interpolation operator reproducing only linear polynomials, and recursively defines generators ?₁,?₂,…,?_m−1 with corresponding quasi-interpolation operators reproducing polynomials of degree up to 3,5,…,2m−1 respectively. The construction of ?_j from ?_j−1 is explicit, simple and independent of m. The special case d=1 and the special cases d=2,m=2,3,4 are discussed in details.     

On the log-concavity of Hilbert series of Veronese subrings and Ehrhart series

For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write ${\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}}For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write \frach(t)(1 - t)^{d + 1}=?_{m 3 0} g(m)  t^m{\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}} , for some polynomial g(m) with rational coefficients, then \fracU_nh(t)(1- t)^d+1 = ?_{m 3 0}g(nm)  t^m{\frac{{\rm{U}}_{n}h(t)}{(1- t)^{d+1}} = \sum_{m \geq 0}g(nm) \, t^{m}} . We show that there exists a positive integer n _d , depending only on d, such that if h(t) is a polynomial of degree at most d with nonnegative integer coefficients and h(0) = 1, then for n ≥ n _d , U _n h(t) has simple, real, negative roots and positive, strictly log concave and strictly unimodal coefficients. Applications are given to Ehrhart δ-polynomials and unimodular triangulations of dilations of lattice polytopes, as well as Hilbert series of Veronese subrings of Cohen–Macauley graded rings.     

On the Cauchy problem for some abstract nonlinear differential equations

In the present paper, we study the Cauchy problem in a Banach spaceE for an abstract nonlinear differential equation of form $$\frac{{d^2 u}}{{dt^2 }} = - A\frac{{du}}{{dt}} + B(t)u + f(t,W)$$ whereW = (A ₁(t)u,A ₂(t)u,?,A _?(t)u), (A _i (t),i = 1, 2, ?,?), (B(t),t ∈I = [0,b]) are families of closed operators defined on dense sets inE intoE, f is a given abstract nonlinear function onI ×E ^? intoE and ?A is a closed linear operator defined on dense set inE intoE, which generates a semi-group. Further, the existence and uniqueness of the solution of the considered Cauchy problem is studied for a wide class of the families (A _i(t),i = 1, 2, ?,?), (B(t),t ∈I). An application and some properties are also given for the theory of partial diferential equations.     

New solitary-wave special solutions with compact support for the nonlinear dispersive K(m,n) equations

The genuinely nonlinear dispersive K(m,n) equation, u_t+(u^m)_x+(uⁿ)_xxx=0, which exhibits compactons: solitons with compact support, is investigated. New solitary-wave solutions with compact support are developed. The specific cases, K(2,2) and K(3,3), are used to illustrate the pertinent features of the proposed scheme. An entirely new general formula for the solution of the K(m,n) equation is established, and the existing general formula is modified as well.     

Global solutions of the fast diffusion equation with gradient absorption terms

We investigate the existence of nonnegative weak solutions to the problem ut=Δ(um)−p|∇u| in Rn×(0,∞) with ⁺(1−2/n)<m<1. It will be proved that: (i) When 1<p<2, if the initial datum u₀∈D(Rn) then there exists a solution; (ii) When 1<p<(2+mn)/(n+1), if the initial datum u₀(x) is a bounded and nonnegative measure then the solution exists; (iii) When (2+mn)/(n+1)?p<2, if the initial datum is a Dirac mass then the solution does not exist. We also study the large time behavior of the L¹-norm of solutions for 1<p?(2+mn)/(n+1), and the large time behavior of t1/β‖u(⋅,t)−Ec(⋅,t)L^∞_‖ for (2+mn)/(n+1)<p<2.     

Estimates of derivatives of random functions I

If one looks for an optimal (by criterion of minimal variance) linear estimate of s′(t) from the observation of u(t) = s(t) + n(t), where n(t) is noise and s(t) is useful signal, then one can derive an integral equation for the weight function of optimal estimate. This integral equation is often difficult to solve and, even if one can solve it, it is difficult to construct the corresponding filter. In this paper an optimal estimate of s′ on a subset of all linear estimates in sought and it is shown that this quasioptimal estimate is easy to calculate, the corresponding filter is easy to construct, and the error of this estimate differs little from the error of optimal estimates. It is also shown that among all estimates (linear and nonlinear) of s′ for ∥n∥ ? δ and ∥s″∥ ? M the best estimate is given by Δ_hu = (2h)^?1 [u(t + h) ? u(t ? h)] with $\text{h = (}\text{2δ}\text{M}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$.     

Existence results for some polyharmonic problems in the half-space

We study the existence of positive solutions of the m-polyharmonic nonlinear elliptic equation m(−Δ)u+f(⋅,u)=0 in the half-space , n?2 and m?1. Our purpose is to give two existence results for the above equation subject to some boundary conditions, where the nonlinear term f(x,t) satisfies some appropriate conditions related to a certain Kato class of functions .     

Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces

Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions ((n, m, t) functions) by using a class of binary disjoint codes, a construction which was introduced in IEEE Trans. Inform. Theory, Vol. IT-49 (2) (2003). Our main contribution concerns the generation of suitable sets of such disjoint codes. We propose a deterministic method for finding disjoint codes of length ν m by considering the points of PG ). We then obtain some lower bounds on the number of disjoint codes, by fixing some parameters. Through these sets, we deduce in certain cases the existence of resilient functions with very high nonlinearity values. We show how, thanks to our method, the degree and the differential properties of (n, m, t) functions can be improved.Communicated by: J.D. Key     

Group classification of differential-difference equations: Low-dimensional Lie algebras

Differential-difference equations of the form u? _n = F _n (t, u_n?1, u _n , u_n+1, u?_n?1, u? _n , u?_n+1) are classified according to their intrinsic Lie point symmetries, equivalence group and some low-dimensional Lie algebras including the Abelian symmetry algebras, nilpotent nonAbelian symmetry algebras, solvable symmetry algebras with nonAbelian nilradicals, solvable symmetry algebras with Abelian nilradicals and nonsolvable symmetry algebras. Here F _n is a nonlinear function of its arguments and the dot over u denotes differentiation with respect to t.     

Mutually independent bipanconnected property of hypercube

A graph is denoted by G with the vertex set V(G) and the edge set E(G). A path P = 〈v₀, v₁, … , v_m〉 is a sequence of adjacent vertices. Two paths with equal length P₁ = 〈 u₁, u₂, … , u_m〉 and P₂ = 〈 v₁, v₂, … , v_m〉 from a to b are independent if u₁ = v₁ = a, u_m = v_m = b, and u_i ≠ v_i for 2 ? i ? m − 1. Paths with equal length from a to b are mutually independent if they are pairwisely independent. Let u and v be two distinct vertices of a bipartite graph G, and let l be a positive integer length, d_G(u, v) ? l ? ∣V(G) − 1∣ with (l − d_G(u, v)) being even. We say that the pair of vertices u, v is (m, l)-mutually independent bipanconnected if there exist m mutually independent paths with length l from u to v. In this paper, we explore yet another strong property of the hypercubes. We prove that every pair of vertices u and v in the n-dimensional hypercube, with d_Qn(u,v)?n-1, is (n − 1, l)-mutually independent bipanconnected for every with (l-d_Qn(u,v)) being even. As for d_Qn(u,v)?n-2, it is also (n − 1, l)-mutually independent bipanconnected if l?d_Qn(u,v)+2, and is only (l, l)-mutually independent bipanconnected if l=d_Qn(u,v).     

A convergent two-time method for periodic differential equations

Two timing, an ad hoc method for studying periodic evolution equations, can be given a rigorous justification when the problem is in standard form, u = ?f(t, u). First solve $\text{dw}\text{dσ}\text{= ?(I ? M) f(σ, w)}\text{for}\text{w(σ, v)}$, where M is the mean value operator and v is any initial value. Then w(σ, v) is periodic in σ but does not satisfy the original equation. Now, force a solution u(t), using nonlinear variation of constants, in the form w(σ, v(τ)), where σ = t is the fast time and τ = ?t is the slow time. With the resulting differential equation for v, one reads off from its nonconstant solutions thè approximate transient behavior of u(t) for times of order ?^?1. On the other hand, the equilibrium points (constant solutions) v₀ correspond to steady state (periodic solutions) of the original system. Interesting applications, such as to one-dimensional wave equations with cubic damping, can be given.