Monomial gorenstein curves in A4 as set-theoretic complete intersections

It is shown that if the prime ideal ,, x₄], k an arbitrary field, has generic zero x_i=tⁿ _i, n_i positive integers with g.c.d. equal l, l i 4, then P(S) is a set-theoretic complete intersection if the numerical semigroup S=1,, n₄> is symmetric (i.e. if the extension of P(S) in k[[x₁,, x₄]] is a Gorenstein ideal).     

A structure theorem for sum form functional equations

Summary It is proved that, iff _ij:]0, 1[ C (i = 1, ,k;j = 1, ,l) are measurable, satisfy the equation (1) (with some functionsg _it, h_jt:]0, 1[ C), then eachf _ij is in a linear space (called Euler space) spanned by the functionsx x ^j(logx) ^k (x ]0, 1[;j = 1, ,M;k = 0, ,m _j – 1), where ₁, , _M are distinct complex numbers andm ₁, , m_M natural numbers. The dimension of this linear space is bounded by a linear function ofN.     

Knaster's problem on continuous maps of a sphere into Euclidean space

A survey of known results and additional new ones on Knaster's problem: on the standard sphere S^n–1Rⁿ find configurations of points A₁, , A_k, such that for any continuous map fS^n–1R^m one can find a rotation a of the sphere S^n–1 such that f(a(A₁)==f(a(A_k)) and some problems closely connected with it. We study the connection of Knaster's problem with equivariant mappings, with Dvoretsky's theorem on the existence of an almost spherical section of a multidimensional convex body, and we also study the set {a S0(n)f(a(A₁))==f(a(A_k))} of solutions of Knaster's problem for a fixed configuration of points A₁, , A_kS^n–1 and a map fS^n–1R^m in general position. Unsolved problems are posed.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 167, pp. 169–178, 1987.     

Two-sided polynomial approximation of functions

Conditions are established when the collocation polynomials P_m(x) and P_M(x), m M, constructed respectively using the system of nodes x_j of multiplicities a_j 1, j = O,, n, and the system of nodes x_-r,,x_o,,x_n,,x_n+r1, r O, r₁ O, of multiplicities a_-r,,(a_o + y_o),,(a_n + y_n),,a_n+r1, a_j + y_j 1, are two sided-approximations of the function f on the intervals , x_j[, j = O,...,n + 1, and on unions of any number of these intervals. In this case, the polynomials P_m (x), P_M ^(l) (x) with l a_j are two-sided approximations of the function f⁽¹⁾ in the neighborhood of the node x_j and the integrals of the polynomials P_m(x), P_M(x) over D_j are two-sided approximations of the integral of the function f (over D_j). If the multiplicities a_j a_j + y_j of the nodes x_j are even, then this is also true for integrals over the set _j= _µ ^k D_j µ 1, k n. It is shown that noncollocation polynomials (Fourier polynomials, etc.) do not have these properties.Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 67, pp. 31–37, 1989.     

A preconditioner for constrained and weighted least squares problems with Toeplitz structure

We study methods for solving the constrained and weighted least squares problem min _x by the preconditioned conjugate gradient (PCG) method. HereW = diag (₁, , _m ) with _{1 m} 0, andA ^T = [T ₁ ^T , ,T _k ^T ] with Toeplitz blocksT _l R ^{n × n} ,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A ^T = 0, whereM =W ^–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E.     

Summierbarkeit der geometrischen Reihe auf vorgeschriebenen Mengen

In this paper we are concerned with the summability of the geometric series by matrix methods. We prove the following theorem: Suppose M_o:={z:|z|<1}, M₁, M₂, is a collection of countably many Lebesgue measureable, disjoint sets. For k=1,2, let f_k be a prescribed function, analytic on . Then there exists a triangular matrix , such that the V-transform {_n(z)} of the geometric series has the following properties: {_n(z)} converges compactly to on M_o; for k=1,2, there are sets B_k, such that has Lebesgue-measure zero and _n(z)f_k(z) for zB_k; if there is a set B^*, such that B^*M^* has Lebesgue-measure zero and {_n(z)} diverges for zB^*.     

Differential geometry of tensor product immersions II

In the first part of this series, we prove that the tensor product immersionf ₁ f _2k of2k isometric spherical immersions of a Riemannian manifoldM in Euclidean space is of-type with k and classify tensor product immersionsf ₁ f _2k which are ofk-type. In this article we investigate the tensor product immersionsf ₁ f _2k which are of (k+1)-type. Several classification theorems are obtained.     

An explicit calculation of the mean of the perimeter of the convex hull of a plane random walk

If (X _n ) _n ⁼¹ is a sequence of i.i.d. random variables in the Euclidean plane such that we compute the mean of the perimeter of theconvex hull ofX ₁++X _k; 0kn}.     

On the convexity of the sum of the first eigenvalues of operators depending on a real parameter

Let ₁ (k) ₂ (k) be the eigenvalues of an operator of a certain type depending on a real parameterk. The paper shows that under certain requirements on the operator and on the nature of its dependence onk, the sum ₁ (k)++ _N (k) is a concave function ofk, for any positive integerN.

---

Zusammenfassung Seien ₁ (k) ₂ (k) die Eigenwerte eines von einem reellen Parameterk abhängigen Operators. Man zeigt, daß unter gewissen Voraussetzungen über den Operator und seine Abhängigkeit vonk die Summe ₁ (k)++ _N (k) für jedesN eine konkave Funktion vonk ist.

     

Asymptotically minimax tests of composite hypotheses

Summary X ₁,,X> _n are independent, identically distributed random variables with common density function f(x¦ ₁ ,, _k , _k+1 ), assumed to satisfy certain standard regularity conditions. The k+1 parameters are unknown, and the problem is to test the hypothesis that _k+1 =b against the alternative that _k+1 =b+cn ^–1/2 . ₁ ,, _k are nuisance parameters. For this problem, the following artificial problem is temporarily substituted. It is known that ¦ ₁ -a _i ¦n ^–1/2 M(n) for i=1,,k, where a ₁ , ,a _k are known, and M(n) approaches infinity as n increases but n ^–1/2 M(n) approaches zero as n increases. A Bayes decision rule is constructed for this artificial problem, relative to the a priori distribution which assigns weight A to _k+1 =b, and weight 1-A to _k+1 =b+cn ^–1/2 , in each case the weight being spread uniformly over the possible values of ₁ ,, _k in the artificial problem. An analysis of the structure of the Bayes rule shows that if estimates of ₁ ,..., _k are substituted for a ₁ ..., a _k respectively, the resulting rule is a solution to the original problem, and this rule has the same asymptotic properties as a solution to the artificial problem as the Bayes rule for the artificial problem, no matter what the values a ₁ ..., a _k are.Research supported by the U.S. Air Force under Grant AF-AFOSR-68-1472.     

The complete figure for second order multiple integral problems in the calculus of variations

Notation Throughout this paper Greek indices, , , and Latin indicesi, j, h, k, assume the values 1, ,m, and 1, ,n respectively. The summation convention is operative in respect of both sets of indices.This work was supported by the South African Council for Scientific and Industrial Research.At time of writing Professor Grässer was Visiting Scholar at the University of Arizona, Tucson, Arizona.     

A statistical estimate of the structure of multi-extremal problems

The solution of ak-extremal problem is defined as the set of pairs (x _i ^* , _i),i = 1, ,k, where x _t ^* isi ^th local minimum and _i is the volume of the set of attraction of this minimum. A Bayesian estimate ofk and ( ₁ , , _k ) is constructed.This paper has been written while the author was a CNR visiting professor at the Institute of Mathematics of the Milano University.     

On a characterization of polynomials by divided differences

Summary We consider the functional equationf[x ₁,x ₂,, x _n ] =h(x ₁ + +x _n ) (x ₁,,x _n K, x _j x _k forj k), (D) wheref[x ₁,x ₂,,x _n ] denotes the (n – 1)-st divided difference off and prove Theorem. Let n be an integer, n 2, let K be a field, char(K) 2, with # K 8(n – 2) + 2. Let, furthermore, f, h: K K be functions. Then we have that f, h fulfil (D) if, and only if, there are constants a_j K, 0 j n (a := a_n, b := a_{n – 1}) such thatf = ax ⁿ +bx ^{n – 1} + +a ₀ and h = ax + b.     

Interval-dividing processes

Summary If and then P(n ^–1·[(Y ₁)++(Y _n )] converges to cnts. law on R ¹) = P(n ^–1·[(Y ₁)++(Y _n )] converges to a cnts. law on R ¹). Thus if ,n then n ^–1[(X ₁)+...+(X _n )] converges a.s. The main result here generalizes this: Let X ₍₁₎ ⁿ , X ₍₂₎ ⁿ ,..., X _(n) ⁿ be the order statistics associated with X ₁, X ₂,,X _n. Define random variables Z ₁,Z ₂, by {Z _n =i}={X _n =X _(i) ⁿ }. Then if Z ₁,Z ₂,Z ₃, are independent and P(Z_ni)i/n, and {X _i} is bounded, n ^–1·[(X ₁)++(X _n)] converges a.s.     

A trace theorem and a linearization method for operator polynomials

Let p() = ⁿI - ^n-1 A₁ - A_n, where A_i are operators on a Banach space X with (1/i)^th power summable approximation numbers. Then the sum of the eigenvalues of the operator polynomial p() equals the trace of A₁. This is shown by a linearization method which is further used to generalize results on the completeness of the eigenvalues of p() under suitable conditions on the resolvent.     

The Braided product of Ockham algebras

In this paper we introduce an algebraic concept of the product of Ockham algebras called the Braided product. We show that ifL _i MS(i=1, 2, ,n) then the Braided product ofL _i(i=1, 2, ,n) exists if and only ifL ₁, ,L _n have isomorphic skeletons.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

A class of simplicial restart fixed point algorithms without an extra dimension

In an earlier paper we introduced an algorithm for approximating a fixed point of a mapping on the product space of unit simplices. Ideas of that paper are used to construct a class of triangulations ofR ⁿ. More precisely, for somek, 1 k n, and positive integersm ₁ , m_k with sumn, a triangulation ofR ⁿ is obtained by triangulating the cells which are formed by taking the product of given triangulations ofR ^mj, j = 1, ,k. The triangulation of each cell will be defined in relation to an arbitrarily chosen pointv inR ⁿ, being the starting point of the algorithm. Fork = n we obtain theK triangulation originally due to Todd. Each element of the class can be used to find a simplex which approximates a fixed point of a mapping onR ⁿ by generating a unique path of adjacent simplices of variable dimension starting with the pointv. We also give convergence conditions. It is indicated how in casek = n a connected set of fixed points can be generated. Moreover, we give some computational experience.     

Hypergraphs and hypergroups

We associate to every hypergraph a commutative quasi-hypergroupH _qG and find a necessary and sufficient condition on so thatH is associative. For certain, any finite included, we determine a sequence= ₀, ₁,, _n of hypergraphs such that ifH ₀ ,H ₁ ,H, H _n is the sequence of the associated quasi-hypergroups,H _n is a join space.Presented by I. Rosenberg.     

A n 4 -polyhedra with free homology

An A _n ^k -polyhedron is a CW-complex which is (n–1)-connected and of dimension (n+k). We compute an algebraic category which is equivalent to the homotopy category of A _n ² -polyhedra with free homology (n3). This computation and a calculation of the -group _n+3(X) (n3) is used to obtain a complete algebraic homotopy invariant for A _n ⁴ -polyhedra with free homology (n3).As an application we compute the group of self-homotopy equivalences Aut(X) for a bouquet X=P².