Simplicial Cohomology with Coefficients in Symmetric Categorical Groups

In this paper we introduce and study a cohomology theory {H ⁿ (–,A)} for simplicial sets with coefficients in symmetric categorical groups A. We associate to a symmetric categorical group A a sequence of simplicial sets {K(A,n)} _n0, which allows us to give a representation theorem for our cohomology. Moreover, we prove that for any n3, the functor K(–,n) is right adjoint to the functor _n , where _n (X ) is defined as the fundamental groupoid of the n-loop complex ⁿ (X ). Using this adjunction, we give another proof of how symmetric categorical groups model all homotopy types of spaces Y with _i (Y)=0 for all in,n+1 and n3; and also we obtain a classification theorem for those spaces: [–,Y]H ⁿ (–, _n (Y)).     

Singular Nonlinear (n − 1,1) Conjugate Boundary Value Problems

Solutions are obtained for the boundary value problem, y ⁽ⁿ⁾ + f(x,y) = 0, y ⁽ⁱ⁾(0) = y(1) = 0, 0 i n – 2, where f(x,y) is singular at y = 0. An application is made of a fixed point theorem for operators that are decreasing with respect to a cone.     

Primes in short intervals

Let (x) stand for the number of primes not exceedingx. In the present work it is shown that if 23/421,yx andx>x() then (x)–(x–y)>y/(100 logx). This implies for the difference between consecutive primes the inequalityp _n+1–p _n p _n ^23/42 .     

Triple Positive Solutions for Multipoint Conjugate Boundary Value Problems

For the nth order nonlinear differential equation y ⁽ⁿ⁾(t)=f(y(t)), t [0,1], satisfying the multipoint conjugate boundary conditions, y ^(j)(a_i) = 0,1 i k, 0 j n _i - 1, 0 =a ₁ < a ₂ < < a _k = 1, and _i=1 ^k n _i =n, where f: [0, ) is continuous, growth condtions are imposed on f which yield the existence of at least three solutions that belong to a cone.     

Eigenfunctions and associated functions of an n-th-order linear differential operator

For n2 we consider a differential operatorL [y] z ⁿ y ⁽ⁿ⁾ +P ₁(z)z ^n–1 y ^(n–1) +P ₂ (z)z ^n–2 y ^n–2 + ...+P _n (z)y = y, p ₁ (z), ..., P _n (z) A _R : here a_r is the space of functions which are analytic in the disk ¦z¦ < R, equipped with the topology of compact convergence. We prove the existence of sequences {f_k(z)} _k =o, consisting of a finite number of associated functions of the operator L and an infinite number of its eigenfunctions; we show that the sequence forms a basis in A_r for an arbitrary r, 0 < r <- R; and we establish some additional properties of the sequence ₀ (z), ₁ (z),..., _d–1 (z), f _d (z), f _d+1 (z),... Translated from Matematicheskie Zametki, Vol. 20, No. 6, pp. 869–878, December, 1976.     

Global integration of differential equations through Lobatto quadrature

For the numerical solution of the initial value problemy=f(x,y), –1x1;y(–1)=y ₀ a global integration method is derived and studied. The method goes as follows.At first the system of nonlinear equations is solved. The matrix (A _i,k ⁽ⁿ⁾ ) of quadrature coefficients is nearly lower left triangular and the pointsx _k,n ,k=1,2,...,n are the zeros ofP _n –P _n–2, whereP _n is the Legendre polynomial of degreen. It is showed that the errors From the valuesf(x _i,n ,y _i,n ),i=1,2,...,n an approximation polynomial is constructed. The approximation is Chebyshevlike and the error at the end of the interval of integration is particularly small.     

A characterization of plane Lorentz transformations

Denote (x_i,y_i=ct_i), i=1,2, by X_i and (x₂–x₁)²–(y₂–y₁)² by F(X₁,X₂). Then our result is the following: Given a fixed real number 0 and given a bijection of M=IR² such that F(X₁,X₂) = iff F(X _in1 ^su , _in2 ^su ) =p for all X₁, X₂ M. Then must be a Lorentz transformation (time reversal and inhomogeneity included).     

Integrability of certain solutions of differential equations

Let L=P_o(d/d_t)ⁿ+P₁(d/d_t)^n–1+...+P_n denote a formally self-adjoint differential expression on an open intervalI=(a, b) (–a. Here the P_k are complex valued with (n — k) continuous derivatives onI, and P₀(t) 0 onI. We discuss integrability of functions which are adjoint to certain fundamental solutions ofLy=y, and a related consequence.     

Karmarkar's linear programming algorithm and Newton's method

This paper describes a full-dimensional version of Karmarkar's linear programming algorithm, theprojective scaling algorithm, which is defined for any linear program in ⁿ having a bounded, full-dimensional polytope of feasible solutions. If such a linear program hasm inequality constraints, then it is equivalent under an injective affine mappingJ: ^{n m} to Karmarkar's original algorithm for a linear program in ^m havingm—n equality constraints andm inequality constraints. Karmarkar's original algorithm minimizes a potential functiong(x), and the projective scaling algorithm is equivalent to that version of Karmarkar's algorithm whose step size minimizes the potential function in the step direction.The projective scaling algorithm is shown to be a global Newton method for minimizing a logarithmic barrier function in a suitable coordinate system. The new coordinate system is obtained from the original coordinate system by a fixed projective transformationy = (x) which maps the hyperplaneH _opt ={x:c, x =c ₀} specified by the optimal value of the objective function to the hyperplane at infinity. The feasible solution set is mapped under to anunbounded polytope. Letf _LB(y) denote the logarithmic barrier function associated to them inequality constraints in the new coordinate system. It coincides up to an additive constant with Karmarkar's potential function in the new coordinate system. Theglobal Newton method iterate y ^* for a strictly convex functionf(y) defined on a suitable convex domain is that pointy ^* that minimizesf(y) on the search ray {y+ v _N(y): 0} wherev _N(y) =–(² f(y))^–1(f(y)) is the Newton's method vector. If {x ^(k)} are a set of projective scaling algorithm iterates in the original coordinate system andy ^(k) =(x ^(k)) then {y ^(k)} are a set of global Newton method iterates forf _LB(y) and conversely.Karmarkar's algorithm with step size chosen to minimize the potential function is known to converge at least at a linear rate. It is shown (by example) that this algorithm does not have a superlinear convergence rate.     

A Local Approach to 1-Homogeneous Graphs

Let bea distance-regular graph with diameter d. For vertices x and y of at distancei, 1 i d, we define the setsC _i(x,y) = i–1(x) (y), A _i (x,y) = _i (x) (y) and B _i (x,y) = _i+1(x) (y).Then we say has the CAB_j property,if the partition CAB _i (x,y) = {C _i (x,y),A _i (x,y),B _i (x,y)}of the local graph of y is equitable for each pairof vertices x and y of at distance i j. We show that in with the CAB_j property then the parameters ofthe equitable partitions CAB i(x,y) do not dependon the choice of vertices x and y atdistance i for all i j. The graph has the CAB property if it has the CAB _d property. We show the equivalence of the CAB property and the1-homogeneous property in a distance-regular graph with a ₁ 0. Finally, we classify the 1-homogeneous Terwilligergraphs with c ₂ 2.     

Detailed Error Analysis for a Fractional Adams Method

We investigate a method for the numerical solution of the nonlinear fractional differential equation D _* y(t)=f(t,y(t)), equipped with initial conditions y ^(k)(0)=y ₀ ^(k), k=0,1,...,–1. Here may be an arbitrary positive real number, and the differential operator is the Caputo derivative. The numerical method can be seen as a generalization of the classical one-step Adams–Bashforth–Moulton scheme for first-order equations. We give a detailed error analysis for this algorithm. This includes, in particular, error bounds under various types of assumptions on the equation. Asymptotic expansions for the error are also mentioned briefly. The latter may be used in connection with Richardson's extrapolation principle to obtain modified versions of the algorithm that exhibit faster convergence behaviour.     

On quadratic spline interpolation

Using the quadratic spline interpolates(x) fitting the data (x _i,y _i), 0in and satisfying the end conditions_o=y_o, we give formulae approximatingy andy at selected knots by orders up toO(h ⁴).     

Formulas for best extrapolation

We considern-point Lagrange-Hermite extrapolation forf(x), x>1, based uponf(x _i ),i=1(1)n, –1x _i 1, including non-distinct pointsx _i in confluent formulas involving derivatives. The problem is to find the pointsx _i that minimize the factor in the remainderP _n (x)f ⁽ⁿ⁾()/n, –1<<x subject to the condition|P _n (x)|M, –1x1,2^–n+1M2 ⁿ . The solution is significant only when a single set of pointsx _i suffices for everyx>1. The problem is here completely solved forn=1(1)4. Forn>4 it may be conjectured that there is a single minimal , 0 rn, whererr(M) is a non-decreasing function ofM, P _n (–1)=(–1) ⁿ M, and for 0rn–2, thej-th extremumP _n (x _{e, j} )=(–1) ^n–j M,j=1(1)n–r–1 (except forM=M _r ,r=1(1)n–1, whenj=1(1)n–r).     

On the Rate of Clustering to the Strassen Set for Increments of the Uniform Empirical Process

We obtain outer rates of clustering in the functional laws of the iterated logarithm of Deheuvels and Mason⁽¹¹⁾ and Deheuvels,⁽⁷⁾ which describe local oscillations of empirical processes. Considering increment sizes a _n 0 such that na _n and na _n(log n)^–7/3 we show that the sets of properly rescaled increment functions cluster with probability one to the _n-enlarged Strassen ball in B(0, 1) endowed with the uniform topology, where _n 0 may be chosen so small as (log (1/a _n) + log log n)^–2/3 for any sufficiently large . This speed of coverage is reduced for smaller a _n.     

Optimal quadratures for analytic functions

For integrals _–1 ¹ w(x)f(x)dx with and with analytic integrands, we consider the determination of optimal abscissasx _i ^o and weightsA _i ^o , for a fixedn, which minimize the errorE _n (f)= _–1 ¹ w(x)f(x)dx – _i ⁼¹ⁿ A _i f(x _i ) over an appropriate Hilbert spaceH ²(E ; w(z)) of analytic functions. Simultaneously, we consider the simpler problem of determining intermediate-optimal weightsA _i *, corresponding to (preassigned) Gaussian abscissasx _i ^G , which minimize the quadrature error. For eachw(x), the intermediate-optimal weightsA _i * are obtained explicitly, and these come out proportional to the corresponding Gaussian weightsA _i ^G . In each case,A _i ^G =A _i *+O( ^–4n ), . For , a complete explicit solution for optimal abscissas and weights is given; in fact, the set {x _i ^G ,A _i *;i=1,...,n} to provides the optimal abscissas and weights. For otherw(x), we study the closeness of the set {x _i ^G ,A _i *;i=1,...,n} to the optimal solution {x _i ^o ,A _i ^o ;i=1,...,n} in terms of _n (), the maximum absolute remainder in the second set ofn normal equations. In each case, _n () is, at least, of the order of ^–4n for large.     

Hodge decompositions of Loday symbols inK-theory and cyclic homology

In this paper, we study the Hodge decompositions ofK-theory and cyclic homology induced by the operations ^k and ^k , and in particular the decomposition of the Loday symbols x,y, ...z. Except in special cases, these Loday symbols do not have pure Hodge index. InK _n (A) they can project into every componentK _n ⁽ⁱ⁾ for 2in, and the projection of the Loday symbol x,y, ...,z intoK _n ⁽ⁿ⁾ is a multiple of the generalized Dennis-Stein symbol x,y, ...,z. Our calculations disprove conjectures of Beilinson and Soulé inK-theory, and of Gerstenhaber and Schack in Hochschild homology.Partially supported by National Security Agency grant MDA904-90-H-4019.Partially supported by National Science Foundation grant DMS-8803497.     

Nonabelian K-theory: The nilpotent class of K1 and general stability

A functorial filtration GL _n =S^–1L _n S⁰L _n S ⁱ L _n E _n of the general linear group GL _{n, n} 3, is defined and it is shown for any algebra A, which is a direct limit of module finite algebras, that S^–1 L _n (A)/S⁰L _n (A) is abelian, that S⁰L _n (A) S¹L _n (A) is a descending central series, and that S ⁱ L _n (A) = E _n(A) whenever i the Bass-Serre dimension of A. In particular, the K-functors k ₁ S ⁱ L _n =S ⁱ L _n /E _n are nilpotent for all i 0 over algebras of finite Bass-Serre dimension. Furthermore, without dimension assumptions, the canonical homomorphism S ⁱ L _n (A)/S ⁱ⁺¹ L _n (A)S ⁱ L _{n+ 1}(A)/S ⁱ⁺¹ L _{n + 1} (A) is injective whenever n i + 3, so that one has stability results without stability conditions, and if A is commutative then S⁰L _n (A) agrees with the special linear group SL _n (A), so that the functor S⁰L _n generalizes the functor SL _n to noncommutative rings. Applying the above to subgroups H of GL _n (A), which are normalized by E _n(A), one obtains that each is contained in a sandwich GL _n (A, ) H E _n(A, ) for a unique two-sided ideal of A and there is a descending S⁰L _n (A)-central series GL _n (A, ) S⁰L _n (A, ) S¹L _n (A, ) S ⁱ L _n (A, ) E _n(A, ) such that S ⁱ L _n (A, )=E _n(A, ) whenever i Bass-Serre dimension of A.Dedicated to Alexander Grothendieck on his sixtieth birthday     

On monotone and convex approximation by algebraic polynomials

The following results are obtained: If >0, 2, [3, 4], andf is a nondecreasing (convex) function on [–1, 1] such thatE _n (f) n ^– for any n>, then E _n ⁽¹⁾ (f)Cn ^– (E _n ⁽²⁾ (f)Cn ^–) for n>, where C=C(), E_n(f) is the best uniform approximation of a continuous function by polynomials of degree (n–1), and E _n ⁽¹⁾ (f) (E _n ⁽²⁾ (f)) are the best monotone and convex approximations, respectively. For =2 ( [3, 4]), this result is not true.Published in Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 9, pp. 1266–1270, September, 1994.     

Oscillation and non-oscillation theorems for superlinear Emden–Fowler equations of the fourth order

We study the oscillatory behavior of solutions of the fourth-order Emden–Fowler equation: (E) y^(iv)+q(t)|y|sgny=0, where >1 and q(t) is a positive continuous function on [t₀,), t₀>0. Our main results Theorem 2 – if (q(t)t^(3+5)/2)0, then equation (E) has oscillatory solutions; Theorem 3 – if lim_tq(t)t^4+(-1)=0, >0, then every solution y(t) of equation (E) is either non-oscillatory or satisfies limsup_tt^-+i|y⁽ⁱ⁾(t)|= for < and i=0,1,2,3,4. These results complement those given by Kura for equation (E) when q(t)<0 and provide analogues to the results of the second-order equation, y+q(t)|y|sgny=0,>1. Mathematics Subject Classification (2000) 34C10, 34C15     

A sharp partitioning-inequality for non-atomic probability measures based on the mass of the infimum of the measures

Summary If ₁, ... , are non-atomic probability measures on the same measurable space (S, ), then there is an -measurable partition {A _i } _{i = 1} ⁿ of S so that _i (A _i )(n – 1 + m)^–1 for all i=1, ..., n, where is the total mass of the largest measure dominated by each of the _i S; moreover, this bound is attained for all n1 and all m in [0, 1]. This result is an analog of the bound (n+1-M) ^-1of Elton et al. [5] based on the mass M of the supremum of the measures; each gives a quantative generalization of a well-known cake-cutting inequality of Urbanik [10] and of Dubins and Spanier [2].Research partly supported by NSF Grants DMS-84-01604 and DMS-86-01608