Well-posedness of the fourth-order perturbed Schrödinger type equation in non-isotropic Sobolev spaces

In this paper we study the Cauchy problem of the non-isotropically perturbed fourth-order nonlinear Schrödinger type equation: ((x₁,x₂,…,xn)∈Rn, t?0), where a is a real constant, 1?d<n is an integer, g(x,|u|)u is a nonlinear function which behaves like α|u|u for some constant α>0. By using Kato method, we prove that this perturbed fourth-order Schrödinger type equation is locally well-posed with initial data belonging to the non-isotropic Sobolev spaces provided that s₁,s₂ satisfy the conditions: s₁?0, s₂?0 for or for with some additional conditions. Furthermore, by using non-isotropic Sobolev inequality and energy method, we obtain some global well-posedness results for initial data belonging to non-isotropic Sobolev spaces .     

The asymptotic number of spanning trees in circulant graphs

Let T(G) be the number of spanning trees in graph G. In this note, we explore the asymptotics of T(G) when G is a circulant graph with given jumps.The circulant graph is the 2k-regular graph with n vertices labeled 0,1,2,…,n−1, where node i has the 2k neighbors i±s₁,i±s₂,…,i±s_k where all the operations are . We give a closed formula for the asymptotic limit as a function of s₁,s₂,…,s_k. We then extend this by permitting some of the jumps to be linear functions of n, i.e., letting s_i, d_i and e_i be arbitrary integers, and examining

     

A simple proof for a theorem of Luxemburg and Zaanen

In this paper a simple proof for the following theorem, due to Luxemburg and Zaanen is given: an Archimedean vector lattice A is Dedekind σ-complete if and only if A has the principal projection property and A is uniformly complete. As an application, we give a new and short proof for the following version of Freudenthal's spectral theorem: let A be a uniformly complete vector lattice with the principal projection property and let 0<u∈A. For any element w in A such that 0?w?u there exists a sequence in A which satisfies , where each element sn is of the form , with real numbers α₁,…,αk such that 0?αi?1 (i=1,…,k) and mutually disjoint components p₁,…,pk of u.     

Monotonicity of zeros of Laguerre-Sobolev-type orthogonal polynomials

Denote by , k=1,…,n, the zeros of the Laguerre-Sobolev-type polynomials orthogonal with respect to the inner product

     

Weak and strong convergence theorems for finite families of asymptotically nonexpansive mappings in Banach spaces

Let E be a real uniformly convex Banach space whose dual space E^∗ satisfies the Kadec-Klee property, K be a closed convex nonempty subset of E. Let be asymptotically nonexpansive mappings of K into E with sequences (respectively) satisfying kin→1 as n→∞, i=1,2,…,m, and . For arbitrary ?∈(0,1), let be a sequence in [?,1−?], for each i∈{1,2,…,m} (respectively). Let {xn} be a sequence generated for m?2 by

     

On directional blow-up for quasilinear parabolic equations with fast diffusion

We discuss blow-up at space infinity of solutions to quasilinear parabolic equations of the form ut=Δ?(u)+f(u) with initial data u₀∈L^∞(RN), where ? and f are nonnegative functions satisfying ?^″?0 and . We study nonnegative blow-up solutions whose blow-up times coincide with those of solutions to the O.D.E. v^′=f(v) with initial data ‖u_0‖L^∞(RN). We prove that such a solution blows up only at space infinity and possesses blow-up directions and that they are completely characterized by behavior of initial data. Moreover, necessary and sufficient conditions on initial data for blow-up at minimal blow-up time are also investigated.     

The oscillation of differential transforms - entire Jacobi expansions

Let L=(1−x²)D²−((β−α)−(α+β+2)x)D with , and . Let f∈C^∞[−1,1], , with normalized Jacobi polynomials and the Cn decrease sufficiently fast. Set Lk=L(Lk−1), k?2. Let ρ>1. If the number of sign changes of (Lkf)(x) in (−1,1) is O(k1/(ρ+1)), then f extends to be an entire function of logarithmic order . For Legendre expansions, the result holds with replaced with .     

A free boundary problem for p-Laplacian in the plane

We consider the following free boundary problem in an unbounded domain Ω in two dimensions: Δpu=0 in Ω, on J₀, on J₁, where ∂Ω=J₀∪J₁. We prove that if 0<u<1 in Ω, Ji is the graph of a function in and gi is a constant for each i=0,1, then the free boundary ∂Ω must be two parallel straight lines and the solution u must be a linear function. The proof is based on maximum principle.     

Approximation of common fixed points for finite families of nonself asymptotically nonexpansive mappings in Banach spaces

Let E be a real uniformly convex Banach space, K be a closed convex nonempty subset of E which is also a nonexpansive retract with retraction P. Let be asymptotically nonexpansive mappings of K into E with sequences (respectively) satisfying kin→1 as n→∞, i=1,2,…,m, and . Let be a sequence in [?,1−?],?∈(0,1), for each i∈{1,2,…,m} (respectively). Let {xn} be a sequence generated for m?2 by

     

Large deviations for martingales and derivatives

Fix a sequence of positive integers (mn) and a sequence of positive real numbers (wn). Two closely related sequences of linear operators (Tn) are considered. One sequence has given by the Lebesgue derivatives . The other sequence has given by the dyadic martingale when (l−1)/n²?x<l/n² for l=1,…,n². We prove both positive and negative results concerning the convergence of .     

Divisors of the number of Latin rectangles

A k×n Latin rectangle on the symbols {1,2,…,n} is called reduced if the first row is (1,2,…,n) and the first column is T(1,2,…,k). Let Rk,n be the number of reduced k×n Latin rectangles and m=⌊n/2⌋. We prove several results giving divisors of Rk,n. For example, (k−1)! divides Rk,n when k?m and m! divides Rk,n when m<k?n. We establish a recurrence which determines the congruence class of for a range of different t. We use this to show that Rk,n≡((−1)^k−1(k−1)!)ⁿ⁻¹. In particular, this means that if n is prime, then Rk,n≡1 for 1?k?n and if n is composite then if and only if k is larger than the greatest prime divisor of n.     

The utilization of total mass to determine the switching points in the symmetric boundary control problem with a linear reaction term

The authors study the problem , and u(0,t)=u(1,t)=ψ(t), where ψ(t)=u₀ for t2k<t<t2k+1 and ψ(t)=0 for , with t₀=0 and the sequence tk is determined by the equations , for , and , for k=2,4,6,… and where 0<m<M. Note that the switching points , are unknown. Existence and uniqueness are demonstrated. Theoretical estimates of the tk and tk+1−tk are obtained and numerical verifications of the estimates are presented. The case of ux(0,t)=ux(1,t)=ψ(t) is also considered and analyzed.     

Variation of parameters and solutions of composite products of linear differential equations

Given a basis of solutions to k ordinary linear differential equations ?j[y]=0(j=1,2,…,k), we show how Green's functions can be used to construct a basis of solutions to the homogeneous differential equation ?[y]=0, where ? is the composite product ?=?₁?₂…?k. The construction of these solutions is elementary and classical. In particular, we consider the special case when . Remarkably, in this case, if {y₁,y₂,…,yn} is a basis of ?₁[y]=0, then our method produces a basis of for any k∈N. We illustrate our results with several classical differential equations and their special function solutions.     

Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

A bijection is presented between (1): partitions with conditions f_j+f_j+1≤k−1 and f₁≤i−1, where f_j is the frequency of the part j in the partition, and (2): sets of k−1 ordered partitions (n⁽¹⁾,n⁽²⁾,…,n^(k−1)) such that and , where m_j is the number of parts in n^(j). This bijection entails an elementary and constructive proof of the Andrews multiple-sum enumerating partitions with frequency conditions. A very natural relation between the k−1 ordered partitions and restricted paths is also presented, which reveals our bijection to be a modification of Bressoud’s version of the Burge correspondence.     

Exact rates in log law for positively associated random variables

Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.     

Haj?asz-Sobolev imbedding and extension

The author establishes some geometric criteria for a Haj?asz-Sobolev -extension (resp. -imbedding) domain of Rn with n?2, s∈(0,1] and p∈[n/s,∞] (resp. p∈(n/s,∞]). In particular, the author proves that a bounded finitely connected planar domain Ω is a weak α-cigar domain with α∈(0,1) if and only if for some/all s∈[α,1) and p=(2−α)/(s−α), where denotes the restriction of the Triebel-Lizorkin space on Ω.     

Extremal and Barabanov semi-norms of a semigroup generated by a bounded family of matrices

Let S={Si}_i∈I be an arbitrary family of complex n-by-n matrices, where 1?n<∞. Let denote the joint spectral radius of S, defined as

     

Maps of several variables of finite total variation. II. E. Helly-type pointwise selection principles

Given a=(a₁,…,an), b=(b₁,…,bn)∈Rn with a<b componentwise and a map f from the rectangle into a metric semigroup M=(M,d,+), denote by the Hildebrandt-Leonov total variation of f on , which has been recently studied in [V.V. Chistyakov, Yu.V. Tretyachenko, Maps of several variables of finite total variation. I, J. Math. Anal. Appl. (2010), submitted for publication]. The following Helly-type pointwise selection principle is proved: If a sequence{fj}_j∈Nof maps frominto M is such that the closure in M of the set{fj(x)}_j∈Nis compact for eachandis finite, then there exists a subsequence of{fj}_j∈N, which converges pointwise onto a map f such that. A variant of this result is established concerning the weak pointwise convergence when values of maps lie in a reflexive Banach space (M,‖⋅‖) with separable dual M^∗.     

An Erdo&#x030B;s–Ko–Rado Theorem for Direct Products

Letn_i, k_ibe positive integers,i=1, ..., d,satisfyingn_i≥2k_i.LetX₁, ..., X_dbe pairwise disjoint sets with |X_i| =n_i.Letbe the family of those (k₁+···+k_d)-element sets which have exactlyk_ielements inX_i, i=1,..., d.It is shown that if⊂is an intersecting family then ||/||≤max_ik_i/n_i,and this is best possible. The proof is algebraic, although in thed=2 case a combinatorial argument is presented as well.