On value distribution of f (k)-af n

The aim of this paper is to discuss the value distribution of the function f ^(k) − af ⁿ. Under the assumption that f(z) is a transcendental meromorphic function in the complex plane and a is a non-zero constant, it is proved that if n ⩽ k + 3, then f ^(k) − af ⁿ has infinitely many zeros. The main result is obtained by using the Nevanlinna theory and the Clunie lemma of complex functions. __________ Translated from Acta Scientiarum Naturalium Universitatis NeiMongol, 2004, 35(1): 5–9     

SOME NORMALITY CRITERIA OF MEROMORPHIC FUNCTIONS

Let F be a family of functions meromorphic in a domain D, let n ≥ 2 be a positive integer, and let a ≠ 0, b be two finite complex numbers. If, for each f ∈ F, all of whose zeros have multiplicity at least k ＋ 1, and f ＋ a（f^（k））^n≠b in D, then F is normal in D.     

Ruzsa’s constant on additive functions

A function f : N → R is called additive if f(mn)= f(m)+f(n)for all m, n with(m, n)= 1. Let μ(x)= max n≤x(f(n)f(n + 1))and ν(x)= max n≤x(f(n + 1)f(n)). In 1979, Ruzsa proved that there exists a constant c such that for any additive function f , μ(x)≤ cν(x 2 )+ c f , where c f is a constant depending only on f . Denote by R af the least such constant c. We call R af Ruzsa's constant on additive functions. In this paper, we prove that R af ≤ 20.     

On the number of combinations without unit separation

Let f(n, k) denote the number of ways of selecting k objects from n objects arrayed in a line with no two selected having unit separation (i.e., having exactly one object between them). Then, if $\text{n ? 2(k ? 1), f(n,k)=}\text{∑}\text{i=0}\text{κ}\text{(}\text{n?k+I?2i}\text{k?2i}\text{)}$ (where $\text{κ = [}\text{k}\text{2}\text{]}$). If n < 2(k ? 1), then f(n, k) = 0. In addition, f(n, k) satisfies the recurrence relation f(n, k) = f(n ? 1, k) + f(n ? 3, k ? 1) + f(n ? 4, k ? 2). If the objects are arrayed in a circle, and the corresponding number is denoted by g(n, k), then for n > 3, g(n, k) = f(n ? 2, k) + 2f(n ? 5, k ? 1) + 3f(n ? 6, k ? 2). In particular, if n ? 2k + 1 then $\text{(n,k)=(}\text{n?k}\text{k}\text{)+(}\text{n?k?1}\text{k?1}\text{)}$.     

Stirling polynomials

An investigation is made of the polynomials f_k(n) = S(n + k, n) and g_k(n) = (?1)^ks(n, n ? k), where S and s denote the Stirling numbers of the second and first kind, respectively. The main result gives a combinatorial interpretation of the coefficients of the polynomial (1 ? x)^2k+1Σ_n=0^∞f_k(n)xⁿ analogous to the well-known combinatorial interpretation of the Eulerian numbers in terms of descents of permutations.     

New Applications of the <Emphasis Type="Italic">p</Emphasis>-Adic Nevanlinna Theory

Let IK be an algebraically closed field of characteristic 0 complete for an ultrametric absolute value. Following results obtained in complex analysis, here we examine problems of uniqueness for meromorphic functions having finitely many poles, sharing points or a pair of sets (C.M. or I.M.) defined either in the whole field IK or in an open disk, or in the complement of an open disk. Following previous works in C, we consider functions fⁿ(x)f^m(ax + b), gⁿ(x)g^m(ax + b) with |a| = 1 and n ≠ m, sharing a rational function and we show that f/g is a n + m-th root of 1 whenever n + m ≥ 5. Next, given a small function w, if n, m ∈ IN are such that |n ? m|_∞ ≥ 5, then fⁿ(x)f^m(ax + b) ? w has infinitely many zeros. Finally, we examine branched values for meromorphic functions fⁿ(x)f^m(ax + b).     

Nonhomogeneous recursions and Generalised Continued Fractions

Consider the (n+1)st order nonhomogeneous recursionX _k+n+1=b _k X _k+n +a _k ⁽ⁿ⁾ X _k+n-1+...+a _k ⁽¹⁾ X _k +X _k .Leth be a particular solution, andf ⁽¹⁾,...,f ⁽ⁿ⁾,g independent solutions of the associated homogeneous equation. It is supposed thatg dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾ andh. If we want to calculate a solutiony which is dominated byg, but dominatesf ⁽¹⁾,...,f ⁽ⁿ⁾, then forward and backward recursion are numerically unstable. A stable algorithm is derived if we use results constituting a link between Generalised Continued Fractions and Recursion Relations.     

THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

Polynomials and primitive roots in finite fields

The primitive elements of a finite field are those elements of the field that generate the multiplicative group of k. If f(x) is a polynomial over k of small degree compared to the size of k, then f(x) represents at least one primitive element of k. Also f(x) represents an lth power at a primitive element of k, if l is also small. As a consequence of this, the following results holds.Theorem. Let g(x) be a square-free polynomial with integer coefficients. For all but finitely many prime numbers p, there is an integer a such that g(a) is equivalent to a primitive element modulo p.Theorem. Let l be a fixed prime number and f(x) be a square-free polynomial with integer coefficients with a non-zero constant term. For all but finitely many primes p, there exist integers a and b such that a is a primitive element and f(a) ≡ b¹ modulo p.     

Enumeration of the square permutations in Sn

Let f(n) denote the number of square permutations in the symmetric group S_n. This paper proves a conjecture that f(2k + 1) = (2k + 1)f(2k) and provides efficient procedures for the computation of f(n). The behavior of f(n) as n → ∞ is investigated and an asymptotic result obtained which shows that f(n) ～ 2Knⁿe^?n, where $\text{K = Π}{}_1{}^{\mathrm{\infty }}\text{cosh}\text{(}\text{1}\text{2k}\text{)}$.     

Binding number and minimum degree for the existence of (g,f,n)-critical graphs

Let G be a graph of order p. The binding number of G is defined as $\mbox{bind}(G):=\min\{\frac{|N_{G}(X)|}{|X|}\mid\emptyset\neq X\subseteq V(G)\,\,\mbox{and}\,\,N_{G}(X)\neq V(G)\}$ . Let g(x) and f(x) be two nonnegative integer-valued functions defined on V(G) with g(x)≤f(x) for any x∈V(G). A graph G is said to be (g,f,n)-critical if G?N has a (g,f)-factor for each N?V(G) with |N|=n. If g(x)≡a and f(x)≡b for all x∈V(G), then a (g,f,n)-critical graph is an (a,b,n)-critical graph. In this paper, several sufficient conditions on binding number and minimum degree for graphs to be (a,b,n)-critical or (g,f,n)-critical are given. Moreover, we show that the results in this paper are best possible in some sense.     

On the class of limits of lacunary trigonometric series

Let (n _k ) _k≧1 be a lacunary sequence of positive integers, i.e. a sequence satisfying n _k+1/n _k > q > 1, k ≧ 1, and let f be a “nice” 1-periodic function with ∝ ₀ ¹ f(x) dx = 0. Then the probabilistic behavior of the system (f(n _k x)) _k≧1 is very similar to the behavior of sequences of i.i.d. random variables. For example, Erd?s and Gál proved in 1955 the following law of the iterated logarithm (LIL) for f(x) = cos 2πx and lacunary $ (n_k )_{k \geqq 1} $ : (1) $$ \mathop {\lim \sup }\limits_{N \to \infty } (2N\log \log N)^{1/2} \sum\limits_{k = 1}^N {f(n_k x)} = \left\| f \right\|_2 $$ for almost all x ∈ (0, 1), where ‖f‖₂ = (∝ ₀ ¹ f(x)² dx)^1/2 is the standard deviation of the random variables f(n _k x). If (n _k ) _k≧1 has certain number-theoretic properties (e.g. n _k+1/n _k → ∞), a similar LIL holds for a large class of functions f, and the constant on the right-hand side is always ‖f‖₂. For general lacunary (n _k ) _k≧1 this is not necessarily true: Erd?s and Fortet constructed an example of a trigonometric polynomial f and a lacunary sequence (n _k ) _k≧1, such that the lim sup in the LIL (1) is not equal to ‖f‖₂ and not even a constant a.e. In this paper we show that the class of possible functions on the right-hand side of (1) can be very large: we give an example of a trigonometric polynomial f such that for any function g(x) with sufficiently small Fourier coefficients there exists a lacunary sequence (n _k ) _k≧1 such that (1) holds with √‖f‖ ₂ ² + g(x) instead of ‖f‖₂ on the right-hand side.     

On the Greatest Common Divisor of u ? 1 and v ? 1 with u and v Near S{\cal S}-units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality gcd (f(n)aⁿ+g(n), f₁(n)bⁿ+g₁(n)) < exp(ne){\rm gcd}\, (f(n)a^n+g(n), f_1(n)b^n+g_1(n)) < \exp(n\varepsilon) holds for all but finitely many positive integers n.     

Sur les entiers dont la somme des chiffres est moyenne

The goal of this paper is to study sets of integers with an average sum of digits. More precisely, let g be a fixed integer, s(n) be the sum of the digits of n in basis g. Let f:N→N such that, in any interval [g^ν,g^ν+1[, f(n) is constant and near from (g-1)ν/2. We give an asymptotic for the number of integers n<x such that s(n)=f(n) and we prove that for every irrational α the sequence (αn) is equidistributed mod 1, for n satisfying s(n)=f(n).     

Normality criteria of meromorphic functions with multiple zeros

Take positive integers n,k?2. Let F be a family of meromorphic functions in a domain D⊂C such that each f∈F has only zeros of multiplicity at least k. If, for each pair (f,g) in F, fn(f(k)) and gn(g(k)) share a non-zero complex number a ignoring multiplicity, then F is normal in D.     

Property (X) for Second-Order Nonlinear Differential Equations of Generalized Euler Type

In this paper the generalized nonlinear Euler differential equation t²k(tu′)u″ + t(f(u)+ k(tu′))u′ + g(u) = 0 is considered. Here the functions f(u), g(u) and k(u) satisfy smoothness conditions which guarantee the uniqueness of solutions of initial value problems, however, no conditions of sub(super) linearity are assumed. We present some necessary and sufficient conditions and some tests for the equivalent planar system to have or fail to have property (X⁺), which is very important for the existence of periodic solutions and oscillation theory.     

Periodic-type functionals and their extensions

Let Ω denote a simply connected domain in the complex plane and let $\text{K[Ω]}$ be the collection of all entire functions of exponential type whose Laplace transforms are analytic on Ω′, the complement of Ω with respect to the sphere. Define a sequence of functionals $\text{{L}{}_{\mathrm{n}}\text{}}\text{on}\text{K[Ω]}$ by $\text{L}{}_{\mathrm{n}}\text{(f) =}\text{1}\text{2πi}\text{∝}{}_{\mathrm{\Gamma }}\text{g}{}_{\mathrm{n}}\text{(ζ) F(ζ) dζ}$, where F denotes the Laplace transform of f, Γ ? Ω is a simple closed contour chosen so that F is analytic outside and on Ω, and g_n is analytic on Ω. The specific functionals considered by this paper are patterned after the Lidstone functions, L_2n(f) = f⁽²ⁿ⁾(0) and L_{2n + 1}(f) = f⁽²ⁿ⁾(1), in that their sequence of generating functions {g_n} are “periodic.” Set g_{pn + k}(ζ) = h_k(ζ) ζ^pn, where p is a positive integer and each h_k (k = 0, 1,…, p ? 1) is analytic on Ω. We find necessary and sufficient conditions for $\text{f ∈ k[Ω]}\text{with}\text{L}{}_{\mathrm{n}}\text{(f) = 0 (n = 0, 1,…)}$. DeMar previously was able to find necessary conditions [7]. Next, we generalize {L_n} in several ways and find corresponding necessary and sufficient conditions.     

Normal families of meromorphic functions and shared values

Let k be a positive integer, b ≠ 0 be a finite complex number, let P be a polynomial with either deg P ≥ 3 or deg P = 2 and P having only one distinct zero, and let F{\mathcal{F}} be a family of functions meromorphic in a domain D, all of whose zeros have multiplicities at least k. If, each pair of functions f and g in F, P(f)f^(k){\mathcal{F}, P(f)f^{(k)}} and P(g)g ^(k) share b in D, then F{\mathcal{F}} is normal in D.     

Some relations among multiplicative and <Emphasis Type="Italic">q</Emphasis>-additive functions

We give all solutions of the equation f(n) = g(n) + h(n) for every n ∈ ?, where f is a completely multiplicative, g is a 2-additive, and h is a 3-additive function. We also determine all completely multiplicative functions f and all q-additive functions g for which f(n) = g ²(n) for every n ∈ ?.     

On solutions of “equations in symmetric groups”

Let x?S_n, the symmetric group on n symbols. Let θ? Aut(S_n) and let the automorphim order of x with respect to θ be defined by

$\text{γθ(x)=}\text{min}\text{{k:x xθ xθ}{}^2\text{? xθ}{}^{\mathrm{k?1}}\text{=1}}$

where xθ is the image of x under θ. Let α_g? Aut(S_n) denote conjugation by the element g?S_n. Let where s and k are positive integers and $\text{a}\text{b}$ denotes a divides b. Further h(s, k : n) ≡ b(1; s, k : n), where 1 denotes the identity automorphim. If g?S_n let c = f(g, s) denote the number of symbols in g which are in cycles of length not dividing the integer s, and let g_s denote the product of all cycles in g whose lengths do not divide s. Then g_s moves c symbols. The main results proved are: (1) recursion: if n ? c + 1 and t = n ? c ? 1 then $\text{b(g; s, 1:n)=∑}{}_{\mathrm{<mtext>i</mtext><mtext>s</mtext>}}\text{b(g; s, 1:n?1)(}{}^{\mathrm{t}}{}_{\mathrm{i?1}}\text{(i?1)!}$ (2) reduction: b(g; s, 1 : c)h(s, 1 : i) = b(g; s, 1 : i + c); (3) distribution: let D(θ, n) ≡ {(k, b) : k?Z⁺ and b = b(θ; 1, k : n) ≠ 0}; then D(θ, m) = D(φ, m) ∨ m ? N = N(θ, φ) iff θ is conjugate to φ; (4) evaluation: the number of cycles in g_s^s of any given length is smaller than the smallest prime dividing s iff b(g_s; s, 1 : c) = 1. If g = (12 … p^m)^t and $\text{sk}\text{p}{}^{\mathrm{m}}$ then $\text{b(g;s,k:p}{}^{\mathrm{m}}\text{) {}{}^0{}_{\mathrm{\pm 1}}\text{(}\text{mod}\text{p)}$.