On the diophantine equationD 1 x 2+D 2 m =4y n

For anyD ₁,D ₂, leth(-D ₁ D ₂) denote the class number of the imaginary quadratic field . In this paper we prove that the equationD ₁ x ²+D ₂ ^m =4y ⁿ.D ₁,D ₂,x, y, m, n, gcd (D ₁x,D ₂y=1,2m,n an odd prime,nh(-D ₁ D ₂, has only a finite number of solutions (D ₁,D ₂,x,y,m,n) withn>5. Moreover, the solutions satisfy 4y ⁿ相似文献   

Generalized derivations and left multipliers on Lie ideals

Let m, n be two fixed positive integers and let R be a 2-torsion free prime ring, with Utumi quotient ring U and extended centroid C. We study the identity F(x ^m+n+1) = F(x)x ^m+n  + x ^m D(x)x ⁿ for x in a non-central Lie ideal of R, where both F and D are generalized derivations of R and then determine the relationship between the form of F and that of D. In particular the conclusions of the main theorem say that if D is the non-zero map in R, then R satisfies the standard identity s ₄(x ₁, . . . , x ₄) and D is a usual derivation of R.     

A recurrence relation for the square root

The behavior of the sequence x_{n + 1} = x_n(3N − x_n²)/2N is studied for N > 0 and varying real x₀. When 0 < x₀ < (3N)^1/2 the sequence converges quadratically to N^1/2. When x₀ > (5N)^1/2 the sequence oscillates infinitely. There is an increasing sequence β_r, with β₋₁ = (3N)^1/2 which converges to (5N)^1/2 and is such that when β_r < x₀ < β_{r + 1} the sequence {x_n} converges to (−1)^rN^1/2. For x₀ = 0, β₋₁, β₀,… the sequence converges to 0. For x₀ = (5N)^1/2 the sequence oscillates: x_n = (−1)ⁿ(5N)^1/2. The behavior for negative x₀ is obtained by symmetry.     

Fractional dimension of binary Knuth semifield planes

We prove that semifield planes π(??_2m) coordinatized by the commutative binary Knuth semifield ??_2m, m = nk ( m odd) are fractional dimensional with respect to a subplane isomorphic to PG ( 2 , 4 ) if either n = 9 or n ≡\ 0 ( mod 3 ) and one of the trinomials x ⁿ + x ^s + 1 , s ∈{ 1 , 2 , 3 , 5 }, is irreducible over the Galois field ?? ₂ . © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 317–327, 2012     

Pseudo-randomness of van der Corput’s sequences

The aim of this paper is to find main terms of the star D _N ^* and extremal D _N discrepancies of the two dimensional sequence (x _n , x _n+1), n = 0, 1, 2, ..., N − 1, where x _n , n = 0, 1, 2, ..., is the van der Corput sequence. This give a quantitative form of a well-known result that van der Corput sequence is not pseudorandom. This research was supported by the Slovak Academy of Sciences Vega Grant No. 2/7138/27.     

Multiplicative infinite loop space theory

Let G be a finitely presented group given by its pre-abelian presentation <X1,…,Xm; Xe11ζ1,…,Xemmζ,ζm+1,…>, where ei≥0 for i = 1,…, m and ζj?G′ for j≥1. Let N be the subgroup of G generated by the normal subgroups [xeii, G] for i = 1,…, m. Then Dn+2(G)≡γn+2(G) (modNG′) for all n≥0, where G” is the second commutator subgroup of G,γn+2(G) is the (n+2)th term of the lower central series of G and Dn+2(G) = G∩(1+△n+2(G)) is the (n+2)th dimension subgroup of G.     

Note on the solution of a certain boundary-value problem

A simple algorithm is described for inverting the operatorD _x D _y (D _x andD _y here and subsequently denote partial differentiation with respect tox andy respectively) which occurs in the iterative solution of the equationD _x D _y f (x, y)=g (x, y, f, D _x f, D _x ² f,D _x D _y f, D _y ² f) when boundary values off(x,y) are given along the sides of the rectangle in thexy-plane whose corners are at the points (a,b); (a+(n+1)k,b); (a+(n+1)k,b+(n+1)h); (a,b+(n+1)h).Communication M. R. 43 of the Computation Department of the Mathematical Centre, Amsterdam.     

Reducibility of polynomials a0(x) + a1 (x)y + a2 (x) y2 modulo p

Let f=a₀(x)+a₁(x)y+a₂(x)y² ? \Bbb Z[x,y]f=a_0(x)+a_1(x)y+a_2(x)y^2\in {\Bbb Z}[x,y] be an absolutely irreducible polynomial of degree m in x. We show that the reduction f mod p will also be absolutely irreducible if p 3 c_m·H(f)^e_mp\ge c_m\cdot H(f)^{e_m} where H (f) is the height of f and e₁ = 4,e₂ = 6, e₃ = 6 [2/3]{2}\over{3} and e_m = 2 m for m S 4. We also show that the exponents e_m are best possible for m 1 3m\ne 3 if a plausible number theoretic conjecture is true.     

Random matrix products and applications to cellular automata

Let λ be the upper Lyapunov exponent corresponding to a product of i.i.d. randomm×m matrices (X _i) _i ^0/∞ over ℂ. Assume that theX _i's are chosen from a finite set {D ₀,D ₁...,D _t-1(ℂ), withP(X _i=D_j)>0, and that the monoid generated byD ₀, D₁,…, D_q−1 contains a matrix of rank 1. We obtain an explicit formula for λ as a sum of a convergent series. We also consider the case where theX _i's are chosen according to a Markov process and thus generalize a result of Lima and Rahibe [22]. Our results on λ enable us to provide an approximation for the numberN _≠0(F(x)ⁿ,r) of nonzero coefficients inF(x) ⁿ.(modr), whereF(x) ∈ ℤ[x] andr≥2. We prove the existence of and supply a formula for a constant α (<1) such thatN _≠0(F(x)ⁿ,r) ≈n ^α for “almost” everyn. Supported in part by FWF Project P16004-N05     

On the convex hull of the multiform numerical range

Let A ₁,…,A_m be nxn hermitian matrices. Definine

W(A ₁,…,A_m )={(xA₁x ^?,…xA_mx ^?):x?C ⁿ ,xx ^?=1}. We will show that every point in the convex hull of W(A ₁,…,A_m ) can be represented as a convex combination of not more than k(m,n) points in W(A ₁,…,A_m ) where k(m,n)=min{n,[√m]+δ _n ² _m+1}.     

On Cohn's conjecture concerning the diophantine equation¶x2+ 2m = yn

In the past fifty years and more, there are many papers concerned with the solutions (x,y,m,n) of the exponential diophantine equation $ x^2 + 2^m = y^n, x, y, m, n \in \mathbb{N}, 2 \not|\, y, n > 2 $ x^2 + 2^m = y^n, x, y, m, n \in \mathbb{N}, 2 \not|\, y, n > 2 , written by Ljunggren, Nagell, Brown, Toyoizumi, Cohn and the others. In 1992, Cohn conjectured that the equation has no solutions (x, y, m, n) with m > 2 and 2 | m 2 \mid m . In this paper, using a quantitative result of Laurent, Mignotte and Nesterenko on linear forms in the logarithms of two algebraic numbers, we verify Cohn's conjecture. Thus, according to known results, we prove that the equation has only three solutions (x, y, m, n) = (5, 3, 1, 3), (7, 3, 5, 4) and (11, 5, 2, 3).     

Pseudodifferential Boundary Value Problems with Non-Smooth Coefficients

ABSTRACT

In this contribution, we establish a calculus of pseudodifferential boundary value problems with Hölder continuous coefficients. It is a generalization of the calculus of pseudodifferential boundary value problems introduced by Boutet de Monvel. We discuss their mapping properties in Bessel potential and certain Besov spaces. Although having non-smooth coefficients and the operator classes being not closed under composition, we will prove that the composition of Green operators a ₁(x, D _x )a ₂(x, D _x ) coincides with a Green operator a(x, D _x ) up to order m ₁ + m ₂ ? Θ, where Θ ∈ (0, τ₂) is arbitrary, a _j (x, ξ) is in C ^{τ _j} (? ⁿ ) w.r.t. x, and m _j is the order of a _j (x, D _x ), j = 1, 2. Moreover, a(x, D _x ) is obtained by the asymptotic expansion formula of the smooth coefficient case leaving out all terms of order less than m ₁ + m ₂ ? Θ. This result is used to construct a parametrix of a uniformly elliptic Green operator a(x, D _x ).     

Unboundedness of the large solutions of some asymmetric oscillators at resonance

In this paper, we consider the unboundedness of solutions of the following differential equation (φ_p(x′))′ + (p ? 1)[αφ_p(x⁺) ? βφ_p(x^?)] = f(x)x′ + g(x) + h(x) + e(t) where φ_p(u) = |u|^{p? 2} u, p > 1, x^± = max {±x, 0}, α and β are positive constants satisfying with m, n ∈ N and (m, n) = 1, f and g are continuous and bounded functions such that lim_x→±∞g(x) ? g(±∞) exists and h has a sublinear primitive, e(t) is 2π_p‐periodic and continuous. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Best Constants in the Miranda-Agmon Inequalities for Solutions of Elliptic Systems and the Classical Maximum Modulus Principle for Fluid and Elastic Half-spaces

The Dirichlet problem for elliptic systems of the second order with constant real and complex coefficients in the half-space  ^k ₊ = {x = (x ₁,…,x_k ): x_k > 0} is considered. It is assumed that the boundary values of a solution u = (u ₁,…,u _m) have the form ψ ₁ ξ ₁ + · · · + ψ _n ξ _n, 1 ≤ n ≤ m, where ξ ₁,· · ·,ξ _n is an orthogonal system of m-component normed vectors and ψ ₁,· · ·,ψ _n are continuous and bounded functions on ? ^k ₊. We study the mappings [C(? ^k ₊)] ⁿ ? (ψ ₁,…,ψ _n) → u(x) ?  ^m and [C(? ^k ₊)] ⁿ ? (ψ ₁,…,ψ _n) → u(x) ?  ^m generated by real and complex vector valued double layer potentials. We obtain representations for the sharp constants in inequalities between |u(x)| or |(z, u(x))| and ∥u| _xk =₀∥, where z is a fixed unit m-component vector, | · | is the length of a vector in a finite-dimensional unitary space or in Euclidean space, and (·,·) is the inner product in the same space. Explicit representations of these sharp constants for the Stokes and Lamé systems are given. We show, in particular, that if the velocity vector (the elastic displacement vector) is parallel to a constant vector at the boundary of a half-space and if the modulus of the boundary data does not exceed 1, then the velocity vector (the elastic displacement vector) is majorised by 1 at an arbitrary point of the half-space. An analogous classical maximum modulus principle is obtained for two components of the stress tensor of the planar deformed state as well as for the gradient of a biharmonic function in a half-plane.     

When isf(x1, x2, ..., xn) =u1(x1) +u2(x2) + ... +un(xn)?

We discuss subsetsS of ℝⁿ such that every real valued functionf onS is of the formf(x₁, x₂, ..., x_n) =u ₁(x₁) +u ₂(x₂) +...+u _n(x_n), and the related concepts and situations in analysis.     

On the Diophantine equation x 2+5 m =y n

In this paper we consider the Diophantine equation x ²+5 ^m =y ⁿ , n>2, m>0. We prove that the equation has no positive integer solutions when 2∤ m, nor when 2∣m under the additional condition (x,y)=1, with the help of Bilu, Hanrot, and Voutier’s deep result in (J. Reine Angew. Math. 539:75–122, 2001). Supported by the 973 Grant of P.R.C and SRFDP 20040284018.     

On the Growth of Positive Definite Double Sequences Which Are not Moment Sequences

For every a > 1, there is a function f : N²₀ → R, which is positive semidefinite but not a moment sequence, such that |f(m, n)| ≥ m+ n^a(m+n) for all (m, n). The constant 1 is the best possible.     

Recognition by prime graph of $^2 D_{2^m + 1} (3)$

As shown in [1] the simple group ² D_{2^m + 1} (3)^2 D_{2^m + 1} (3) is recognizable by spectrum. The main result of this paper generalizes the above, stating that ² D_{2^m + 1} (3)^2 D_{2^m + 1} (3) is recognizable by prime graph. In other words, we show that if G is a finite group satisfying G(G) = G(² D_{2^m + 1} (3))\Gamma (G) = \Gamma (^2 D_{2^m + 1} (3)) then G @ ² D_{2^m + 1} (3)G \cong ^2 D_{2^m + 1} (3).     

Approximation of discrete functions and Chebyshev polynomials orthogonal on the uniform grid

Let _N+2m ={−m, −m+1, …, −1, 0, 1, …,N−1,N, …,N−1+m}. The present paper is devoted to the approximation of discrete functions of the formf : _N+2m → ℝ by algebraic polynomials on the grid Ω _N ={0, 1, …,N−1}. On the basis of two systems of Chebyshev polynomials orthogonal on the sets Ω _N+m and Ω _N , respectively, we construct a linear operatorY _{n+2m, N} =Y _{n+2m, N} (f), acting in the space of discrete functions as an algebraic polynomial of degree at mostn+2m for which the following estimate holds (x ε Ω _N ):