A binary linear recurrence sequence of composite numbers

Let (a,b)∈Z², where b≠0 and (a,b)≠(±2,−1). We prove that then there exist two positive relatively prime composite integers x₁, x₂ such that the sequence given by xn+1=axn+bxn−1, n=2,3,… , consists of composite terms only, i.e., |xn| is a composite integer for each n∈N. In the proof of this result we use certain covering systems, divisibility sequences and, for some special pairs (a,±1), computer calculations. The paper is motivated by a result of Graham who proved this theorem in the special case of the Fibonacci-like sequence, where (a,b)=(1,1).     

Integral complete multipartite graphs

A graph is called integral if all eigenvalues of its adjacency matrix are integers. In this paper, we investigate integral complete r-partite graphs K_p1,p2,…,pr=K_{a1·p1,a2·p2,…,as·ps} with s=3,4. We can construct infinite many new classes of such integral graphs by solving some certain Diophantine equations. These results are different from those in the existing literature. For s=4, we give a positive answer to a question of Wang et al. [Integral complete r-partite graphs, Discrete Math. 283 (2004) 231-241]. The problem of the existence of integral complete multipartite graphs K_{a1·p1,a2·p2,…,as·ps} with arbitrarily large number s remains open.     

Twisted Hecke L-values and period polynomials

Let f₁,…,fd be an orthogonal basis for the space of cusp forms of even weight 2k on Γ₀(N). Let L(fi,s) and L(fi,χ,s) denote the L-function of fi and its twist by a Dirichlet character χ, respectively. In this note, we obtain a “trace formula” for the values at integers m and n with 0<m,n<2k and proper parity. In the case N=1 or N=2, the formula gives us a convenient way to evaluate precisely the value of the ratio L(f,χ,m)/L(f,n) for a Hecke eigenform f.     

Generalized radix representations and dynamical systems. IV

For r = (r₁,…, r_d) ∈ ?^d the mapping τ_r:?^d →?^d given byτ_r(a₁,…,a_d) = (a₂, …, a_d,−⌊r₁a₁+…+ r_da_d⌋)where ⌊·⌋ denotes the floor function, is called a shift radix system if for each a ∈ ?^d there exists an integer k > 0 with τ_r^k(a) = 0. As shown in Part I of this series of papers, shift radix systems are intimately related to certain well-known notions of number systems like β-expansibns and canonical number systems. After characterization results on shift radix systems in Part II of this series of papers and the thorough investigation of the relations between shift radix systems and canonical number systems in Part III, the present part is devoted to further structural relationships between shift radix systems and β-expansions. In particular we establish the distribution of Pisot polynomials with and without the finiteness property (F).     

Polynomial Cunningham chains

A sequence of prime numbers p₁,p₂,p₃,…, such that pi=2pi−1+? for all i, is called a Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the smallest positive integer such that 2pk+? is composite, then we say the chain has length k. It is conjectured that there are infinitely many Cunningham chains of length k for every positive integer k. A sequence of polynomials f₁(x),f₂(x),… in Z[x], such that f₁(x) has positive leading coefficient, each fi(x) is irreducible in Q[x] and fi(x)=xfi−1(x)+? for all i, is defined to be a polynomial Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the least positive integer such that fk+1(x) is reducible in Q[x], then we say the chain has length k. In this article, for polynomial Cunningham chains of both kinds, we prove that there are infinitely many chains of length k and, unlike the situation in the integers, that there are infinitely many chains of infinite length, by explicitly giving infinitely many polynomials f₁(x), such that fk+1(x) is the only term in the sequence that is reducible.     

Periodic decomposition of measurable integer valued functions

We study those functions that can be written as a sum of (almost everywhere) integer valued periodic measurable functions with given periods. We show that being (almost everywhere) integer valued measurable function and having a real valued periodic decomposition with the given periods is not enough. We characterize those periods for which this condition is enough. We also get that the class of bounded measurable (almost everywhere) integer valued functions does not have the so-called decomposition property. We characterize those periods a₁,…,ak for which an almost everywhere integer valued bounded measurable function f has an almost everywhere integer valued bounded measurable (a₁,…,ak)-periodic decomposition if and only if Δa₁?Δakf=0, where Δaf(x)=f(x+a)−f(x).     

Divisibility properties of power GCD matrices and power LCM matrices

Let a,b and n be positive integers and the set S={x₁,…,x_n} of n distinct positive integers be a divisor chain (i.e. there exists a permutation σ on {1,…,n} such that x_σ(1)|…|x_σ(n)). In this paper, we show that if a|b, then the ath power GCD matrix (S^a) having the ath power (x_i,x_j)^a of the greatest common divisor of x_i and x_j as its i,j-entry divides the bth power GCD matrix (S^b) in the ring M_n(Z) of n×n matrices over integers. We show also that if a?b and n?2, then the ath power GCD matrix (S^a) does not divide the bth power GCD matrix (S^b) in the ring M_n(Z). Similar results are also established for the power LCM matrices.     

Partitions of natural numbers with the same representation functions

For a set A of nonnegative integers the representation functions R₂(A,n), R₃(A,n) are defined as the number of solutions of the equation n=a+a^′,a,a^′∈A with a<a^′, a?a^′, respectively. Let D(0)=0 and let D(a) denote the number of ones in the binary representation of a. Let A₀ be the set of all nonnegative integers a with even D(a) and A₁ be the set of all nonnegative integers a with odd D(a). In this paper we show that (a) if R₂(A,n)=R₂(N?A,n) for all n?2N−1, then R₂(A,n)=R₂(N?A,n)?1 for all n?12N²−10N−2 except for A=A₀ or A=A₁; (b) if R₃(A,n)=R₃(N?A,n) for all n?2N−1, then R₃(A,n)=R₃(N?A,n)?1 for all n?12N²+2N. Several problems are posed in this paper.     

A complete determination of Rabinowitsch polynomials

Let m be a positive integer and fm(x) be a polynomial of the form fm(x)=x²+x−m. We call a polynomial fm(x) a Rabinowitsch polynomial if for and consecutive integers x=x₀,x₀+1,…,x₀+s−1, |fm(x)| is either 1 or prime. In this paper, we show that there are exactly 14 Rabinowitsch polynomials fm(x).     

On the Bateman-Horn Conjecture

Let r be a positive integer and f₁,…,f_r be distinct polynomials in Z[X]. If f₁(n),…,f_r(n) are all prime for infinitely many n, then it is necessary that the polynomials f_i are irreducible in Z[X], have positive leading coefficients, and no prime p divides all values of the product f₁(n)···f_r(n), as n runs over Z. Assuming these necessary conditions, Bateman and Horn (Math. Comput.16 (1962), 363-367) proposed a conjectural asymptotic estimate on the number of positive integers n?x such that f₁(n),…,f_r(n) are all primes. In the present paper, we apply the Hardy-Littlewood circle method to study the Bateman-Horn conjecture when r?2. We consider the Bateman-Horn conjecture for the polynomials in any partition {f₁,…,f_s}, {f_s+1,…,f_r} with a linear change of variables. Our main result is as follows: If the Bateman-Horn conjecture on such a partition and change of variables holds true with some conjectural error terms, then the Bateman-Horn conjecture for f₁,…,f_r is equivalent to a plausible error term conjecture for the minor arcs in the circle method.     

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic sequences whose general term has the form un=an(n+t)+b with (a,t,b)∈Z³, a?5, t?0, gcd(a,b)=1. From this, we deduce for instance the lower bound: lcm{¹²+1,²²+1,…,n²+1}?0,32n(1,442) (for all n?1). In the last part of this article, we study the integer lcm(n,n+1,…,n+k) (k∈N, n∈N^∗). We show that it has a divisor dn,k simple in its dependence on n and k, and a multiple mn,k also simple in its dependence on n. In addition, we prove that both equalities: lcm(n,n+1,…,n+k)=dn,k and lcm(n,n+1,…,n+k)=mn,k hold for an infinitely many pairs (n,k).     

A recurrence formula for leaping convergents of non-regular continued fractions

Given a continued fraction [a₀;a₁,a₂,…], p_n/q_n=[a₀;a₁,…,a_n] is called the n-th convergent for n=0,1,2,…. Leaping convergents are those of every r-th convergent p_rn+i/q_rn+i (n=0,1,2,…) for fixed integers r and i with r?2 and i=0,1,…,r-1. This leaping step r can be chosen as the length of period in the continued fraction. Elsner studied the leaping convergents p_3n+1/q_3n+1 for the continued fraction of and obtained some arithmetic properties. Komatsu studied those p_3n/q_3n for (s?2). He has also extended such results for some more general continued fractions. Such concepts have been generalized in the case of regular continued fractions. In this paper leaping convergents in the non-regular continued fractions are considered so that a more general three term relation is satisfied. Moreover, the leaping step r need not necessarily to equal the length of period. As one of applications a new recurrence formula for leaping convergents of Apery’s continued fraction of ζ(3) is shown.     

Ramsey regions

Let (T₁,T₂,…,T_c) be a fixed c-tuple of sets of graphs (i.e. each T_i is a set of graphs). Let R(c,n,(T₁,T₂,…,T_c)) denote the set of all n-tuples, (a₁,a₂,…,a_n), such that every c-coloring of the edges of the complete multipartite graph, K_a1,a2,…,an, forces a monochromatic subgraph of color i from the set T_i (for at least one i). If N denotes the set of non-negative integers, then R(c,n,(T₁,T₂,…,T_c))⊆Nⁿ. We call such a subset of Nⁿ a “Ramsey region”. An application of Ramsey's Theorem shows that R(c,n,(T₁,T₂,…,T_c)) is non-empty for n?0. For a given c-tuple, (T₁,T₂,…,T_c), known results in Ramsey theory help identify values of n for which the associated Ramsey regions are non-empty and help establish specific points that are in such Ramsey regions. In this paper, we develop the basic theory and some of the underlying algebraic structure governing these regions.     

A multiplicative inequality for vertex Folkman numbers

Let G be a graph and a₁,…,a_r be positive integers. The symbol G→(a₁,…,a_r) denotes that in every r-coloring of the vertex set V(G) there exists a monochromatic a_i-clique of color i for some i∈{1,…,r}. The vertex Folkman numbers F(a₁,…,a_r;q)=min{|V(G)|:G→(a₁,…,a_r) and K_q?G} are considered. Let a_i, b_i, c_i, i∈{1,…,r}, s, t be positive integers and c_i=a_ib_i, 1?a_i?s,1?b_i?t. Then we prove that

F(c₁,c₂,…,c_r;st+1)?F(a₁,a₂,…,a_r;s+1)F(b₁,b₂,…,b_r;t+1).     

Regularity of patterns in the factorization of n!

Consider the multiplicities ep₁(n),ep₂(n),…,epk(n) in which the primes p₁,p₂,…,pk appear in the factorization of n!. We show that these multiplicities are jointly uniformly distributed modulo (m₁,m₂,…,mk) for any fixed integers m₁,m₂,…,mk, thus improving a result of Luca and St?nic? [F. Luca, P. St?nic?, On the prime power factorization of n!, J. Number Theory 102 (2003) 298-305]. To prove the theorem, we obtain a result regarding the joint distribution of several completely q-additive functions, which seems to be of independent interest.     

On fractal properties of non-normal numbers with respect to Rényi f-expansions generated by piecewise linear functions

The paper is devoted to the study of fractal properties of subsets of the set of non-normal numbers with respect to Rényi f  -expansions generated by continuous increasing piecewise linear functions defined on [0,+∞)$[0,+\infty )$. All such expansions are expansions for real numbers generated by infinite linear IFS f={_f0,_f1,…,_fn,…}$f=\{f_0,f_1,\dots ,f_n,\dots \}$ with the following list of ratios _Q∞=(_q0,_q1,…,_qn,…)$Q_{\infty }=(q_0,q_1,\dots ,q_n,\dots )$.     

Bernstein operators for extended Chebyshev systems

Let U_n ⊂ Cⁿ[a, b] be an extended Chebyshev space of dimension n + 1. Suppose that f₀ ∈ U_n is strictly positive and f₁ ∈ U_n has the property that f₁/f₀ is strictly increasing. We search for conditions ensuring the existence of points t₀, …, t_n ∈ [a, b] and positive coefficients α₀, …, α_n such that for all f ∈ C[a, b], the operator B_n:C[a, b] → U_n defined by satisfies B_nf₀ = f₀ and B_nf₁ = f₁. Here it is assumed that p_n,k, k = 0, …, n, is a Bernstein basis, defined by the property that each p_n,k has a zero of order k at a and a zero of order n − k at b.     

Siegel's lemma with additional conditions

Let K be a number field, and let W be a subspace of KN, N?1. Let V₁,…,VM be subspaces of KN of dimension less than dimension of W. We prove the existence of a point of small height in , providing an explicit upper bound on the height of such a point in terms of heights of W and V₁,…,VM. Our main tool is a counting estimate we prove for the number of points of a subspace of KN inside of an adelic cube. As corollaries to our main result we derive an explicit bound on the height of a nonvanishing point for a decomposable form and an effective subspace extension lemma.     

Nevanlinna-Pick interpolation by rational functions with a single pole inside the unit disk

We devise an efficient algorithm that, given points z₁,…,z_k in the open unit disk D and a set of complex numbers {f_i,0,f_i,1,…,f_i,ni−1} assigned to each z_i, produces a rational function f with a single (multiple) pole in D, such that f is bounded on the unit circle by a predetermined positive number, and its Taylor expansion at z_i has f_i,0,f_i,1,…,f_i,ni−1 as its first n_i coefficients.     

Normal families and value distribution in connection with composite functions

We prove a value distribution result which has several interesting corollaries. Let k∈N, let α∈C and let f be a transcendental entire function with order less than 1/2. Then for every nonconstant entire function g, we have that (f○g)^(k)−α has infinitely many zeros. This result also holds when k=1, for every transcendental entire function g. We also prove the following result for normal families. Let k∈N, let f be a transcendental entire function with ρ(f)<1/k, and let a₀,…,ak−1,a be analytic functions in a domain Ω. Then the family of analytic functions g such that