Let a, b, c, x and y be positive integers. In this paper we sharpen a result of Le by showing that the Diophantine equation has at most two positive integer solutions (m,n) satisfying min (m,n)>1.

In this paper we present new fixed point theorems for inward and weakly inward type maps between Fréchet spaces. We also discuss Kakutani–Mönch and contractive type maps.

In this paper, we investigate the value distribution of difference polynomials and prove some difference analogues of results of Hayman and the Brück conjecture.

Let R be a ring and U a left R-module with S=End(RU). The aim of this paper is to characterize when S is coherent. We first show that a left R-module F is TU-flat if and only if HomR(U,F) is a flat left S-module. This removes the unnecessary hypothesis that U is Σ-quasiprojective from Proposition 2.7 of Gomez Pardo and Hernandez [‘Coherence of endomorphism rings’, Arch. Math. (Basel)48(1) (1987), 40–52]. Then it is shown that S is a right coherent ring if and only if all direct products of TU-flat left R-modules are TU-flat if and only if all direct products of copies of RU are TU-flat. Finally, we prove that every left R-module is TU-flat if and only if S is right coherent with wD(S)≤2 and US is FP-injective.

Using a variational method introduced in [D. Azé and J.-N. Corvellec, ‘A variational method in fixed point results with inwardness conditions’, Proc. Amer. Math. Soc.134(12) (2006), 3577–3583], deriving directly from the Ekeland principle, we give a general result on the existence of a fixed point for a very general class of multifunctions, generalizing the recent results of [Y. Feng and S. Liu, ‘Fixed point theorems for multi-valued contractive mappings and multi-valued Caristi type mappings’, J. Math. Anal. Appl.317(1) (2006), 103–112; D. Klim and D. Wardowski, ‘Fixed point theorems for set-valued contractions in complete metric spaces’, J. Math. Anal. Appl.334(1) (2007), 132–139]. Moreover, we give a sharp estimate for the distance to the fixed-points set.

Let R be a ring, S a strictly ordered monoid, and ω:S→End(R) a monoid homomorphism. The skew generalized power series ring R[[S,ω]] is a common generalization of (skew) polynomial rings, (skew) power series rings, (skew) Laurent polynomial rings, (skew) group rings, and Mal’cev–Neumann Laurent series rings. We study the (S,ω)-Armendariz condition on R, a generalization of the standard Armendariz condition from polynomials to skew generalized power series. We resolve the structure of (S,ω)-Armendariz rings and obtain various necessary or sufficient conditions for a ring to be (S,ω)-Armendariz, unifying and generalizing a number of known Armendariz-like conditions in the aforementioned special cases. As particular cases of our general results we obtain several new theorems on the Armendariz condition; for example, left uniserial rings are Armendariz. We also characterize when a skew generalized power series ring is reduced or semicommutative, and we obtain partial characterizations for it to be reversible or 2-primal.

The main purpose of this paper is to prove difference and q-difference counterparts of the Clunie lemma from the Nevanlinna theory of differential polynomials, where the difference and q-difference polynomials can contain many terms of maximal total degree in f(z) and its ( q-)shifts.

We give derivative-free characterizations for bounded and compact generalized composition operators between (little) Zygmund type spaces. To obtain these results, we extend Pavlović’s corresponding result for bounded composition operators between analytic Lipschitz spaces.

Marques-Smith and Sullivan [‘Partial orders on transformation semigroups’, Monatsh. Math.140 (2003), 103–118] studied various properties of two partial orders on P(X), the semigroup (under composition) consisting of all partial transformations of an arbitrary set X. One partial order was the ‘containment order’: namely, if α,β∈P(X) then α⊆β means xα=xβ for all x∈dom α, the domain of α. The other order was the so-called ‘natural order’ defined by Mitsch [‘A natural partial order for semigroups’, Proc. Amer. Math. Soc.97(3) (1986), 384–388] for any semigroup. In this paper, we consider these and other orders defined on the symmetric inverse semigroup I(X) and the partial Baer–Levi semigroup PS(q). We show that there are surprising differences between the orders on these semigroups, concerned with their compatibility with respect to composition and the existence of maximal and minimal elements.

We prove that maximal annuli in 𝕃3 bounded by circles, straight lines or cone points in a pair of parallel spacelike planes are part of either a Lorentzian catenoid or a Lorentzian Riemann’s example. We show that under the same boundary condition, the same conclusion holds even when the maximal annuli have a planar end. Moreover, we extend Shiffman’s convexity result to maximal annuli; but by using Perron’s method we construct a maximal annulus with a planar end where a Shiffman-type result fails.

An existence and uniqueness theorem for mild solutions of stochastic evolution equations is presented and proved. The diffusion coefficient is handled in a unified way which allows a unified theorem to be formulated for different cases, in particular, of multiplicative space–time white noise and trace-class noise.

Answering a question of W. Arendt and M. Kunze in the negative, we construct a Banach space X and a norm closed weak* dense subspace Y of the dual X′ of X such that X, endowed with the Mackey topology μ(X,Y ) of the dual pair 〈X,Y 〉, is not complete.

In this paper, we present a constructive proof of the amenability of C(X), where X is a compact space.

Let G be a simple undirected graph. The energy E(G) of G is the sum of the absolute values of the eigenvalues of the adjacent matrix of G, and the Hosoya index Z(G) of G is the total number of matchings in G. A tree is called a nonconjugated tree if it contains no perfect matching. Recently, Ou [‘Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching’, Appl. Math. Lett.19 (2006), 652–656] determined the unique element which is maximal with respect to Z(G) among the family of nonconjugated n-vertex trees in the case of even n. In this paper, we provide a counterexample to Ou’s results. Then we determine the unique maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated n-vertex trees for the case when n is even. As corollaries, we determine the maximal element with respect to E(G) as well as Z(G) among the family of nonconjugated chemical trees on n vertices, when n is even.

Let 𝒜={as(mod ns)}ks=0 be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results related to the covering multiplicity of 𝒜. In particular, we show that if every integer lies in more than m0=⌊∑ ks=11/ns⌋ members of 𝒜, then for any a=0,1,2,… there are at least subsets I of {1,…,k} with ∑ s∈I1/ns=a/n0. We also characterize when any integer lies in at most m members of 𝒜, where m is a fixed positive integer.

In a recent paper, Calkin et al. [N. Calkin, N. Drake, K. James, S. Law, P. Lee, D. Penniston and J. Radder, ‘Divisibility properties of the 5-regular and 13-regular partition functions’, Integers8 (2008), #A60] used the theory of modular forms to examine 5-regular partitions modulo 2 and 13-regular partitions modulo 2 and 3; they obtained and conjectured various results. In this note, we use nothing more than Jacobi’s triple product identity to obtain results for 5-regular partitions that are stronger than those obtained by Calkin and his collaborators. We find infinitely many Ramanujan-type congruences for b5(n), and we prove the striking result that the number of 5-regular partitions of the number n is even for at least 75% of the positive integers n.

Let 𝒩* be a Hilbert inductive limit and X a Banach space. In this paper, we obtain a necessary and sufficient condition for an analytic mapping Ψ:𝒩*↦X to have a factorization of the form Ψ=T∘ℰ, where ℰ is the exponential mapping on 𝒩* and T:Γ(𝒩*)↦X is a continuous linear operator, where Γ(𝒩*) denotes the Boson Fock space over 𝒩*. To prove this result, we establish some kernel theorems for multilinear mappings defined on multifold Cartesian products of a Hilbert space and valued in a Banach space, which are of interest in their own right. We also apply the above factorization result to white noise theory and get a characterization theorem for white noise testing functionals.

In this paper, we explore the monotone Lindelöf property of two kinds of linearly ordered extensions of monotonically Lindelöf generalized ordered spaces. In addition, we construct nonseparable monotonically Lindelöf spaces using the Bernstein set, which generalizes Corollary 4 of Levy and Matveev [‘Some more examples of monotonically Lindelöf and not monotonically Lindelöf spaces’, Topology Appl.154 (2007), 2333–2343].

We investigate the global asymptotic stability for positive solutions to a class of general symmetric rational difference equations and prove that the unique positive equilibrium 1 of the general symmetric rational difference equations is globally asymptotically stable. As a special case of our result, we solve the conjecture raised by Berenhaut, Foley and Stević [‘The global attractivity of the rational difference equation yn=(yn−k+yn−m)/(1+yn−kyn−m)’, Appl. Math. Lett.20 (2007), 54–58].

A variety is said to be a Rees–Sushkevich variety if it is contained in a periodic variety generated by 0-simple semigroups. Recently, all combinatorial Rees–Sushkevich varieties have been shown to be finitely based. The present paper continues the investigation of these varieties by describing those that are Cross, finitely generated, or small. It is shown that within the lattice of combinatorial Rees–Sushkevich varieties, the set ℱ of finitely generated varieties constitutes an incomplete sublattice and the set 𝒮 of small varieties constitutes a strict incomplete sublattice of ℱ. Consequently, a combinatorial Rees–Sushkevich variety is small if and only if it is Cross. An algorithm is also presented that decides if an arbitrarily given finite set Σ of identities defines, within the largest combinatorial Rees–Sushkevich variety, a subvariety that is finitely generated or small. This algorithm has complexity 𝒪(nk) where n is the number of identities in Σ and k is the length of the longest word in Σ.