Singular integrals associated to the Laplacian on the affine groupax+b

We consider singular integral operators of the form (a)Z ₁L⁻¹Z₂, (b)Z ₁Z₂L⁻¹, and (c)L ⁻¹Z₁Z₂, whereZ ₁ andZ ₂ are nonzero right-invariant vector fields, andL is theL ²-closure of a canonical Laplacian. The operators (a) are shown to be bounded onL ^p for allp∈(1, ∞) and of weak type (1, 1), whereas all of the operators in (b) and (c) are not of weak type (p, p) for anyp∈[1, ∞). Research supported by the Australian Research Council. Research carried out as a National Research Fellow.     

On Intersection Problem for Perfect Binary Codes

The main result is that to any even integer q in the interval 0 ≤ q ≤ 2^{n+1-2log(n+1)}, there are two perfect codes C₁ and C₂ of length n = 2^m − 1, m ≥ 4, such that |C₁ ∩ C₂| = q.     

Minimal full polarized embeddings of dual polar spaces

Let Δ be a thick dual polar space of rank n ≥ 2 admitting a full polarized embedding e in a finite-dimensional projective space Σ, i.e., for every point x of Δ, e maps the set of points of Δ at non-maximal distance from x into a hyperplane e∗(x) of Σ. Using a result of Kasikova and Shult [11], we are able the show that there exists up to isomorphisms a unique full polarized embedding of Δ of minimal dimension. We also show that e∗ realizes a full polarized embedding of Δ into a subspace of the dual of Σ, and that e∗ is isomorphic to the minimal full polarized embedding of Δ. In the final section, we will determine the minimal full polarized embeddings of the finite dual polar spaces DQ(2n,q), DQ ⁻(2n+1,q), DH(2n−1,q ²) and DW(2n−1,q) (q odd), but the latter only for n≤ 5. We shall prove that the minimal full polarized embeddings of DQ(2n,q), DQ ⁻(2n+1,q) and DH(2n−1,q ²) are the `natural' ones, whereas this is not always the case for DW(2n−1, q).B. De Bruyn: Postdoctoral Fellow of the Research Foundation - Flanders.     

On the Minimum Length of some Linear Codes of Dimension 5

In this paper, we shall prove that the minimum length n_q(5,d) is equal to g_q(5,d) +1 for q⁴−2q²−2q+1≤ d≤ q⁴ − 2q² − q and 2q⁴ − 2q³ − q² − 2q+1 ≤ d ≤ 2q⁴−2q³−q²−q, where g_q(5,d) means the Griesmer bound . Communicated by: J.D. Key     

The braid group B4 is linear

We study a linear representation ρ:B _n ? GL _m (Z[q ^±1,t ^±1]) with m=n(n-1)/2. We will show that for n=4, this representation is faithful. We prove a relation with the new Charney length function. We formulate a conjecture implying that ρ is faithful for all n. Oblatum 15-VI-1999 & 24-II-2000?Published online: 18 September 2000     

Large centralizers in finite solvable groups

In 1955 R. Brauer and K. A. Fowler showed that ifG is a group of even order >2, and the order |Z(G)| of the center ofG is odd, then there exists a strongly real) elementx∈G−Z whose centralizer satisfies|C _G(x)|>|G|^1/3. In Theorem 1 we show that every non-abeliansolvable groupG contains an elementx∈G−Z such that|C _G(x)|>[G:G′∩Z]^1/2 (and thus|C _G(x)|>|G|^1/3). We also note that if non-abelianG is either metabelian, nilpotent or (more generally) supersolvable, or anA-group, or any Frobenius group, then|C _G(x)|>|G|^1/2 for somex∈G−Z. In Theorem 2 we prove that every non-abelian groupG of orderp ^mqⁿ (p, q primes) contains a proper centralizer of order >|G|^1/2. Finally, in Theorem 3 we show that theaverage |C(x)|, x∈G, is ≧c|G| ^1/3 for metabelian groups, wherec is constant and the exponent 1/3 is best possible.     

Farrell cohomology of GL(n,Z)

The Tate-Farrell cohomology of GL(n,Z) with coefficients inZ/p is computed forp an odd prime andp−1 ≦n ≦ 2p−3. Its size depends on the Galois structure of the class group of the cyclotomic fieldQ(p√1) and is shown to be quite large in general. Research partially supported by NSF Grant No. DMS-8701758.     

On some 2-adic properties of a recurrence involving stirling numbers

We analyze some 2-adic properties of the sequence defined by the recurrence Z(1) = 1; Z(n) = Σ _k=1 ⁿ⁻¹ S(n, k)Z(k), n ≥ 2, which counts the number of ultradissimilarity relations, i.e., ultrametrics on an n-set. We prove the 2-adic growth property ν ₂(Z(n)) ≥ ⌈log₂ n⌉ −1 and present conjectures on the exact values.     

Distribution of a certain partition function modulo powers of primes

In this paper, we study a certain partition function a(n) defined by Σ _n≥0 a(n)q ⁿ := Π _n=1(1 − q ⁿ )⁻¹(1 − q ²ⁿ )⁻¹. We prove that given a positive integer j ≥ 1 and a prime m ≥ 5, there are infinitely many congruences of the type a(An + B) ≡ 0 (mod m ^j ). This work is inspired by Ono’s ground breaking result in the study of the distribution of the partition function p(n).     

On the commutant of certain multiplication operators on spaces of analytic functions

Let ℬ be a Banach space of analytic functions defined on the open unit disk. We characterize the commutant ofM _Z ² (the operator of multiplication by the square of independent variable defined on ℬ) and show that for an operatorS in the commutantM _Z ² ifSM _Z ^2k+1−M _Z ^2k+1 S is compact for some nonnegative integerk, thenS=M _ϕ whereϕ is a multiplier of ℬ. Letn be a positive integer andS be an operator in the commutant ofM _Z ⁿ defined on a functional Hilbert spaces of analytic functions. We show that under certain conditionsS has the formM _ϕ. Research supported by the Shiraz University Grant 78-SC-1188-657.     

A class of optimal linear codes of length one above the Griesmer bound

In this paper, we determine the smallest lengths of linear codes with some minimum distances. We construct a [g _q (k, d) + 1, k, d] _q code for sq ^k-1 − sq ^k-2 − q ^s  − q ² + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s with 3 ≤ s ≤ k − 2 and q ≥ s + 1. Then we get n _q (k, d) = g _q (k, d) + 1 for (k − 2)q ^k-1 − (k − 1)q ^k-2 − q ² + 1 ≤ d ≤ (k − 2)q ^k-1 − (k − 1)q ^k-2, k ≥ 6, q ≥ 2k − 3; and sq ^k-1 − sq ^k-2 − q ^s  − q + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s , s ≥ 2, k ≥ 2s + 1 and q ≥ 2s − 1. This work was partially supported by the Com²MaC-SRC/ERC program of MOST/KOSEF (grant ^# R11-1999-054) and was partially supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)(KRF-2005-214-C00175).     

A family of counterexamples in ergodic theory

LetT _α be the translationx↦x+α (mod 1) of [0, 1), α irrational. LetT be the Lebesgue measure-preserving automorphism ofX=[0, 3/2) defined byTx = x + 1 forx∈[0, 1/2),Tx=T _α(x−1) forx∈[1,3/2) andTx = T _α x forx∈[1/2, 1), i.e.T isT _α with a tower of height one built over [0, 1/2). If α is poorly approximable by rationals (there does not exist {p _n /q _n } with |α−p _n /q _n |=o(q _n ⁻²)) and λ is a measure onX ^k all of whose one-dimensional marginals are Lebesgue and which is ⊗ _{i − 1} ^k T ¹ invariant and ergodic (l>0) then λ is a product of off-diagonal measures. This property suffices for many purposes of counterexample construction. A connection is established with the POD (proximal orbit dense) condition in topological dynamics. Research supported in part by NSF contract MCS-8003038.     

Asymptotic formulas for the enumerator of trees with a given number of hanging or internal vertices

Let t(r, n) be the number of trees with n vertices of which r are hanging and q are internal (r=n−9). For a fixed r or q we prove the validity of the asymptotic formulas (r > 2)t(r, n)≈t/r|(r−2)| 2^2−r n ^2r−4 (n→∞)t(n−q, n)≈1/q|(q−1)|q ^q−2 n ^q−1 (n→∞) In the derivation of these formulas we do not use the expression for the enumerator of the trees with respect to the number of hanging vertices. Translated from Matematicheskie Zametki, Vol. 21, No. 1, pp. 65–70, January, 1977.     

On Point-Cyclic Resolutions of the 2-(63,7,15) Design Associated with PG(5,2)

 A t(v,k,λ) design is a set of v points together with a collection of its k-subsets called blocks so that t points are contained in exactly λ blocks. PG(n,q), the n-dimensional projective geometry over GF(q) is a 2(q ⁿ +q ⁿ⁻¹ +⋯+q+1,q ²+q+1, q ⁿ⁻² + q ⁿ⁻³ +⋯+q+1) design when we take its points as the points of the design and its planes as the blocks of the design. A 2(v,k,λ) design is said to be resolvable if the blocks can be partitioned as ℱ={R ₁,R ₂,…,R _s }, where s=λ(v−1)/(k−1) and each R _i consists of v/k disjoint blocks. If a resolvable design has an automorphism σ which acts as a cycle of length v on the points and ℱ^σ=ℱ, then the design is said to be point-cyclically resolvable. The design consisting of points and planes of PG(5,2) is shown to be point-cyclically resolvable by enumerating all inequivalent resolutions which are invariant under a cyclic automorphism group G=〈σ〉 where σ is a cycle of length v. These resolutions are shown to be the only resolutions which admit point-transitive automorphism group. Received: November 10, 1999 Final version received: September 18, 2000 Acknowledgments. The author would like to thank A. Munemasa for his assistance in writing computer programs on constructing projective spaces and searching for partial spreads. Moreover, she's thankful to T. Hishida and M.␣Jimbo for helpful discussions and for verifying the results of this paper. Present address: Mathematics Department, Ateneo de Manila University, Loyola Heights, Quezon City 1108, Philippines. e-mail: jumela@mathsci.math.admu.edu.ph     

On nonsystematic perfect codes over finite fields

The nonsystematic perfect q-ary codes over finite field F _q of length n = (q ^m − 1)/(q − 1) are constructed in the case when m ≥ 4 and q ≥ 2 and also when m = 3 and q is not prime. For q ≠ 3, 5, these codes can be constructed by switching seven disjoint components of the Hamming code H _q ⁿ ; and, for q = 3, 5, eight disjoint components.     

On a Delay Reaction-Diffusion Difference Equation of Neutral Type

In this paper, we first consider a delay difference equation of neutral type of the form: Δ(y _n + py _n−k + q _n y _n−l = 0 for n∈ℤ⁺(0) (1*) and give a different condition from that of Yu and Wang (Funkcial Ekvac, 1994, 37(2): 241–248) to guarantee that every non-oscillatory solution of (1*) with p = 1 tends to zero as n→∞. Moreover, we consider a delay reaction-diffusion difference equation of neutral type of the form: Δ₁(u _n,m + pu _n−k,m ) + q _n,m u _n−l,m = a ²Δ² ₂ u _{n +1, m−1} for (n,m) ∈ℤ⁺ (0) ×Ω, (2*) study various cases of p in the neutral term and obtain that if p≥−1 then every non-oscillatory solution of (2*) tends uniformly in m∈Ω to zero as n→∞; if p = −1 then every solution of (2*) oscillates and if p < −1 then every non-oscillatory solution of (2*) goes uniformly in m∈Ω to infinity or minus infinity as n→∞ under some hypotheses. Received July 14, 1999, Revised August 10, 2000, Accepted September 30, 2000     

Remez-type inequality for discrete sets

The classical Remez inequality bounds the maximum of the absolute value of a polynomial P(x) of degree d on [−1, 1] through the maximum of its absolute value on any subset Z of positive measure in [−1, 1]. Similarly, in several variables the maximum of the absolute value of a polynomial P(x) of degree d on the unit cube Q ₁ ⁿ ⊂ ℝ ⁿ can be bounded through the maximum of its absolute value on any subset Z ⊂ Q ₁ ⁿ of positive n-measure. The main result of this paper is that the n-measure in the Remez inequality can be replaced by a certain geometric invariant ω _d (Z) which can be effectively estimated in terms of the metric entropy of Z and which may be nonzero for discrete and even finite sets Z.     

Isometric approximation

Suppose thatA ⊂R ⁿ is a bounded set of diameter 1 and that:f:A →l ₂ is a map satisfying the nearisometry condition |x−y|−ɛ≤|fx−fy|≤|x−y|+ɛ withɛ≤1. Then there is an isometryS:A →l ₂ such that |Sx−fx|≤c _n √ɛ for allx inA. IfA satisfies a thickness condition and iff:A →R ⁿ , then there is an isometryS:R ⁿ →R ⁿ with |Sx−fx|≤c _nɛ/q, whereq is a thickness parameter.     

On the ratio of the expected maximum of a martingale and theL p-norm of its last term

For eachp>1, the supremum,S, of the absolute value of a martingale terminating at a random variableX inL _p, satisfiesES≦(Γ(q))^1/q‖X‖_p (q=p(p-1)^-1).The maximum,M, of a mean-zero martingale which starts at zero and terminates atX, satisfiesES≦(Γ(q))^1/q‖X‖_p (q=p(p-1)^-1), whereσ _q is the unique solution of the equationt = ‖Z −t ‖ _q for an exponentially distributed random variableZ with mean 1.σ _p has other characterizations and satisfies lim _p‖ q ^{− 1} σ _q =c withc determined byce ^c+1 = 1. Equalities in (1) and (2) are attainable by appropriate martingales which can be realized as stopped segments of Brownian motion. A presumably new property of the exponential distribution is obtained en route to inequality (2).     

CONVERGENCE RATE FOR ITERATES OF q-BERNSTEIN POLYNOMIALS

Recently, q-Bernstein polynomials have been intensively investigated by a number of authors. Their results show that for q ≠ 1, q-Bernstein polynomials possess of many interesting properties. In this paper, the convergence rate for iterates of both q-Bernstein polynomials and their Boolean sum are estimated. Moreover, the saturation of {Bn（., qn）} when n → ∞ and convergence rate of Bn（f,q;x） when f ∈ C^n-1 [0, 1], q → ∞ are also presented.