The Rank of a Direct Power of a Small-Cancellation Group

We construct an example of a finitely generated group G such that rank((G )ⁿ)=2 for all n1. For each n, we construct a finitely presented group G _n such that rank((G _n )ⁿ)=2. We conjecture that if G is a word-hyperbolic group then rank(G ⁿ ) as $ n. For each m we give an example of a residually finite group K _m such that K _m has exactly two relators, but K _m has no proper subgroups of index $ m. We construct a finitely generated group D such that there is an epimorphism DD×D.     

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg then the state complexity of is equal to the Wolf bound. For deg , we use Clifford's theorem to give a simple lower bound on the state complexity of . We then derive two further lower bounds on the state space dimensions of in terms of the gonality sequence of . (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.     

Computing Complex Airy Functions by Numerical Quadrature

Integral representations are considered of solutions of the Airy differential equation w –zw=0 for computing Airy functions for complex values of z. In a first method contour integral representations of the Airy functions are written as non-oscillating integrals for obtaining stable representations, which are evaluated by the trapezoidal rule. In a second method an integral representation is evaluated by using generalized Gauss–Laguerre quadrature; this approach provides a fast method for computing Airy functions to a predetermined accuracy. Comparisons are made with well-known algorithms of Amos, designed for computing Bessel functions of complex argument. Several discrepancies with Amos' code are detected, and it is pointed out for which regions of the complex plane Amos' code is less accurate than the quadrature algorithms. Hints are given in order to build reliable software for complex Airy functions.     

A combination of potential reduction steps and steepest descent steps for solving convex programming problems

This paper studies the possibility of combining interior point strategy with a steepest descent method when solving convex programming problems, in such a way that the convergence property of the interior point method remains valid but many iterations do not request the solution of a system of equations. Motivated by this general idea, we propose a hybrid algorithm which combines a primal–dual potential reduction algorithm with the use of the steepest descent direction of the potential function. The complexity of the potential reduction algorithm remains valid but the overall computational cost can be reduced. Our numerical experiments are also reported. Copyright © 2002 John Wiley & Sons, Ltd.     

Hindman spaces

A topological space is Hindman if for every sequence in there exists an infinite so that the sequence , indexed by all finite sums over , is IP-converging in . Not all sequentially compact spaces are Hindman. The product of two Hindman spaces is Hindman.

Furstenberg and Weiss proved that all compact metric spaces are Hindman. We show that every Hausdorff space that satisfies the following condition is Hindman:

Consequently, there exist nonmetrizable and noncompact Hindman spaces. The following is a particular consequence of the main result: every bounded sequence of monotone (not necessarily continuous) real functions on has an IP-converging subsequences.

     

-coincidences for maps of homotopy spheres into CW-complexes

Let be a finite group acting freely in a CW-complex which is a homotopy -dimensional sphere and let be a map of to a finite -dimensional CW-complex . We show that if , then has an -coincidence for some nontrivial subgroup of .

     

Algebraic structure in the loop space homology Bockstein spectral sequence

Let be a finite, -dimensional, -connected CW complex. We prove the following theorem:

If is an odd prime, then the loop space homology Bockstein spectral sequence modulo is a spectral sequence of universal enveloping algebras over differential graded Lie algebras.

     

Remarks on Mean Convergence (Boundedness) of Partial Sums of Trigonometric Series

Fairly general conditions on the coefficients of even and odd trigonometric Fourier series under which L-convergence (boundedness) of partial sums of the series is equivalent to the relation are given.     

On linearly Lindelöf and strongly discretely Lindelöf spaces

We prove that the cardinality of every first countable linearly Lindelöf Tychonoff space does not exceed , and every strongly discretely Lindelöf Tychonoff space of countable tightness is Lindelöf.

     

On the distribution of the length of the longest increasing subsequence of random permutations

The authors consider the length, , of the longest increasing subsequence of a random permutation of numbers. The main result in this paper is a proof that the distribution function for , suitably centered and scaled, converges to the Tracy-Widom distribution of the largest eigenvalue of a random GUE matrix. The authors also prove convergence of moments. The proof is based on the steepest descent method for Riemann-Hilbert problems, introduced by Deift and Zhou in 1993 in the context of integrable systems. The applicability of the Riemann-Hilbert technique depends, in turn, on the determinantal formula of Gessel for the Poissonization of the distribution function of .