Existence of Three Positive Pseudo-symmetric Solutions for a One Dimensional Discrete p-Laplacian

We apply the Five Functionals Fixed Point Theorem to verify the existence of at least three positive pseudo-symmetric solutions for the discrete three point boundary value problem, ?(g(?u(t-1)))+a(t))f(u(t))=0, for t∈{a+1,…,b+1} and u(a)=0 with u(v)=u(b+2) where g(v)=|v| ^p-2 v, p>1, for some fixed v∈{a+1,…,b+1} and σ=(b+2+v)/2 is an integer.     

A bound for wilson's theorem (I)

In 1975, Richard M. Wilson proved: Given any positive integers k ? 3 and λ, there exists a constant v⁰ = v⁰(k, λ) such that v ? B(k,λ) for every integer v ? v⁰ that satisfies λ(v ? 1) ≡ 0(mod k ? 1) and λv(v ? 1) ≡ 0[mod k(k ? 1)]. The proof given by Wilson does not provide an explicit value of v⁰. We try to find such a value v⁰(k, λ). In this article we consider the case λ = 1 and v ≡ 1[mod k(k ? 1)]. We show that: if k ? 3 and v = 1[mod k(k ? 1)] where v > k^kk5, then a B(v,k, 1) exists. © 1995 John Wiley & Sons, Inc.     

Positive solutions for systems of nonlinear eigenvalue problems for functional differential equations

Values of?λ?are determined for which there exist positive solutions of the system of functional differential equations, u″?+?λa(t)f(v _t )?=?0,v″?+?λb(t)g(u _t )?=?0, for 0?t?u(s)?=?v(s)?=?φ(s), ?r?≤?s?≤?0, and the boundary conditions u(0)?=?v(0)?=?φ(0)?=?u(1)?=?v(1)?=?0. A Guo–Krasnosel'skii fixed point theorem is applied.     

Existence of certain skew room frames with application to weakly 3-chromatic linear spaces

It is shown that for any even integer n ≥ 16 and for some b ≥ 1, there exists a skew Room frame of type 2^a 4^b with n = 2a + 4b. As an application, we show that for any integer v ≡ 1,4 (mod 12), there exists a weakly 3-chromatic linear space with all lines having size 4 iff v > 16. This answers an open problem posed by Colbourn and Rosa. © 1994 John Wiley & Sons, Inc.     

A remark on uniqueness of large solutions for elliptic systems of competitive type

We prove that the semilinear system Δu=a(x)upvq, Δv=b(x)urvs in a smooth bounded domain Ω⊂RN has a unique positive solution with the boundary condition u=v=+∞ on ∂Ω, provided that p,s>1, q,r>0 and (p−1)(s−1)−qr>0. The main novelty is imposing a growth on the possibly singular weights a(x), b(x) near ∂Ω, rather than requiring them to have a precise asymptotic behavior.     

Some reproducing identities for families of mean values

Gini, Lehmer, Beckenbach, and others studied the meanG _s (a, b) = (a ^s +b ^s )/(a ^{s 1} +b ^s-1 ) We proveTheorem 1 The identity (ina, b)G _s (G _t ,G _u ) =G _v holds if and only if (s, t, u, v) is (s, t, t, t) (the trivial solution) or one of (1, 1 –k, 1 +k, 1), (1/2, 1 –k, k, 1/2), or (0,–k, k, 0) (the exotic solutions,k is any real number)Theorem 2 IfP _s (a, b) is the power mean [(a ^s +b ^s )/2]^1/s , thenP _s (P _t ,P _u ) =P _v has only the trivial solution (s, t, u, v) = (s, t, t, t) and the exotic solution (0,t, –t, 0) The family of meansG _s (respP _s ) includes the classical arithmetic, geometric, and harmonic means     

A Conjecture Concerning the Pure Exponential Diophantine Equation a^x ＋ b^y = c^z

Let a, b, c, r be fixed positive integers such that a^2 ＋ b^2 = c^r, min（a, b, c, r） 〉 1 and 2 r. In this paper we prove that if a ≡ 2 （mod 4）, b ≡ 3 （mod 4）, c 〉 3.10^37 and r 〉 7200, then the equation a^x ＋ b^y = c^z only has the solution （x, y, z） = （2, 2, r）.     

A note on the diophantine equation x 2 + b y = c z

Let a, b, c, r be positive integers such that a ² + b ² = c ^r , min(a, b, c, r) > 1, gcd(a, b) = 1, a is even and r is odd. In this paper we prove that if b ≡ 3 (mod 4) and either b or c is an odd prime power, then the equation x ² + b ^y = c ^z has only the positive integer solution (x, y, z) = (a, 2, r) with min(y, z) > 1.     

3-(v, 4, 1) covering designs with chromatic numbers 2 and 3

A t-(v, k, λ) covering design is a pair (X, B) where X is a v-set and B is a collection of k-sets in X, called blocks, such that every t element subset of X is contained in at least λ blocks of B. The covering number, C_λ(t, k, v), is the minimum number of blocks a t-(v, k, λ) covering design may have. The chromatic number of (X, B) is the smallest m for which there exists a map φ: X → Z_m such that ∣φ((β)∣ ≥2 for all β ∈ B, where φ(β) = {φ(x): x ∈ β}. The system (X, B) is equitably m-chromatic if there is a proper coloring φ with minimal m for which the numbers ∣φ^?1(c)∣ c ∈ Z_m differ from each other by at most 1. In this article we show that minimum, (i.e., ∣B∣ = C λ (t, k, v)) equitably 3-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0 (mod 6), v ≥ 18 for v ≥ 1, 13 (mod 36), v ≡ 13 and for all numbers v = n, n + 1, where n ≡ 4, 8, 10 (mod 12), n ≥ 16; and n = 6.5^a 13^b 17^c ?4, a + b + c > 0, and n = 14, 62. We also show that minimum, equitably 2-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0, 5, 9 (mod 12), v ≥ 0, v = 2.5^a 13^b 17^c + 1, a + b + c > 0, and v = 23. © 1993 John Wiley & Sons, Inc.     

An existence theory for pairwise balanced designs,III: Proof of the existence conjectures

Given positive integers k and λ, balanced incomplete block designs on v points with block size k and index λ exist for all sufficiently large integers v satisfying the congruences λ(v ? 1) ≡ 0 (mod k ? 1) and λv(v ? 1) ≡ 0 (mod k(k ? 1)). Analogous results hold for pairwise balanced designs where the block sizes come from a given set K of positive integers. We also observe that the number of nonisomorphic designs on v points with given block size k > 2 and index λ tends to infinity as v increases (subject to the above congruences).     

Positive integers expressible as a sum of three squares in essentially only one way

The set S consisting of those positive integers n which are uniquely expressible in the form n = a² + b² + c², $\text{a ≧ b ≧ c ≧ 0}$, is considered. Since n ∈ S if and only if 4n ∈ S, we may restrict attention to those n not divisible by 4. Classical formulas and the theorem that there are only finitely many imaginary quadratic fields with given class number imply that there are only finitely many n ∈ S with n = 0 (mod 4). More specifically, from the existing knowledge of all the imaginary quadratic fields with odd discriminant and class number 1 or 2 it is readily deduced that there are precisely twelve positive integers n such that n ∈ S and n ≡ 3 (mod 8). To determine those n ∈ S such that n ≡ 1, 2, 5, 6 (mod 8) requires the determination of the imaginary quadratic fields with even discriminant and class number 1, 2, or 4. While the latter information is known empirically, it has not been proved that the known list of 33 such fields is complete. If it is complete, then our arguments show that there are exactly 21 positive integers n such that n ∈ S and n ≡ 1, 2, 5, 6 (mod 8).     

Pancyclic oriented graphs

Let D be an oriented graph of order n ≧ 9 and minimum degree n ? 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ? A(D), or d_D⁺(u) + d_D^?(v) ≧ n ? 3.     

Further Results on the Existence of Splitting BIBDs and Application to Authentication Codes

Let (v,u×c,λ)-splitting BIBD denote a (v,u×c,λ)-splitting balanced incomplete block design of order v with block size u×c and index λ. Necessary conditions for the existence of a (v,u×c,λ)-splitting BIBD are v≥uc, λ(v−1)≡0 (mod c(u−1)) and λ v(v−1)≡0 (mod (c ² u(u−1))). We show in this paper that the necessary conditions for the existence of a (v,3×3,λ)-splitting BIBD are also sufficient with possible exceptions when (1) (v,λ)∈{(55,1),(39,9k):k=1,2,…}, (2) λ≡0 (mod 54) and v≡0 (mod 2). We also show that there exists a (v,3×4,1)-splitting BIBD when v≡1 (mod 96). As its application, we obtain a new infinite class of optimal 4-splitting authentication codes.     

On the Terai-Jésmanowicz conjecture

In this paper, we prove that if a, b and c are pairwise coprime positive integers such that a^2＋b^2=c^r,a〉b,a≡3 （mod4）,b≡2 （mod4） and c-1 is not a square, thena a^x＋b^y=c^z has only the positive integer solution （x, y, z） = （2, 2, r）.
Let m and r be positive integers with 2｜m and 2 r, define the integers Ur, Vr by （m ＋√-1）^r=Vr＋Ur√-1. If a = ｜Ur｜,b=｜Vr｜,c = m^2＋1 with m ≡ 2 （mod 4）,a ≡ 3 （mod 4）, and if r 〈 m/√1.5log3（m^2＋1）-1, then a^x ＋ b^y = c^z has only the positive integer solution （x,y, z） = （2, 2, r）. The argument here is elementary.     

A parallel extended GCD algorithm

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O(n/logn) time using at most n¹⁺ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bits of the integers u and v, with uv. This approach is more suitable for extended GCD algorithms since the coefficients of the extended version a and b, such that au+bv=gcd(u,v), are deeply linked with the order of magnitude of the rational v/u and its continuants. Consequently, the computation of such coefficients is much easier.     

Large solutions for an elliptic system of quasilinear equations

In this paper we consider the quasilinear elliptic system Δpu=uavb, Δpv=ucve in a smooth bounded domain Ω⊂RN, with the boundary conditions u=v=+∞ on ∂Ω. The operator Δp stands for the p-Laplacian defined by Δpu=div(|∇u|^p−2∇u), p>1, and the exponents verify a,e>p−1, b,c>0 and (a−p+1)(e−p+1)?bc. We analyze positive solutions in both components, providing necessary and sufficient conditions for existence. We also prove uniqueness of positive solutions in the case (a−p+1)(e−p+1)>bc and obtain the exact blow-up rate near the boundary of the solution. In the case (a−p+1)(e−p+1)=bc, infinitely many positive solutions are constructed.     

Practical numbers in Lucas sequences

Abstract

A practical number is a positive integer n such that all the positive integers m ≤ n can be written as a sum of distinct divisors of n. Let (u_n)_n≥0 be the Lucas sequence satisfying u₀ = 0, u₁ = 1, and u_n+2 = au_n+1 + bu_n for all integers n ≥ 0, where a and b are fixed nonzero integers. Assume a(b + 1) even and a² + 4b > 0. Also, let be the set of all positive integers n such that |u_n| is a practical number. Melfi proved that is infinite. We improve this result by showing that #(x) ? x/log x for all x ≥ 2, where the implied constant depends on a and b. We also pose some open questions regarding .     

Global classical solutions for reaction–diffusion systems with nonlinearities of exponential growth

The aim of this study is to prove global existence of classical solutions for systems of the form ${\frac{\partial u}{\partial t} -a \Delta u=-f(u,v)}The aim of this study is to prove global existence of classical solutions for systems of the form \frac?u?t -a Du=-f(u,v){\frac{\partial u}{\partial t} -a \Delta u=-f(u,v)} , \frac?v?t -b Dv=g(u,v){\frac{\partial v}{\partial t} -b \Delta v=g(u,v)} in (0, +∞) × Ω where Ω is an open bounded domain of class C ¹ in \mathbbRⁿ{\mathbb{R}^n}, a > 0, b > 0 and f, g are nonnegative continuously differentiable functions on [0, +∞) × [0, +∞) satisfying f (0, η) = 0, g(x,h) ￡ C j(x)e^ahb{g(\xi,\eta) \leq C \varphi(\xi)e^{\alpha {\eta^\beta}}} and g(ξ, η) ≤ ψ(η)f(ξ, η) for some constants C > 0, α > 0 and β ≥ 1 where j{\varphi} and ψ are any nonnegative continuously differentiable functions on [0, +∞) such that j(0)=0{\varphi(0)=0} and lim_{h? +￥}h^b-1y(h) = l{ \lim_{\eta \rightarrow +\infty}\eta^{\beta -1}\psi(\eta)= \ell} where ℓ is a nonnegative constant. The asymptotic behavior of the global solutions as t goes to +∞ is also studied. For this purpose, we use the appropriate techniques which are based on semigroups, energy estimates and Lyapunov functional methods.     

Left-divisibility and word problems in single relation monoids

LetM be a monoid presented by <Σ;u=v> whereu andv are words on the finite alphabet Σ./ Deciding the world problem forM is still an open question, though it seems decidable and partial results exist. The remaining cases to solve are presentations of the form <a, b; bva=aua>,u, v∈{a, b}^⋆ The word problem is then closely related to the left-divisibility problem, as shown by S.I. Adjan who introduced a procedure that “almost” allows to decide the problem. The main contribution, due to Adjan and Oganesjan, states that ifbva is an unbordered factor ofaua then the word problem is deciable. We restrict Adjan's procedure to study the case whenbva is unbordered, which allows us to extend Adjan and Oganesjan's theorem. More specifically, we show (Proposition 4.24) that the word problem is decidable for presentations <a, b; bva=aua> with the only following condition: Inbva, the leftmost train ofb is strictly longer than the others. The following corollary naturally holds: The word problem is decidable for presentations of the form <a, b; b ^m a ⁿ =aua>,u∈{a, b}^⋆,m, n>0