Small maximal pro-p Galois groups

For an odd primep we classify the pro-p groups of rank ≤4 which are realizable as the maximal pro-p Galois group of a field containing a primitive root of unity of orderp.     

Pro-p Galois groups of rank ≤ 4

Let p be a prime > 2, let F be a field of characteristic ≠p containing a primitive p-th root of unity and let G _F (p) be the Galois group of the maximal Galois-p-extension of F. If rk G _F (p)≤ 4 then G _F (p) is a free pro-p product of metabelian groups or G _F (p) is a Demuškin group of rank 4. Received: 3 September 1997 / Revised version: 3 October 1997     

Tame Galois p-extensions of p-henselian fields

A valued field K is called p-henselian, if its valuation extends uniquely to the maximal Galois p-extension K(p) of K. In this paper we determine the structure of Gal(K(p)/K) in case the residue characteristic is different from p. We do not assume that K contains a p-th root of unity. Received: 3 February 1999     

On maximal curves in characteristic two

The genus g of an q-maximal curve satisfies g=g ₁≔q(q−1)/2 or . Previously, q-maximal curves with g=g ₁ or g=g ₂, q odd, have been characterized up to q-isomorphism. Here it is shown that an q-maximal curve with genus g ₂, q even, is q-isomorphic to the non-singular model of the plane curve ∑ _{i =1}} ^t y ^{q /2 i} =x ^{q +1}, q=2 ^t , provided that q/2 is a Weierstrass non-gap at some point of the curve. Received: 3 December 1998     

The generic fiber of the universal deformation space associated to a tame Galois representation

We will study the generic fiber over of the universal deformation ring R _Q , as defined by Mazur, for deformations unramified outside a finite set of primes Q of a given Galois representation , E a number field, k a finite field of characteristic l. The main result will be that, if ˉρ is tame and absolutely irreducible, and if one assumes the Leopoldt conjecture for the splitting field E ₀ of , then defines a smooth l-adic analytic variety, near the trivial lift ρ₀ of ˉρ, whose dimension is given by cohomological constraints and as predicted by Mazur. As a corollary it follows that, in the cases considered here, R _Q is a quotient of by an ideal I generated by exactly m equations, where and . Under the above assumptions for and ˉρ odd, using ideas of Coleman, Gouvêa and Mazur it should now be possible to show that modular points are Zariski-dense in the component of , that contains the trivial lift ρ₀, provided this lift satisfies the Artin conjecture and E ₀ satisfies the Leopoldt conjecture. Furthermore, in the Borel case, we show that the Krull dimension of R _Q can exceed any given number, provided Q is chosen appropriately. At the same time, we present some evidence that despite this fact, one might however expect that the dimension of the generic fiber is given by the same cohomological formula as in the tame case. Received: 12 December 1997 / Revised version: 5 February 1998     

Local constancy in families of non-abelian Galois representations

If is a a scheme of finite type over a local field F, and is a proper smooth family, then to each rational point one can assign an extension of the absolute Galois group of F by the geometric fundamental group G of the fibre . If F has uniformiser , and residue characteristic p, we show that the corresponding extension of the absolute Galois group of by the maximal prime to p quotient of G is locally constant in the -adic topology of . We give a similar result in the case of non-proper families, and families over -adic analytic spaces. Received August 14, 1998     

Algebraic varieties on which the classical Phragmén-Lindelöf estimates hold for plurisubharmonic functions

Algebraic varieties V are investigated on which the natural analogue of the classical Phragmén-Lindel?f principle for plurisubharmonic functions holds. For a homogeneous polynomial P in three variables it is shown that its graph has this property if and only if P has real coefficients, no elliptic factors, is locally hyperbolic in all real characteristics, and the localizations in these characteristics are square-free. The last condition is shown to be necessary in any dimension. Received July 23, 1998     

Multiplicities of mod p Galois representations

We study the multiplicity with which 2-dimensional mod p Galois representations occur in Jacobians of modular curves. Received: 26 February 1997 / Revised version: 2 July 1997     

Normal limit theorems for symmetric random matrices

Using the machinery of zonal polynomials, we examine the limiting behavior of random symmetric matrices invariant under conjugation by orthogonal matrices as the dimension tends to infinity. In particular, we give sufficient conditions for the distribution of a fixed submatrix to tend to a normal distribution. We also consider the problem of when the sequence of partial sums of the diagonal elements tends to a Brownian motion. Using these results, we show that if O _n is a uniform random n×n orthogonal matrix, then for any fixed k>0, the sequence of partial sums of the diagonal of O ^k _n tends to a Brownian motion as n→∞. Received: 3 February 1998 / Revised version: 11 June 1998     

Un théorème central limite presque sûr à moments généralisés pour les rotations irrationnelles

In a recent work, we indicated another formulation of the Almost Sure Central Limit Theorem (A.S.C.L.T.), with series in place of averages, by showing that the property of the A.S.C.L.T. directly follows from the theory of orthogonal sums. For, we used the notion of quasi-orthogonal systems introduced earlier by R. Bellmann, and later developed by Kac–Salem–Zygmund. The main object of this paper is to prove a similar result for irrational rotations of the torus. We prove the existence of a generalized moment version of the A.S.C.L.T., with a speed of convergence. In our strategy, we use again the notion of quasi-orthogonal system, and purpose a Gaussian randomization technic, new at least in this context. The proof avoid notably the use of Volny's result on the existence of good Gaussian approximations in aperiodic dynamical systems, and should also permit to be able to treat problems of comparable nature, in particular in non-ergodic cases. Received: 2 February 1999     

Fast verification of solutions of matrix equations

Summary. In this paper, we are concerned with a matrix equation where A is an real matrix and x and b are n-vectors. Assume that an approximate solution is given together with an approximate LU decomposition. We will present fast algorithms for proving nonsingularity of A and for calculating rigorous error bounds for . The emphasis is on rigour of the bounds. The purpose of this paper is to propose different algorithms, the fastest with flops computational cost for the verification step, the same as for the LU decomposition. The presented algorithms exclusively use library routines for LU decomposition and for all other matrix and vector operations. Received June 16, 1999 / Revised version received January 25, 2001 / Published online June 20, 2001     

Pivoting strategies leading to diagonal dominance by rows

Pivoting strategies for Gaussian elimination leading to upper triangular matrices which are diagonally dominant by rows are studied. Forward error analysis of triangular systems whose coefficient matrices are diagonally dominant by rows is performed. We also obtain small bounds of the backward errors for the pivoting strategies mentioned above. Our examples of matrices include H-matrices and some generalizations of diagonally dominant matrices, and scaled partial pivoting for the 1-norm is an example of these pivoting strategies. In the case of an M-matrix, a pivoting strategy of computational complexity is proposed, which satisfies all the results of the paper. Received June 6, 1997 / Revised version received October 27, 1997     

Large deviations for increasing sequences on the plane

We prove a large deviation principle with explicit rate functions for the length of the longest increasing sequence among Poisson points on the plane. The rate function for lower tail deviations is derived from a 1977 result of Logan and Shepp about Young diagrams of random permutations. For the upper tail we use a coupling with Hammersley's particle process and convex-analytic techniques. Along the way we obtain the rate function for the lower tail of a tagged particle in a totally asymmetric Hammersley's process. Received: 22 July 1997 / Revised version: 23 March 1998     

Reliable parallel solution of bidiagonal systems

Summary. This paper presents a new efficient algorithm for solving bidiagonal systems of linear equations on massively parallel machines. We use a divide and conquer approach to compute a representative subset of the solution components after which we solve the complete system in parallel with no communication overhead. We address the numerical properties of the algorithm in two ways: we show how to verify the à posteriori backward stability at virtually no additional cost, and prove that the algorithm is à priori forward stable. We then show how we can use the algorithm in order to bound the possible perturbations in the solution components. Received March 13, 1998 / Revised version received December 21, 1999 / Published online June 20, 2001     

Relative-error bounds for the LU decomposition via the GTH algorithm

Summary. Recently the author showed that the Grassmann-Taksar-Heyman (GTH) algorithm computes the steady-state distribution of a finite-state Markov chain with low relative error. Here it is shown that the LU decomposition computed in the course of the GTH algorithm also has low relative error. The proof requires a refinement of the methods used in the earlier paper. Received September 2, 1994 / Revised version received July 17, 1995     

Symmetric Gaussian elimination for cauchy-type matrices with application to positive definite Toeplitz matrices

The problem of solving linear equations with a Toeplitz matrix appears in many applications. Often is positive definite but ill-conditioned with many small eigenvalues. In this case fast and superfast algorithms may show a very poor behavior or even break down. In recent papers the transformation of a Toeplitz matrix into a Cauchy-type matrix is proposed. The resulting new linear equations can be solved in operations using standard pivoting strategies which leads to very stable fast methods also for ill-conditioned systems. The basic tool is the formulation of Gaussian elimination for matrices with low displacement rank. In this paper, we will transform a Hermitian Toeplitz matrix into a Cauchy-type matrix by applying the Fourier transform. We will prove some useful properties of and formulate a symmetric Gaussian elimination algorithm for positive definite . Using the symmetry and persymmetry of we can reduce the total costs of this algorithm compared with unsymmetric Gaussian elimination. For complex Hermitian , the complexity of the new algorithm is then nearly the same as for the Schur algorithm. Furthermore, it is possible to include some strategies for ill-conditioned positive definite matrices that are well-known in optimization. Numerical examples show that this new algorithm is fast and reliable. Received March 24, 1995 / Revised version received December 13, 1995