On the distribution of the roots of certain congruences and a problem for additive arithmetic functions

The asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D varies, is investigated. Quantitative estimates are obtained by means of exponential sums combined with sieve methods. As an application of the results it is shown that if an additive arithmetic function satisfies f(an + b) ? f(cn + d) = O(1) for all positive integers n, ad ≠ bc, then f(n) = O((log n)³) must hold. This result is apparently the first bound of any kind in such a situation.     

Differential polynomials sharing one value

In this paper, we investigate uniqueness problems of differential polynomials of meromorphic functions. Let a, b be non-zero constants and let n, k be positive integers satisfying n ≥ 3k+12. If fⁿ + af^(k) and gⁿ + ag^(k) share b CM and the b-points of fⁿ + af^(k) are not the zeros of f and g, then f and g are either equal or closely related.     

An improvement of Montel's criterion

Let F be a family of holomorphic functions in a domain D, and let a(z), b(z) be two holomorphic functions in D such that a(z)?b(z), and a(z)?a^′(z) or b(z)?b^′(z). In this paper, we prove that: if, for each f∈F, f(z)−a(z) and f(z)−b(z) have no common zeros, f^′(z)=a(z) whenever f(z)=a(z), and f^′(z)=b(z) whenever f(z)=b(z) in D, then F is normal in D. This result improves and generalizes the classical Montel's normality criterion, and the related results of Pang, Fang and the first author. Some examples are given to show the sharpness of our result.     

A note on the diophantine equation (a n − 1)(b n − 1) = x 2

Let a, b be fixed positive integers such that a ≠ b, min(a, b) > 1, ν(a?1) and ν(b ? 1) have opposite parity, where ν(a ? 1) and ν(b ? 1) denote the highest powers of 2 dividing a ? 1 and b ? 1 respectively. In this paper, all positive integer solutions (x, n) of the equation (a ⁿ ? 1)(b ⁿ ? 1) = x ² are determined.     

The Hardy classes for functions in the class MV[α, k]

Suppose that f(z) = z + a₂z² + ··· + a_nz_n + ··· is regular in the unit disc $\text{D}\text{with}\text{[f(z) f′}\text{(z)}\text{z] ≠ 0}\text{in}\text{D}$, and further let α ? 0 and k ? 2. If $\text{∝}{}^{\mathrm{2\pi }}{}_{\mathrm{o}}\text{¦}\text{Re}\text{{(1 ? α)z[}\text{f′(z)}\text{f(z)}\text{] + α(1 + z[}\text{f″(z)}\text{f′(z)}\text{])}¦ dθ ? kπ}\text{for}\text{z ? D}$, then f(z) is said to belong to the class MV[α, k]. This class contains many of the special classes of regular and univalent functions. The authors determine the Hardy classes of which f(z), f′(z) and f″(z) belong and obtain growth estimates of a_n.     

On simple modules of Hecke algebras of type Dn

This is a continuation of our previous work. We classify all the simple ?_q(D _n )-modules via an automorphismh defined on the set { λ | D^λ ≠ 0}. Whenf _n(q) ≠ 0, this yields a classification of all the simple ? ^q (D _n)- modules for arbitrary n. In general ( i. e., q arbitrary), if λ⁽¹⁾ = λ⁽²⁾,wegivea necessary and sufficient condition ( in terms of some polynomials ) to ensure that the irreducible ?_q,1(B _n )- module D^λ remains irreducible on restriction to ?_q(D _n ).     

Some results on the entire function sharing problem

Our main result is as follows: let f and a be two entire functions such that \(\max \{ \rho _2 (f),\rho _2 (a)\} < \tfrac{1} {2}\) . If f and f ^(k) a CM, and if ρ(a ^(k) ? a) < ρ(f ? a), then f ^(k) ? a = c(f ? a) for some nonzero constant c. This result is applied to improve a result of Gundersen and Yang.     

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.     

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{)}$.     

Upper bounds for the autocorrelation coefficients of the Rudin-Shapiro polynomials

Givena _m to be them ^th correlation coefficient of the Rudin-Shapiro polynomials of degrees 2 ⁿ ? 1, ¦a _m¦ ≤ C(2 ⁿ )^3/4 and there existsk ≠ 0 such that ¦a _k¦ >D(2 ⁿ )^0.73 (C andD are universal constants). Here we show that the 0.73 is optimal in the upper bound case.     

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)}$.     

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).     

Probabilities of dominant candidates based on first-place votes

Suppose each of an odd number n of voters has a strict preference order on the three ‘candidates’ in {1,2,3} and votes for his most preferred candidate on a plurality ballot. Assume that a voter who votes for i is equally likely to have ijk and ikj as his preference order when {i,j,k} = {1,2,3}.Fix an integer m between $\text{1}\text{2}$(n + 1) and n inclusive. Then, given that n_i of the n voters vote for i, let f_m(n₁,n₂,n₃) be the probability that one of the three candidates is preferred by m or more voters to each of the other two.This paper examines the behavior of f_m over the lattice points in L_n, the set of triples of non-negative integers that sum to n. It identifies the regions in L_n where f_m is 1 and where f_m is 0, then shows that f_m(a,b + 1, c)>f_m(a + 1,b,c) whenever a + b + c + 1 = n, a≤c≤b, a<c<m and c≤n ? m. These results are used to partially identify the points in L_n where f_m is minimized subject to f_m>0. It is shown that at least two of the n_i are equal at minimizing points.     

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.     

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.     

A combinatorial problem involving graphs and matrices

In this paper we discuss a combinatorial problem involving graphs and matrices. Our problem is a matrix analogue of the classical problem of finding a system of distinct representatives (transversal) of a family of sets and relates closely to an extremal problem involving 1-factors and a long standing conjecture in the dimension theory of partially ordered sets. For an integer n ?1, let n denote the n element set {1,2,3,…, n}. Then let A be a k×t matrix. We say that A satisfies property P(n, k) when the following condition is satisfied: For every k-taple (x₁,x₂,…,x_k?n^k there exist k distinct integers j₁,j₂,…,j_k so that x_i= a_ii for i= 1,2,…,k. The minimum value of t for which there exists a k × t matrix A satisfying property P(n,k) is denoted by f(n,k). For each k?1 and n sufficiently large, we give an explicit formula for f(n, k): for each n?1 and k sufficiently large, we use probabilistic methods to provide inequalities for f(n,k).     

Normality of meromorphic functions whose derivatives have 1-points

Let k be a positive integer and let ${\mathcal F}Let k be a positive integer and let F{\mathcal F} be a family of functions meromorphic in a plane domain D, all of whose zeros have multiplicity at least k + 3. If there exists a subset E of D which has no accumulation points in D such that for each function f ? F{f\in\mathcal F}, f ^(k)(z) − 1 has no zeros in D\E{D\setminus E}, then F{\mathcal F} is normal. The number k + 3 is sharp. The proof uses complex dynamics.     

Normal families and shared functions of meromorphic functions

Let k be a positive integer, let M be a positive number, let F be a family of meromorphic functions in a domain D, all of whose zeros are of multiplicity at least k, and let h be a holomorphic function in D, h ≢ 0. If, for every f ∈ F, f and f ^(k) share 0, and |f(z)| ≥ M whenever f ^(k)(z) = h(z), then F is normal in D. The condition that f and f ^(k) share 0 cannot be weakened, and the condition that |f(z)| ≥ M whenever f ^(k)(z) = h(z) cannot be replaced by the condition that |f(z)| ≥ 0 whenever f ^(k)(z) = h(z). This improves some results due to Fang and Zalcman [2] etc.     

Distortion Properties of Holomorphic Functions of Several Complex Variables

Let Q(D) be a class of functions q, q(0) = 0, |q(z)| < 1 holomorphic in the Reinhardt domain D ? C ⁿ, a and b — arbitrary fixed numbers satisfying the condition — 1 ≤ b < a ≤ 1. ??(a, b; D) — the class of functions p such that p ? ??(a, b; D) iff for some q ? Q(D) and every z ? D. S*(a, b; D) — the class of functions f such that f ? S*(a, g; D) iff S^c(a, b; D) — the class of functions q such that q ? S^c(a, b; D) iff , where p ε ??(a, b; D) and K is an operator of the form for z=z₁,z₂,…z_n. The author obtains sharp bounds on |p(z)|, f(z)| g(z)| as well as sharp coefficient inequalities for functions in ??(a, b; D), S*(a, b; D) and S^c(a, b; D).     

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.