Affine modifications and affine hypersurfaces with a very transitive automorphism group

We study the modificationAA of an affine domainA which produces another affine domainA=A[I/f] whereI is a nontrivial ideal ofA andf is a nonzero element ofI. First appeared in passing in the basic paper of O. Zariski [Zar], it was further considered by E. D. Davis [Da]. In [Ka1] its geometric counterpart was applied to construct contractible smooth affine varieties non-isomorphic to Euclidean spaces. Here we provide certain conditions (more general than those in [Ka1]) which guarantee preservation of the topology under a modification.As an application, we show that the group of biregular automorphisms of the affine hypersurfaceXC ^k+2, given by the equationuv=(p(x ₁,...,x_k) wherepC[x ₁,...,x _k ],k2, actsm-transitively on the smooth part regX ofX for anymN. We present examples of such hypersurfaces diffeomorphic to Euclidean spaces.Partially supported by the NSA grant MDA904-96-01-0012.     

Lacunary Interpolation by Antiperiodic Trigonometric Polynomials

The problem of lacunary trigonometric interpolation is investigated. Does a trigonometric polynomial T exist which satisfies T(x _k) = a _k, D ^m T(x _k) = b _k, 0 k n – 1, where x _k = k/n is a nodal set, a _k and b _k are prescribed complex numbers, and m N. Results obtained by several authors for the periodic case are extended to the antiperiodic case. In particular solvability is established when n as well as m are even. In this case a periodic solution does not exist.     

On the extreme spectral properties of Toeplitz matrices generated byL 1 functions with several minima/maxima

In this paper we are concerned with the asymptotic behavior of the smallest eigenvalue ₁ ⁽ⁿ⁾ of symmetric (Hermitian)n ×n Toeplitz matricesT _n (f) generated by an integrable functionf defined in [–, ]. In [7, 8, 11] it is shown that ₁ ⁽ⁿ⁾ tends to essinff =m _f in the following way: ₁ ⁽ⁿ⁾ –m _f 1/n ^2k . These authors use three assumptions:A1)f –m _f has a zero inx =x ₀ of order 2k.A2)f is continuous and at leastC ^2k in a neighborhood ofx ₀.A3)x =x ₀ is the unique global minimum off in [–, ]. In [10] we have proved that the hypothesis of smoothnessA2 is not necessary and that the same result holds under the weaker assumption thatf L ¹[–, ]. In this paper we further extend this theory to the case of a functionf L ¹[–, ] having several global minima by suppressing the hypothesisA3 and by showing that the maximal order 2k of the zeros off –m _f is the only parameter which characterizes the rate of convergence of ₁ ⁽ⁿ⁾ tom _f .     

Characterizations of Buchsbaum complexes

Letk be a field and an abstract simplicial complex with vertex set . In this article we study the structure of the Ext modules Ext _a ⁱ (A/m _(l ,k[]) of the Stanley-Reisner ringk[] whereA=k[x ₁,...,x _n ] andm _l =(x _l ¹ ,...,x _l ⁿ ). Using this structure theorem we give a characterization of Buchsbaumness ofk[] by means of the length of the modules Ext _A ⁱ (A/m _l ,k[]). That isk[] is Buchsbaum if and only if for allik[], the length of the modules Ext _A ⁱ (A/m _l ,k[]) is independent ofl.     

On the Embedding of an Affine Space into a Projective Space

Let k, K be fields, and assume that |k| 4 and n, m 2, or |k| = 3 and n 3, m 2. Then, for any embedding of AG(n, k) into PG(m, K), there exists an isomorphism from k into K and an (n+1) × (m+1) matrix B with entries in K such that can be expressed as (x₁,x₂,...,x_n) = [(1,x₁ ,x₂ ,...,x_n )B], where the right-hand side is the equivalence class of (1,x₁ ,x₂ ,...,x_n )B. Moreover, in this expression, is uniquely determined, and B is uniquely determined up to a multiplication of element of K*. Let l 1, and suppose that there exists an embedding of AG(m+l, k) into PG(m, K) which has the above expression. If we put r = dim _k K, then we have r 3 and m > 2 l-1)/(r-2). Conversely, there exists an embedding of AG(l+m, k) into PG(m, K) with the above expression if K is a cyclic extension of k with dim _k K=r 3, and if m 2l/(r-2) with m even or if m 2l/(r-2) +1 with m odd.     

Extended iterative methods for the solution of operator equations

Summary Given an iterative methodM ₀, characterized byx ^(k+1=G ₀(x( ^k )) (k0) (x(⁰) prescribed) for the solution of the operator equationF(x)=0, whereF:XX is a given operator andX is a Banach space, it is shown how to obtain a family of methodsM _p characterized byx ^(k+1=G _p (x( ^k )) (k0) (x(⁰) prescribed) with order of convergence higher than that ofM _o. The infinite dimensional multipoint methods of Bosarge and Falb [2] are a special case, in whichM ₀ is Newton's method.Analogues of Theorems 2.3 and 2.36 of [2] are proved for the methodsM _p, which are referred to as extensions ofM ₀. A number of methods with order of convergence greater than two are discussed and existence-convergence theorems for some of them are proved.Finally some computational results are presented which illustrate the behaviour of the methods and their extensions when used to solve systems of nonlinear algebraic equations, and some applications currently being investigated are mentioned.     

Iterative hyperidentities for theA n,m varieties of semigroups

Iterative hyperidentities are hyperidentities of the special formF ^a (x ₁,...,x _k =F ^a+b (x ₁,...,x _k ). This type of hyperidentity has been considered by Denecke and Pöschel, and by Schweigert. Here we consider iterative hyperidentities for the variety A_n,m of commutative semigroups satisfyingx ⁿ =x ^n+m ,n,m 1. We introduce two parameters(m, n) and(m) associated withn andm, and show thatA _nn,m satisfies the iterative hyperidentitiesF (x ₁,...,x _k =F ^+b (x ₁,...,x _k ) for every arityk. Moreover, the numbers and are minimal, making these hyperidentities irreducible in the sense of Schweigert. We also show how these hyperidentities for A_n,m may be used to prove that no non-trivial proper variety of commutative semigroups can have a finite hyperidentity basis.Presented by W. Taylor.Research supported by NSERC of Canada     

Quadratically constrained least squares and quadratic problems

Summary We consider the following problem: Compute a vectorx such that Ax–b₂=min, subject to the constraint x₂=. A new approach to this problem based on Gauss quadrature is given. The method is especially well suited when the dimensions ofA are large and the matrix is sparse.It is also possible to extend this technique to a constrained quadratic form: For a symmetric matrixA we consider the minimization ofx ^T A x–2b ^T x subject to the constraint x₂=.Some numerical examples are given.This work was in part supported by the National Science Foundation under Grant DCR-8412314 and by the National Institute of Standards and Technology under Grant 60NANB9D0908.     

On the limit behaviour of the joint distribution function of order statistics

Fork ₀ fixed we consider the joint distribution functionF _n ^k of then-k smallest order statistics ofn real-valued independent, identically distributed random variables with arbitrary cumulative distribution functionF. The main result of the paper is a complete characterization of the limit behaviour ofF _n ^k (x ₁,,x _n-k) in terms of the limit behaviour ofn(1-F(x _n)) ifn tends to infinity, i.e., in terms of the limit superior, the limit inferior, and the limit if the latter exists. This characterization can be reformulated equivalently in terms of the limit behaviour of the cumulative distribution function of the (k+1)-th largest order statistic. All these results do not require any further knowledge about the underlying distribution functionF.     

The reverse spelling of an FPrt-universal word in two letters

ForX a set the expression Prt(X) denotes the composition monoid of all functionsf X ×X. Fork a positive integer the letterk denotes also the set of all nonnegative integers less thank. Whenk > 1 the expression r_k denotes the connected injective element {<i, i + 1>i k – 1} in Prt (k). We show for every word w=w(x,y) in a two-letter alphabet that if the equation w(x, y)=r_k has a solution =y) ²Prt(k) then ¯w(x,y)=r_k also has a solution in²Prt(k), where ¯w is the word obtained by spelling the wordw backwards. It is a consequence of this theorem that if for every finite setX and for everyf Prt(X) the equation w(x,y)=f has a solution in²Prt(X) then for every suchX andf the equation ¯w(x, y)=f has a solution in²Prt(X).Presented by J. Mycielski.     

The Padé-Rayleigh-Ritz method for solving large hermitian eigenproblems

We make use of the Padé approximants and the Krylov sequencex, Ax,,...,A ^m–1 x in the projection methods to compute a few Ritz values of a large hermitian matrixA of ordern. This process consists in approaching the poles ofR _x()=((I–A)^–1 x,x), the mean value of the resolvant ofA, by those of [m–1/m]_Rx(), where [m–1/m]_Rx() is the Padé approximant of orderm of the functionR _x(). This is equivalent to approaching some eigenvalues ofA by the roots of the polynomial of degreem of the denominator of [m–1/m]_Rx(). This projection method, called the Padé-Rayleigh-Ritz (PRR) method, provides a simple way to determine the minimum polynomial ofx in the Krylov subspace methods for the symmetrical case. The numerical stability of the PRR method can be ensured if the projection subspacem is sufficiently small. The mainly expensive portion of this method is its projection phase, which is composed of the matrix-vector multiplications and, consequently, is well suited for parallel computing. This is also true when the matrices are sparse, as recently demonstrated, especially on massively parallel machines. This paper points out a relationship between the PRR and Lanczos methods and presents a theoretical comparison between them with regard to stability and parallelism. We then try to justify the use of this method under some assumptions.     

Irrepresentability of short semilattices by euclidean subspaces

A semilatticeS isrepresentable by subspaces of R ^k if, to eachx S we can assign a subspace so thatx y=z inS if and only if . Every height-2 semilattice is representable inR ². We show that for everyk there is a height-3 semilattice which is not representable by subspaces ofR ^k.Presented by J. Berman.Research supported in part by the National Science Foundation.Research supported in part by the Office of Naval Research.     

Limit distributions of conditionalU-statistics

Let{(X_n, Y_n)}_n1 be a sequence of i.i.d. bi-variate vectors. In this article, we study the possible limit distributions ofU _n ^h (t), the so-calledconditional U-statistics, introduced by Stute.⁽¹⁰⁾ They are estimators of functions of the formm ^h (t)=E{h(Y ₁,...,Y _k )|X ₁=t ₁,...,X _k =t _k },t=(t ₁,...,t _k ) ^k whereE |h|<. Heret is fixed. In caset ₁=...=t_k=t (say), we describe the limiting random variables asmultiple Wiener integrals with respect toP _t, the conditional distribution ofY, givenX=t. Whent _i, 1ik, are not all equal, we introduce and use a slightly generalized version of a multiple Wiener integral.Research supported by National Board for Higher Mathematics, Bombay, India.     

Construction of polynomials that are orthogonal with respect to a discrete bilinear form

We describe a new algorithm for the computation of recursion coefficients of monic polynomials {p _j } _j ^=0/n that are orthogonal with respect to a discrete bilinear form (f, g) := _k ^=1/m f(x _k )g(x _k )w _k ,m n, with real distinct nodesx _k and real nonvanishing weightsw _k . The algorithm proceeds by applying a judiciously chosen sequence of real or complex Givens rotations to the diagonal matrix diag[x ₁,x ₂, ...,x _m ] in order to determine an orthogonally similar complex symmetric tridiagonal matrixT, from whose entries the recursion coefficients of the monic orthogonal polynomials can easily be computed. Fourier coefficients of given functions can conveniently be computed simultaneously with the recursion coefficients. Our scheme generalizes methods by Elhay et al. [6] based on Givens rotations for updating and downdating polynomials that are orthogonal with respect to a discrete inner product. Our scheme also extends an algorithm for the solution of an inverse eigenvalue problem for real symmetric tridiagonal matrices proposed by Rutishauser [20], Gragg and Harrod [17], and a method for generating orthogonal polynomials based theoron [18]. Computed examples that compare our algorithm with the Stieltjes procedure show the former to generally yield higher accuracy except whenn m. Ifn is sufficiently much smaller thanm, then both the Stieltjes procedure and our algorithm yield accurate results.Research supported in part by the Center for Research on Parallel Computation at Rice University and NSF Grant No. DMS-9002884.     

Some nodes matrices appearing in the numerical analysis for singular integral equations

Let {p _m (w)} be the sequence of Jacobi polynomials corresponding to the weightw(x)=(1–x)(1+x), 0, <1. denote=">x _k (w)=cos _m,k (w),k=1,...,m, the zeros ofp _m (w). If +=0, then the estimates

On the product of the distances of a point from the vertices of a polytope

Letx ₁,...,x _m be points in the solid unit sphere ofE _n and letx belong to the convex hull ofx ₁,...,x _m. Then . This implies that all such products are bounded by (2/m) ^m (m −1) ^m−1. Bounds are also given for other normed linear spaces. As an application a bound is obtained for |p(z ₀)| where andp′(z ₀)=0.     

On cardinal interpolation by Gaussian radial-basis functions: Properties of fundamental functions and estimates for Lebesgue constants

Suppose λ is a positive number. Basic theory of cardinal interpolation ensures the existence of the Gaussian cardinal functionL _λ(x)

Simplex pivots on the set packing polytope

This paper considers the set packing problem max{wx: Ax b, x 0 and integral}, whereA is anm × n 0–1 matrix,w is a 1 ×n weight vector of real numbers andb is anm × 1 vector of ones. In equality form, its linear programming relaxation is max{wx: (x, y) P(A)} whereP(A) = {(x, y):Ax +I _m y =b, x0,y0}. Letx ¹ be any feasible solution to the set packing problem that is not optimal and lety ¹ =b – Ax ¹; then (x ¹,y ¹) is an integral extreme point ofP(A). We show that there exists a sequence of simplex pivots from (x ¹,y ¹) to (x*,y*), wherex* is an optimal solution to the set packing problem andy* =b – Ax*, that satisfies the following properties. Each pivot column has positive reduced weight and each pivot element equals plus one. The number of pivots equals the number of components ofx* that are nonbasic in (x ¹,y ¹).This research was supported by NSF Grants ECS-8005360 and ECS-8307473 to Cornell University.     

Induced operators on symmetry classes of tensors

LetV be ann-dimensional inner product space,T _i ,i=1,...,k, k linear operators onV, H a subgroup ofS _m (the symmetric group of degreem), a character of degree 1 andT a linear operator onV. Denote byK(T) the induced operator ofT onV (H), the symmetry class of tensors associated withH and . This note is concerned with the structure of the setK _{, m} ^H (T₁,...,T_k) consisting of all numbers of the form traceK(T ₁ U ₁...T _k U _k ) whereU _i ,i=1,...k vary over the group of all unitary operators onV. For V=ⁿ or ⁿ, it turns out thatK _{, m} ^H (T₁,...,T_k) is convex whenm is not a multiple ofn. Form=n, there are examples which show that the convexity of _{, m} ^H (T₁,...,T_k) depends onH and .The author wishes to express his thanks to Dr. Yik-Hoi Au-Yeung for his valuable advice and encouragement.