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

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

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

The nonlinear dispersive K(m, n) equations, u_t−(u^m)_x−(uⁿ)_xxx = 0 which exhibit compactons: solitons with compact support, are studied. New exact solitary solutions with compact support are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. General formulas for the solutions of K(m, n) equations are established.     

Existence of quasibounded solutions for the higher order dynamic equations on measure chains

By using the exponential dichotomy and Schauder’s fixed point theorem, some new criteria are established for the existence of quasibounded solutions of the inhomogeneous system x^Δ = A(t)x + g(t, x) + h(t), which generalize the previous results in [15], [19].     

Bifurcations of travelling wave solutions in a new integrable equation with peakon and compactons

Degasperis and Procesi applied the method of asymptotic integrability and obtain Degasperis–Procesi equation. They showed that it has peakon solutions, which has a discontinuous first derivative at the wave peak, but they did not explain the reason that the peakon solution arises. In this paper, we study these non-smooth solutions of the generalized Degasperis–Procesi equation u_t − u_txx + (b + 1)uu_x = bu_xu_xx + uu_xxx, show the reason that the non-smooth travelling wave arise and investigate global dynamical behavior and obtain the parameter condition under which peakon, compacton and another travelling wave solutions engender. Under some parameter condition, this equation has infinitely many compacton solutions. Finally, we give some explicit expression of peakon and compacton solutions.     

Comment on the 3+1 dimensional Kadomtsev–Petviashvili equations

We comment on traveling wave solutions and rational solutions to the 3+1 dimensional Kadomtsev–Petviashvili (KP) equations: (u_t + 6uu_x + u_xxx)_x ± 3u_yy ± 3u_zz = 0. We also show that both of the 3+1 dimensional KP equations do not possess the three-soliton solution. This suggests that none of the 3+1 dimensional KP equations should be integrable, and partially explains why they do not pass the Painlevé test. As by-products, the one-soliton and two-soliton solutions and four classes of specific three-soliton solutions are explicitly presented.     

Differential invariants of the one-dimensional quasi-linear second-order evolution equation

We consider evolution equations of the form u_t = f(x, u, u_x)u_xx + g(x, u, u_x) and u_t = u_xx + g(x, u, u_x). In the spirit of the recent work of Ibragimov [Ibragimov NH. Laplace type invariants for parabolic equations. Nonlinear Dynam 2002;28:125–33] who adopted the infinitesimal method for calculating invariants of families of differential equations using the equivalence groups, we apply the method to these equations. We show that the first class admits one differential invariant of order two, while the second class admits three functional independent differential invariants of order three. We use these invariants to determine equations that can be transformed into the linear diffusion equation.     

On generalized Jordan 1-derivation in rings

Let n ⩾ 1 be a fixed integer and let R be an (n + 1)!-torsion free 1-ring with identity element e. If F, d:R → R are two additive mappings satisfying F(xⁿ⁺¹) = F(x)(x¹)ⁿ + xd(x)(x¹)ⁿ⁻¹ + x²d(x)(x¹)ⁿ⁻²+ ⋯ +xⁿd(x) for all x ∈ R, then d is a Jordan 1-derivation and F is a generalized Jordan 1-derivation on R.     

Inverse problems for parabolic equations 2

Let u_t − u_xx = h(t) in 0 ⩽ x ⩽ π, t ⩾ 0. Assume that u(0, t) = v(t), u(π, t) = 0, and u(x, 0) = g(t). The problem is: what extra data determine the three unknown functions {h, v, g} uniquely? This question is answered and an analytical method for recovery of the above three functions is proposed.     

On Certain C-Test Words for Free Groups

Let F_m be a free group of a finite rank m ≥ 2 and let X_i, Y_j be elements in F_m. A non-empty word w(x₁,…,x_n) is called a C-test word in n letters for F_m if, whenever (X₁,…,X_n) = w(Y₁,…,Y_n) ≠ 1, the two n-typles (X₁,…,X_n) and (Y₁,…,Y_n) are conjugate in F_m. In this paper we construct, for each n ≥ 2, a C-test word v_n(x₁,…,x_n) with the additional property that v_n(X₁,…,X_n) = 1 if and only if the subgroup of F_m generated by X₁,…,X_n is cyclic. Making use of such words v_m(x₁,…,x_m) and v_m + 1(x₁,…,x_m + 1), we provide a positive solution to the following problem raised by Shpilrain: There exist two elements u₁, u₂ ∈ F_m such that every endomorphism ψ of F_m with non-cyclic image is completely determined by ψ(u₁), ψ(u₂).     

An extended rational interpolation method

To interpolate function, f(x), a ? x ? b, when we have some information about the values of f(x) and their derivatives in separate points on {x₀, x₁, … , x_n} ? [a, b], the Hermit interpolation method is usually used. Here, to solve this kind of problems, extended rational interpolation method is presented and it is shown that the suggested method is more efficient and suitable than the Hermit interpolation method, especially when the function f(x) has singular points in interval [a, b]. Also for implementing the extended rational interpolation method, the direct method and the inverse differences method are presented, and with some examples these arguments are examined numerically.     

Exact solutions for the rotational flow of a generalized Maxwell fluid between two circular cylinders

Unsteady flow of an incompressible generalized Maxwell fluid between two coaxial circular cylinders is studied by means of the Laplace and finite Hankel transforms. The motion of the fluid is produced by the rotation of cylinders around their common axis. The solutions that have been obtained, written in integral and series form in terms of the generalized G_a,b,c(·, t)-functions, are presented as a sum of the Newtonian solutions and the corresponding non-Newtonian contributions. They satisfy all imposed initial and boundary conditions and for λ → 0 reduce to the solutions corresponding to the Newtonian fluids performing the same solution. Furthermore, the corresponding solutions for ordinary Maxwell fluids are also obtained for β = 1. Finally, in order to reveal some relevant physical aspects of the obtained results, the diagrams of the velocity field ω(r, t) have been depicted against r and t for different values of the material and fractional parameters.     

On “P” property and the column-W property

P-matrices play an important role in the well-posedness of a linear complementarity problem (LCP). Similarly, the well-posedness of a horizontal linear complementarity problem (HLCP) is closely related to the column-W property of a matrix k-tuple.In this paper we first consider the problem of generating P-matrices from a given pair of matrices. Given a matrix pair (D, F) where D is a square matrix of order m and matrix F has m rows, “what are the conditions under which there exists a matrix G such that (D + FG) is a P-matrix?”. We obtain necessary and sufficient conditions for the special case when the column rank of F is m ? 1. A decision algorithm of complexity O(m²) to check whether the given pair of matrices (D, F) is P-matrisable is obtained. We also obtain a necessary and an independent sufficient condition for the general case when rank(F) is less than m ? 1.We then generalise the P-matrix generating problem to the generation of matrix k-tuples satisfying the column-W property from a given matrix (k + 1)-tuple. That is, given a matrix (k + 1)-tuple (D₁, … ,D_k, F), where D_js are square matrices of order m and F is a matrix having m rows, we determine the conditions under which the matrix k-tuple (D₁ + FG₁, … ,D_k + FG_k) satisfies the column-W property. As in the case of P-matrices we obtain necessary and sufficient conditions for the case when rank(F) = m ? 1. Using these conditions a decision algorithm of complexity O(km²) to check whether the given matrix (k + 1)-tuple is column-W matrisable is obtained. Then for the case when rank(F) is less than m ? 1, we obtain a necessary and an independent sufficient condition.For a special sub-class of P-matrices we give a polynomial time decision algorithm for P-matrisability. Finally, we obtain a geometric characterisation of column-W property by generalising the well known separation theorem for P-matrices.     

The Exponent of Discrepancy Is at Least 1.0669

LetP⊂[0, 1]^dbe ann-point set and letw: P→[0, ∞) be a weight function withw(P)=∑_z∈P w(z)=1. TheL₂-discrepancy of the weighted set (P, w) is defined as theL₂-average ofD(x)=vol(B_x)−w(P∩B_x) overx∈[0, 1]^d, where vol(B_x) is the volume of thed-dimensional intervalB_x=∏^d_k=1 [0, x_k). The exponent of discrepancyp* is defined as the infimum of numberspsuch that for all dimensionsd⩾1 and allε>0 there exists a weighted set of at mostKε^−ppoints in [0, 1]^dwithL₂-discrepancy at mostε, whereK=K(p) is a suitable number independent ofεandd. Wasilkowski and Woźniakowski proved thatp*⩽1.4779, by combining known bounds for the error of numerical integration and using their relation toL₂-discrepancy. In this note we observe that a careful treatment of a classical lower- bound proof of Roth yieldsp*⩾1.04882, and by a slight modification of the proof we getp*⩾1.0669. Determiningp* exactly seems to be quite a difficult problem.     

New families of exact soliton-like solutions and dromion solutions to the (2+1)-dimensional higher-order Broer–Kaup equations

Using homogeneous balance method we obtain Bäcklund transformation (BT) and a linear partial differential equation of higher-order Broer–Kaup equations. As a result, new soliton-like solutions and new dromion solution and other exact solutions of (2 + 1)-dimensional higher-order Broer–Kaup equations are given. By analyzing a soliton-like solution, we get some dromions solutions. This method, which can be generalized to some (2 + 1)-dimensional nonlinear evolution equations, is simple and powerful.     

Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

The support of an [n, k] linear code C over a finite field F_q is the set of all coordinate positions such that at least one codeword has a nonzero entry in each of these coordinate position. The rth generalized Hamming weight d_r(C), 1 ⩽ r ⩽ k, of C is defined as the minimum of the cardinalities of the supports of all [n, r] subcodes of C. The sequence (d₁(C), d₂(C), … , d_k(C)) is called the Hamming weight hierarchy (HWH) of C. The HWH, d_r(C) = n − k + r;  r = 1, 2 , …, k, characterizes maximum distance separable (MDS) codes. Therefore the matrix characterization of MDS codes is also the characterization of codes with the HWH d_r(C) = n − k + r; r = 1, 2, … , k. A linear code C with systematic check matrix [I∣P], where I is the (n − k) × (n − k) identity matrix and P is a (n − k) × k matrix, is MDS iff every square submatrix of P is nonsingular. In this paper we extend this characterization to linear codes with arbitrary HWH. Using this result, we characterize Near-MDS codes, Near-Near-MDS (N²-MDS) codes and A^μ-MDS codes. The MDS-rank of C is the smallest integer η such that d_η+1 = n − k + η + 1 and the defect vector of C with MDS-rank η is defined as the ordered set {μ₁(C), μ₂(C), μ₃(C), … , μ_η(C), μ_η+1(C)}, where μ_i(C) = n − k + i − d_i(C). We call C a dually defective code if the defect vector of the code and its dual are the same. We also discuss matrix characterization of dually defective codes. Further, the codes meeting the generalized Greismer bound are characterized in terms of their generator matrix. The HWH of dually defective codes meeting the generalized Greismer bound are also reported.     

Interpolation by Integer-Valued Polynomials

LetRbe a Krull ring with quotient fieldKanda₁,…,a_ninR. If and only if thea_iare pairwise incongruent mod every height 1 prime ideal of infinite index inRdoes there exist for all valuesb₁,…,b_ninRan interpolating integer-valued polynomial, i.e., anf ∈ K[x] withf(a_i) = b_iandf(R) ⊆ R.IfSis an infinite subring of a discrete valuation ringR_vwith quotient fieldKanda₁,…,a_ninSare pairwise incongruent mod allM^k_v ∩ Sof infinite index inS, we also determine the minimald(depending on the distribution of thea_iamong residue classes of the idealsM^k_v ∩ S) such that for allb₁,…,b_n ∈ R_vthere exists a polynomialf ∈ K[x] of degree at mostdwithf(a_i) = b_iandf(S) ⊆ R_v.     

Quantum Complexity of Integration

It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F^k, α_d on [0, 1]^d and define γ by γ=(k+α)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are comp(F^k, α_d, ε)≍ε^−1/γ and comp^random(F^k, α_d, ε)≍ε^−2/(1+2γ). For a quantum computer we prove comp^quant_query(F^k, α_d, ε)≍ε^−1/(1+γ) and comp^quant(F^k, α_d, ε)⩽Cε^−1/(1+γ)(log ε⁻¹)^1/(1+γ). For restricted Monte Carlo (only coin tossing instead of general random numbers) we prove comp^coin(F^k, α_d, ε)⩽Cε^−2/(1+2γ)(log ε⁻¹)^1/(1+2γ). To summarize the results one can say that   • there is an exponential speed-up of quantum algorithms over deterministic (classical) algorithms, if γ is small;   • there is a (roughly) quadratic speed-up of quantum algorithms over randomized classical methods, if γ is small.     

Complexity Estimates for the Schmüdgen Positivstellensatz

LetKbe a closed basic set inRⁿgiven by the polynomial inequalities φ₁≥ 0, . . . , φ_m≥ 0 and let Σ be the semiring generated by the φ_kand the squares inR[x₁, . . . ,x_n]. Schmüdgen has shown that ifKis compact then any polynomial function strictly positive onKbelongs to Σ. Easy consequences are (1)f≥ 0 onKif and only iff∈R⁺+ Σ (Positivstellensatz) and (2) iff≥ 0 onKbutf∈ Σ then asdtends to 0⁺, in any representation off + das an element of Σ in terms of the φ_k, the squares and semiring operations, the integerN(d) which is the minimum over all representations of the maximum degree of the summands must become arbitrarily large. A one-dimensional example is analyzed to obtain asymptotic lower and upper bounds of the formcd^−1/2≤N(d) ≤Cd^−1/2log (1/d).     

Combinatorial R Matrices for a Family of Crystals: B(1)n,D(1)n,A(2)2n,and D(2)n + 1 Cases

For coherent families of crystals of affine Lie algebras of type B⁽¹⁾_n, D⁽¹⁾_n, A⁽²⁾_2n, and D⁽²⁾_n + 1 we describe the combinatorial R matrix using column insertion algorithms for B, C, D Young tableaux. This is a continuation of previous work by the authors (2000, in “Physical Combinatorics” (M. Kashiwara and T. Miwa, Eds.), Birkhäuser, Boston).