Penultimate limiting forms in extreme value theory

Summary Let {X _n}_n≧1 be a sequence of independent, identically distributed random variables. If the distribution function (d.f.) ofM _n=max (X ₁,…,X _n), suitably normalized with attraction coefficients {α_n}_n≧1(α_n>0) and {b _n}_n≧1, converges to a non-degenerate d.f.G(x), asn→∞, it is of interest to study the rate of convergence to that limit law and if the convergence is slow, to find other d.f.'s which better approximate the d.f. of(M _n−b_n)/a_n thanG(x), for moderaten. We thus consider differences of the formF ⁿ(a_nx+b_n)−G(x), whereG(x) is a type I d.f. of largest values, i.e.,G(x)≡Λ(x)=exp (-exp(−x)), and show that for a broad class of d.f.'sF in the domain of attraction of Λ, there is a penultimate form of approximation which is a type II [Ф _α(x)=exp (−x^−α), x>0] or a type III [Ψ _α(x)= exp (−(−x)^α), x<0] d.f. of largest values, much closer toF ⁿ(a_nx+b_n) than the ultimate itself.     

Finite difference methods for two-point boundary value problems involving high order differential equations

We discuss the construction of finite difference schemes for the two-point nonlinear boundary value problem:y ⁽²ⁿ⁾+f(x,y)=0,y ^(2j)(a)=A _2j ,y ^(2j)(b)=B _2j ,j=0(1)n–1,n2. In the case of linear differential equations, these finite difference schemes lead to (2n+1)-diagonal linear systems. We consider in detail methods of orders two, four and six for two-point boundary value problems involving a fourth order differential equation; convergence of these methods is established and illustrated by numerical examples.     

The chromatic number of the product of two 4-chromatic graphs is 4

For any graphG and numbern≧1 two functionsf, g fromV(G) into {1, 2, ...,n} are adjacent if for all edges (a, b) ofG, f(a) ≠g(b). The graph of all such functions is the colouring graph ℒ(G) ofG. We establish first that χ(G)=n+1 implies χ(ℒ(G))=n iff χ(G ×H)=n+1 for all graphsH with χ(H)≧n+1. Then we will prove that indeed for all 4-chromatic graphsG χ(ℒ(G))=3 which establishes Hedetniemi’s [3] conjecture for 4-chromatic graphs. This research was supported by NSERC grant A7213     

Balanced Convex Partitions of Measures in ℝ2

 Let n≥2 be an integer and let μ₁ and μ₂ be measures in ℝ² such that each μ _i is absolutely continuous with respect to the Lebesgue measure and μ₁(ℝ²)=μ₂(ℝ²)=n. Let u≠0 be a vector on the plane. We show that if μ₁(B)=μ₂(B)=n for some bounded domain B, then there exist positive integers n ₁,n ₂ with n ₁+n ₂=n and disjoint open half-planes D ₁,D ₂ such that , μ₁(D ₁)=μ₂(D ₁)=n ₁ and μ₁(D ₂)=μ₂(D ₂)=n ₂; or there exist positive integers n ₁,n ₂,n ₃ with n ₁+n ₂+n ₃=n and disjoint open convex domains D ₁,D ₂,D ₃ such that , μ₁(D ₁)=μ₂(D ₁)=n ₁, μ₁(D ₂)= μ₂(D ₂)=n ₂, μ₁(D ₃)=μ₂(D ₃)=n ₃ and such that the ray is parallel to u. We also show a similar result for partitioning of point sets on the plane. Received: November 24, 1999 Final version received: February 9, 2001     

An asymptotic property of gap series. II

An upper bound estimate in the law of the iterated logarithm for Σf(n _k ω) where n_k+1∫n_k≧ 1 + ck ^-α (α≧0) is investigated. In the case α<1/2, an upper bound had been given by Takahashi [15], and the sharpness of the bound was proved in our previous paper [8]. In this paper it is proved that the upper bound is still valid in case α≧1/2 if some additional condition on {n _k} is assumed. As an application, the law of the iterated logarithm is proved when {n _k} is the arrangement in increasing order of the set B(τ)={₁ ⁱ ₁...q_τ ⁱ _τ|i₁,...,i_τ∈N ₀}, where τ≧ 2, N ₀=NU{0}, and q ₁,...,q _τ are integers greater than 1 and relatively prime to each others. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the divisor function of sets with even partition functions

Summary For P∈ F₂[z] with P(0)=1 and deg(P)≧ 1, let A =A(P) be the unique subset of N (cf. [9]) such that Σ_n≧0 p(A,n)zⁿ ≡ P(z) mod 2, where p(A,n) is the number of partitions of n with parts in A. To determine the elements of the set A, it is important to consider the sequence σ(A,n) = Σ _{d|n, d∈A} d, namely, the periodicity of the sequences (σ(A,2^kn) mod 2^k+1)_n≧1 for all k ≧ 0 which was proved in [3]. In this paper, the values of such sequences will be given in terms of orbits. Moreover, a formula to σ(A,2^kn) mod 2^k+1 will be established, from which it will be shown that the weight σ(A₁,2^kz_i) mod 2^k+1 on the orbit <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>z_i$ is moved on some other orbit z_j when A₁ is replaced by A₂ with A₁= A(P₁) and A₂= A(P₂) P₁ and P₂ being irreducible in F₂[z] of the same odd order.     

Counting points in hypercubes and convolution measure algebras

It is shown that ifA andB are non-empty subsets of {0, 1} ⁿ (for somenεN) then |A+B|≧(|A||B|)^α where α=(1/2) log₂ 3 here and in what follows. In particular if |A|=2 ^n-1 then |A+A|≧3 ^n-1 which anwers a question of Brown and Moran. It is also shown that if |A| = 2 ^n-1 then |A+A|=3 ^n-1 if and only if the points ofA lie on a hyperplane inn-dimensions. Necessary and sufficient conditions are also given for |A +B|=(|A||B|)^α. The above results imply the following improvement of a result of Talagrand [7]: ifX andY are compact subsets ofK (the Cantor set) withm(X),m(Y)>0 then λ(X+Y)≧2(m(X)m(Y))^α wherem is the usual measure onK and λ is Lebesgue measure. This also answers a question of Moran (in more precise terms) showing thatm is not concentrated on any proper Raikov system.     

Rado Numbers fora(x+y)=bz

In the case of existence the smallest numberN=Ra_kis called a Rado number if it is guaranteed that anyk-coloring of the numbers 1, 2, …, Ncontains a monochromatic solution of a given system of linear equations. We will determine Ra_k(a, b) for the equationa(x+y)=bzifb=2 andb=a+1. Also, the case of monochromatic sequences {x_n} generated bya(x_n+x_n+1)=bx_n+2 is discussed.     

Rigidity of commutators and elementary operators on Calkin algebras

LetA=(A ₁,...,A _n ),B=(B ₁,...,B _n )εL(ℓ ^p ) ⁿ be arbitraryn-tuples of bounded linear operators on (ℓ ^p ), with 1<p<∞. The paper establishes strong rigidity properties of the corresponding elementary operators ε _a,b on the Calkin algebraC(ℓ ^p )≡L(ℓ ^p )/K(ℓ ^p ); , where quotient elements are denoted bys=S+K(ℓ ^p ) forSεL(ℓ ^p ). It is shown among other results that the kernel Ker(ε _a,b ) is a non-separable subspace ofC(ℓ ^p ) whenever ε _a,b fails to be one-one, while the quotient is non-separable whenever ε _a,b fails to be onto. These results extend earlier ones in several directions: neither of the subsets {A ₁,...,A _n }, {B ₁,...,B _n } needs to consist of commuting operators, and the results apply to other spaces apart from Hilbert spaces. Supported by the Academy of Finland, Project 32837.     

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

Transversals of additive Latin squares

LetA={a ₁, …,a _k} andB={b ₁, …,b _k} be two subsets of an Abelian groupG, k≤|G|. Snevily conjectured that, whenG is of odd order, there is a permutationπ ∈S _ksuch that the sums α _i +b _i , 1≤i≤k, are pairwise different. Alon showed that the conjecture is true for groups of prime order, even whenA is a sequence ofk<|G| elements, i.e., by allowing repeated elements inA. In this last sense the result does not hold for other Abelian groups. With a new kind of application of the polynomial method in various finite and infinite fields we extend Alon’s result to the groups (ℤ _p ) ^a and in the casek<p, and verify Snevily’s conjecture for every cyclic group of odd order. Supported by Hungarian research grants OTKA F030822 and T029759. Supported by the Catalan Research Council under grant 1998SGR00119. Partially supported by the Hungarian Research Foundation (OTKA), grant no. T029132.     

The chromatic number of the product of two ℵ1-chromatic graphs can be countable

We prove (in ZFC) that for every infinite cardinal ϰ there are two graphsG ₀,G ₁ with χ(G ₀)=χ(G ₁)=ϰ⁺ and χ(G ₀×G ₁)=ϰ. We also prove a result from the other direction. If χ(G ₀)≧≧ℵ₀ and χ(G ₁)=k<ω, then χ(G ₀×G ₁)=k.     

On a problem of Cilleruelo and Nathanson

Let ℤ denote the set of all integers and ℕ the set of all positive integers. Let A be a set of integers. For every integer u, we denote by d _A (u) and s _A (u) the number of solutions of u=a − a′ with a,a′ ∈ A and u=a+a′ with a,a′ ∈ A and a≤a′, respectively.     

Subsequences of normal sequences

In this paper, we characterize a set of indices τ={τ(0)<τ(1)<…} such that forany normal sequence (α(0), α(1),…) of a certain type, the subsequence (α(τ(0)), α(τ(1)),…) is a normal sequence of the same type. Assume that_n→∞. Then, we prove that τ has this property if and only if the 0–1 sequence (θ _τ (0), whereθ _τ (i)=1 or 0 according asi∈{τ(j);j=0, 1,…} or not, iscompletely deterministic in the sense of B. Weiss.     

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.     

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

两类惯量惟一的对称符号模式

§ 1　 IntroductionA sign pattern(matrix) A is a matrix whose entries are from the set{ +,-,0 } .De-note the setofall n× n sign patterns by Qn.Associated with each A=(aij)∈ Qnis a class ofreal matrices,called the qualitative class of A,defined byQ(A) ={ B =(bij)∈ Mn(R) |sign(bij) =aijfor all i and j} .　　 For a symmetric sign pattern A∈ Qn,by G(A) we mean the undirected graph of A,with vertex set { 1 ,...,n} and (i,j) is an edge if and only if aij≠ 0 .A sign pattern A∈ Qnis a do…     

New Findings on the Bank–Sauer Approach in Oscillation Theory

In 1988, S. Bank showed that if {z _n } is a sparse sequence in the complex plane, with convergence exponent zero, then there exists a transcendental entire A(z) of order zero such that f″+A(z)f=0 possesses a solution having {z _n } as its zeros. Further, Bank constructed an example of a zero sequence {z _n } violating the sparseness condition, in which case the corresponding coefficient A(z) is of infinite order. In 1997, A. Sauer introduced a condition for the density of the points in the zero sequence {z _n } of finite convergence exponent such that the corresponding coefficient A(z) is of finite order.     

Triangle-free distance-regular graphs

Let Γ denote a distance-regular graph with diameter d≥3. By a parallelogram of length 3, we mean a 4-tuple xyzw consisting of vertices of Γ such that ∂(x,y)=∂(z,w)=1, ∂(x,z)=3, and ∂(x,w)=∂(y,w)=∂(y,z)=2, where ∂ denotes the path-length distance function. Assume that Γ has intersection numbers a ₁=0 and a ₂≠0. We prove that the following (i) and (ii) are equivalent. (i) Γ is Q-polynomial and contains no parallelograms of length 3; (ii) Γ has classical parameters (d,b,α,β) with b<−1. Furthermore, suppose that (i) and (ii) hold. We show that each of b(b+1)²(b+2)/c ₂, (b−2)(b−1)b(b+1)/(2+2b−c ₂) is an integer and that c ₂≤b(b+1). This upper bound for c ₂ is optimal, since the Hermitian forms graph Her₂(d) is a triangle-free distance-regular graph that satisfies c ₂=b(b+1). Work partially supported by the National Science Council of Taiwan, R.O.C.     

Largeness of the set of finite products in a semigroup

We investigate when the set of finite products of distinct terms of a sequence 〈x _n 〉 _n=1^∞ in a semigroup (S,⋅) is large in any of several standard notions of largeness. These include piecewise syndetic, central, syndetic, central*, and IP*. In the case of a “nice” sequence in (S,⋅)=(ℕ,+) one has that FS(〈x _n 〉 _n=1^∞) has any or all of the first three properties if and only if {x _n+1−∑ _t=1 ⁿ x _t :n∈ℕ} is bounded from above. N. Hindman acknowledges support received from the National Science Foundation via Grant DMS-0554803.