Asymptotic behavior of solutions of linear homogeneous second-order difference equations

We analyze and study the asymptotic behavior (asn→∞) of the general solutionx _n of the equationx _n+2 =Ax _n +Bx _n+1 ,A≠0,n=0,1,2,..., for various possible values of coefficients and initial data. Translated fromMatematicheskie Zametki, Vol. 66, No. 2, pp. 211–215, August, 99.     

Disjunctive Rado numbers

If L₁ and L₂ are linear equations, then the disjunctive Rado number of the set {L₁,L₂} is the least integer n, provided that it exists, such that for every 2-coloring of the set {1,2,…,n} there exists a monochromatic solution to either L₁ or L₂. If such an integer n does not exist, then the disjunctive Rado number is infinite. In this paper, it is shown that for all integers and b1, the disjunctive Rado number for the equations x₁+a=x₂ and x₁+b=x₂ is a+b+1-gcd(a,b) if is odd and the disjunctive Rado number for these equations is infinite otherwise. It is also shown that for all integers a>1 and b>1, the disjunctive Rado number for the equations ax₁=x₂ and bx₁=x₂ is c^s+t-1 if there exist natural numbers c,s, and t such that a=c^s and b=c^t and s+t is an odd integer and c is the largest such integer, and the disjunctive Rado number for these equations is infinite otherwise.     

On the equivalence of the Euler-Pommier operators in spaces of analytic functions

In the space A (θ) of all one-valued functions f(z) analytic in an arbitrary region G ? ? (0 ∈ G) with the topology of compact convergence, we establish necessary and sufficient conditions for the equivalence of the operators L ₁=α _n z ⁿ Δ ⁿ + ... + α₁ zΔ+α₀ E and L ₂= z ⁿ a _n (z)Δ ⁿ + ... + za ₁(z)Δ+a ₀(z)E, where δ: (Δ?)(z)=(f(z)-?(0))/z is the Pommier operator in A(G), n ∈ ?, α _n ∈ ?, a _k (z) ∈ A(G), 0≤k≤n, and the following condition is satisfied: Σ _j=s ^n?1 α _j+1 ∈ 0, s=0,1,...,n?1. We also prove that the operators z ^s+1Δ+β(z)E, β(z) ∈ A _R , s ∈ ?, and z ^s+1 are equivalent in the spaces A _R, 0?R?-∞, if and only if β(z) = 0.     

On the tournament matrices with smallest rank

A tournament matrix is a square zero-one matrix A satisfying the equation A+A^t = J ? I, where J is the all-ones matrix. In [1] it was proved that if A is an n × n tournament matrix, then the rank of A is at least (n - 1)/2, over any field; and in characteristic zero rank (A) equals n - 1 or n. Michael [3] has constructed examples having rank (n - 1)/2; they are double borderings of Hadamard tournaments of order n - 2, and so must satisfy n ≡ 1 (mod 4). In this note, we supplement this result by showing that an analogous construction is sometimes impossible when n ≡ 3 (mod 4).     

Singular series in the problem of the representation of a system of numbers by a system of forms

A system of Diophantine equations is considered for integers n₁,...,₂, $$\phi ^{\left( k \right)} \left( {x_1 , \ldots ,x_s } \right) = n_k \left( {k = 1, \ldots ,2} \right)$$ , Ф^(k)(x₁,...,x_s)=n_k (k=1,...,ρ), where Ф^(k) are integral forms of degree d is s variables. The singular integral and singular series of this problem are investigated.     

Une famille remarquable de suites recurrentes lineaires

Letu(n) be a recurrent sequence of rational integers, i.e.,u(n+s)+a _s–1 u(n+s–1)+...+a ₀ u(n)=0,n0,a _i,i=0,...,s–1. The polynomialP(x)=x ^s +a _s–1x^s +...+a ₀ is the companion or the characteristic polynomial of the recurrence. It is known that if none of the ratios of the roots ofP is a root of unity, then the setA={n,u(n)=0} is finite. A recent result of F. Beukers shows that ifs=3, then the setA has at most 6 elements and there exists, up to trivial transformations, only one recurrence of order 3 with 6 zeros, found by J. Berstel. In this paper, we construct for eachs, s2 a recurrent sequence of orders, with at leasts ²/2+s/2–1 zeroes, which generalize Berstel's sequence.

     

Null ideals and spanning ranks of matrices

Let Rbe a commutative ring and A?M _m×n . The spanning rank of Ais the smallest positive integer s for which A=PQ(m×s s×n) The spanning rank of the zero matrix is set equal to zero. If Ris a field, then the spanning rank of Ais just the classical rank of A. In the first section of this paper, various theorems and examples are given which indicate how much of the classical theory of rank is still valid for spanning rank over a commutative ring. If A= PQ(n×s s×n) is a spanning rank factorization of a square matrix and D= QP, then Dis called a spanning rank partner of A. In the second part of this paper, the null ideals N _Aand N _Dof Aand Drespectively are compared. For instance, we show N _A=N _Dif s= nand N _A= XN _Dif s<nwhenever Ris a PIDand A≠0. This result sometimes (e.g. s<<n) makes the computation of N _Aeasy.     

Distance matrices for points on a line,on a circle,and at the vertices of ann-dimensional cube

Forn pointsA _i ,i=1, 2, ...,n, in Euclidean space ℝ ^m , the distance matrix is defined as a matrix of the form D=(D _i ,j) _i ,j=1,...,n, where theD _i ,j are the distances between the pointsA _i andA _j . Two configurations of pointsA _i ,i=1, 2,...,n, are considered. These are the configurations of points all lying on a circle or on a line and of points at the vertices of anm-dimensional cube. In the first case, the inverse matrix is obtained in explicit form. In the second case, it is shown that the complete set of eigenvectors is composed of the columns of the Hadamard matrix of appropriate order. Using the fact that distance matrices in Euclidean space are nondegenerate, several inequalities are derived for solving the system of linear equations whose matrix is a given distance matrix. Translated fromMatematicheskie Zametki, Vol. 58, No. 1, pp. 127–138, July, 1995.     

Moments of Absorption Time for a Conditioned Random Walk

A random walk on the set of integers {0,1,2,...,a} with absorbing barriers at 0 and a is considered. The transition times from the integers z (0<z<a) are random variables with finite moments. The nth moment of the time to absorption at a, D_z,n, conditioned on the walk starting at z and being absorbed at a, is discussed, and a difference equation with boundary values and initial values for D_z,n is given. It is solved in several special cases. The problem is motivated by questions from biology about tumor growth and multigene evolution which are discussed.     

New pairs of -sequences with 4-level cross-correlation

Let ω be a primitive element of GF(2ⁿ), where . Let d=(2^2k+2^s+1-2^k+1-1)/(2^s-1), where n=2k, and s is such that 2s divides k. We prove that the binary m-sequences s(t)=tr(ω^t) and s(dt) have a four-level cross-correlation function and give the distribution of the values.     

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.     

Quadrature formulae connected to σ-orthogonal polynomials

Let dλ(t) be a given nonnegative measure on the real line , with compact or infinite support, for which all moments exist and are finite, and μ₀>0. Quadrature formulas of Chakalov–Popoviciu type with multiple nodes

where σ=σ_n=(s₁,s₂,…,s_n) is a given sequence of nonnegative integers, are considered. A such quadrature formula has maximum degree of exactness d_max=2∑_ν=1ⁿs_ν+2n−1 if and only if

The proof of the uniqueness of the extremal nodes τ₁,τ₂,…,τ_n was given first by Ghizzetti and Ossicini (Rend. Mat. 6(8) (1975) 1–15). Here, an alternative simple proof of the existence and the uniqueness of such quadrature formulas is presented. In a study of the error term R(f), an influence function is introduced, its relevant properties are investigated, and in certain classes of functions the error estimate is given. A numerically stable iterative procedure, with quadratic convergence, for determining the nodes τ_ν, ν=1,2,…,n, which are the zeros of the corresponding σ-orthogonal polynomial, is presented. Finally, in order to show a numerical efficiency of the proposed procedure, a few numerical examples are included.     

Transcendence of reciprocal sums of binary recurrences

Let {R _n } _n≥0 be a binary linear recurrence defined by R _n+2 = A R _n+1 + B R _n (n ≥ 0), where A, B, R ₀, R ₁ are integers and Δ = A ² + 4B > 0. We give necessary and sufficient conditions for the transcendence of the numbers

Stability of <Emphasis Type="Italic">n</Emphasis>-particle pseudorelativistic systems

For a system Z_n of n identical pseudorelativistic particles, we show that under some restrictions on the pair interaction potentials, there is an infinite sequence of numbers n_s, s = 1, 2,..., such that the system Z_n is stable for _n = n_s, and the inequality sup _sn_s+1n _s ⁻¹ < + ∞ holds. Furthermore, we show that if the system Z_n is stable, then the discrete spectrum of the energy operator for the relative motion of the system Z_n is nonempty for some values of the total momentum of the particles in the system. The stability of n-particle systems was previously studied only for nonrelativistic particles. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 152, No. 3, pp. 528–537, September, 2007.     

On a problem in additive number theory

For a set A, let P(A) be the set of all finite subset sums of A. We prove that if a sequence B={b ₁<b ₂<⋯} of integers satisfies b ₁≧11 and b _n+1≧3b _n +5 (n=1,2,…), then there exists a sequence of positive integers A={a ₁<a ₂<⋯} for which P(A)=ℕ∖B. On the other hand, if a sequence B={b ₁<b ₂<⋯} of positive integers satisfies either b ₁=10 or b ₂=3b ₁+4, then there is no sequence A of positive integers for which P(A)=ℕ∖B.     

The postage stamp problem and arithmetic in base <Emphasis Type="Italic">r</Emphasis>

Let h, k be fixed positive integers, and let A be any set of positive integers. Let hA ≔ {a ₁ + a ₂ + ... + a _r : a _i ∈ A, r ⩽ h} denote the set of all integers representable as a sum of no more than h elements of A, and let n(h, A) denote the largest integer n such that {1, 2,...,n} ⊆ hA. Let n(h, k) := : n(h, A), where the maximum is taken over all sets A with k elements. We determine n(h, A) when the elements of A are in geometric progression. In particular, this results in the evaluation of n(h, 2) and yields surprisingly sharp lower bounds for n(h, k), particularly for k = 3.     

On a Conjecture of Kemnitz

A classic theorem of Erdis, Ginzburg and Ziv states that in a sequence of 2n-1 integers there is a subsequence of length n whose sum is divisble by n. This result has led to several extensions and generalizations. A multi-dimensional problem from this line of research is the following. Let Z_nZ_n stand for the additive group of integers modulo n. Let s(n, d) denote the smallest integer s such that in any sequence of s elements from Z_n^dZ_n^d (the direct sum of d copies of Z_nZ_n) there is a subsequence of length n whose sum is 0 in Z_n^dZ_n^d. Kemnitz conjectured that s(n, 2) = 4n - 3. In this note we prove that s(p,2) ￡ 4p - 2s(p,2) \le 4p - 2 holds for every prime p. This implies that the value of s(p, 2) is either 4p-3 or 4p-2. For an arbitrary positive integer n it follows that s(n, 2) ￡ (41/10)ns(n, 2) \le (41/10)n. The proof uses an algebraic approach.     

The number of nearest and farthest points to a compactum in Euclidean space

A typical (in the sense of Baire category) compactA inE, whereE is either the Euclidean spaceE ⁸,s≧2, or the separable Hilbert space ℍ, generates a dense subsetC ^n,m(A) of the underlying space, such that everyx∈C ^n,m(A) has exactlyn nearest andm farthest points fromA, whenevern andm are positive integers satisfyingn+m≦ dimE+2. Research of this author is in part supported by Consiglio Nazionale delle Ricerche, G.N.A.F.A., Italy.     

A braidlike presentation of Sp(n,p)

Forn even andp an odd prime a symplectic group Sp(n, p) is a quotient of the Artin braid groupB _n+1. Ifs ₁, …,s _n are standard generators ofB _n+1 then the kernel of the corresponding epimorphism is the normal closure of just four elements:s ₁ ^p ,(s ₁ s ₂)⁶,s ₁ ^(p+1)/2 s ₂ ⁴ s ₁ ^(p−1)/2 s ₂ ⁻² s ₁ ⁻¹ s ₂ ² and (s ₁ s ₂ s ₃)⁴ A ⁻¹ s ₁ ⁻² A, whereA=s ₂ s ₃ ⁻¹ s ₂ ^(p−1)/2 s ₄ s ₃ ² s ₄, all of them lying in the subgroupB ₅. Sp(n, p) acts on a vector space and the image of the subgroupB _n ofB _n+1 in Sp(n, p), denoted Sp(n−1,p), is a stabilizer of one vector. A sequence of inclusions …B _k+1·B _k … induces a sequence of inclusions …Sp(k,p)·Sp(k−1,p)…, which can be used to study some finite-valued invariants of knots and links in the 3-sphere via the Markov theorem. Partially supported by the Technion VPR-Fund.     

Extensions of the Erdös-Ko-Rado Theorem

An antichain of subsets of 1,2,...,n has the Erdös-Ko-Rado property if |A_i|?n/2 and A_i∩A_j≠Ø(i=j). This paper contains a number of results concerning the distribution of sizes of sets in such a family, and also in families where the restriction |A_i|?n/2 is removed.