Shape-preserving Kolmogorov widths of classes of <Emphasis Type="Italic">s</Emphasis>-monotone integrable functions

Let s ₀ and let ₊ ^s be the set of functions x defined on a finite interval I and such that, for all collections of s + 1 pairwise different points t ₀,..., t _s I, the corresponding divided differences [x; t ₀,...,t _s ] of order s are nonnegative. Let ₊ ^s B _{p +} ^s B _p, 1 p where B _p is a unit ball in the space L _p, and let ₊ ^s L _{q +} ^s L _q, 1 q . For every s 3 and 1 q p , we determine the exact orders of the shape-preserving Kolmogorov widths {x - y} \right\ L_q , $$]]>, where M ⁿ is the collection of all affine linear manifolds M ⁿ in L _q such that dim M ⁿ n and M ⁿ ₊ ^s L _q .Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 7, pp. 901–926, July, 2004.     

Global optimization for molecular conformation problems

A primal-relaxed dual global optimization algorithm is presented along with an extensive review for finding the global minimum energy configurations of microclusters composed by particles interacting with any type of two-body central forces. First, the original nonconvex expression for the total potential energy is transformed to the difference of two convex functions (DC transformation) via an eigenvalue analysis performed for each pair potential that constitutes the total potential energy function. Then, a decomposition strategy based on the GOP algorithm [1–4] is designed to provide tight upper and lower bounds on the global minimum through the solutions of a sequence of relaxed dual subproblems. A number of theoretical results are included which expedite the computational effort by exploiting the special mathematical structure of the problem. The proposed approach attains-convergence to the global minimum in a finite number of iterations. Based on this procedure global optimum solutions are generated for small Lennard-Jones and Morse (a=3) microclustersn7. For larger clusters (8N24 for Lennard-Jones and 8N30 for Morse), tight lower and upper bounds on the global solution are provided which serve as excellent initial points for local optimization approaches.     

The problem of irregular perfect systems of sets of iterated differences

Fors2, the set of iterated differences associated with the prescribed integersa(s, j), 1js, is the set {a(i, j): 1jis} wherea(i–1,j)=|a(i, j)–a(i, j+1)|, general problem raised by work of Kreweras and Loeb concerns the existence of partitions of runs of consecutive integers into full sets of iterated differences. In the regular case, where all the sets of iterated differences have the same valencys, it is known that such partitions do not exist at least fors>8. We find here that the problem is more challenging in the case where the sets have different valencies.     

Mapping Properties of the Laplacian in Sobolev Spaces of Forms on Complete Hyperbolic Manifolds

For a complete manifold M with constant negative curvature, weprove that the rough Laplacian _R defines topological isomorphisms in the scale of Sobolev spaces H _p ^s (M) ofp-forms for all p, 0 < p< n. For the de Rham Laplacian and M= ⁿ , the Poincaréhyperbolic space, this is shown too for 0 pn,pn/2, p (n± 1)/2.     

Trees in tournaments

Letf(n) be the smallest integer such that every tournament of orderf(n) contains every oriented tree of ordern. Sumner has just conjectures thatf(n)=2n–2, and F. K. Chung has shown thatf(n)(1+o(1))nlog₂ n. Here we show thatf(n)12n andf(n)(4+o(1))n.     

Tangential chow forms — rank 1 hypersurfaces in a Grassmannian

Let X ⁿ P ^N be an n-dimensional projective variety, and N–n–1kN–1. The closure in the Grassmannian G(k+1, N+1) of the set of k-planes meeting the smooth locus of X nontransversally is a tangential Chow form (TCF) of X.TCF's are generally hypersurfaces. We show that a hypersurface is a TCF iff its conormal form has rank 1, and that a TCF is a hypersurface iff some quadric in the second fundamental form of X has rank n+k+1–N.     

Cross-monotone subsequences

Two finite real sequences (a ₁,...,a _k ) and (b ₁,...,b _k ) are cross-monotone if each is nondecreasing anda _i+1–a _i b _i+1–b _i for alli. A sequence (₁,..., _n ) of nondecreasing reals is in class CM(k) if it has disjointk-term subsequences that are cross-monotone. The paper shows thatf(k), the smallestn such that every nondecreasing (₁,..., _n ) is in CM(k), is bounded between aboutk ²/4 andk ₂/2. It also shows thatg(k), the smallestn for which all (₁,..., _n ) are in CM(k)and eithera _k b ₁ orb _k a ₁, equalsk(k–1)+2, and thath(k), the smallestn for which all (₁,..., _n ) are in CM(_k)and eithera ₁b ₁...a _k b _k orb ₁a ₁...b _k a _k , equals 2(k–1)²+2.The results forf andg rely on new theorems for regular patterns in (0, 1)-matrices that are of interest in their own right. An example is: Every upper-triangulark ²×k ² (0, 1)-matrix has eitherk 1's in consecutive columns, each below its predecessor, ork 0's in consecutive rows, each to the right of its predecessor, and the same conclusion is false whenk ² is replaced byk ²–1.     

A Bernstein type theorem on a Randers space

We consider Finsler spaces with a Randers metric F=+, on the three-dimensional real vector space, where is the Euclidean metric and is a 1-form with norm b,0 b1. By using the notion of mean curvature for immersions in Finsler spaces, introduced by Z. Shen, we obtain the partial differential equation that characterizes the minimal surfaces which are graphs of functions. For each b, 0 b1/, we prove that it is an elliptic equation of mean curvature type. Then the Bernstein type theorem and other properties, such as the nonexistence of isolated singularities, of the solutions of this equation follow from the theory developped by L. Simon. For b 1/, the differential equation is not elliptic. Moreover, for every b, 1/b1 we provide solutions, which describe minimal cones, with an isolated singularity at the origin.Partially supported by CAPES/PROCAD.Partially supported by NSF grant DMS-0072242.Partially supported by CNPq and CAPES/PROCAD.     

Blocking Subspaces By Lines In PG(<Emphasis Type="Italic">n,q</Emphasis>)

This paper studies the cardinality of a smallest set of t-subspaces of the finite projective spaces PG(n, q) such that every s-subspace is incident with at least one element of , where 0 t < s n. This is a very difficult problem and the solution is known only for very few families of triples (s, t, n). When the answer is known, the corresponding blocking configurations usually are partitions of a subspace of PG(n, q) by subspaces of dimension t. One of the exceptions is the solution in the case t = 1 and n = 2s. In this paper, we solve the case when t = 1 and 2s < n 3s-3 and q is sufficiently large.     

On the uniqueness of canonical points in the Hobby-Rice theorem

According to the Hobby-Rice theorem for anyn-dimensional subspaceU _n ofL ₁([a, b], ) ( positive, finite, nonatomic) there exist points =s ₀x ₁x _m+1=b, where 0mn, such that

Bonds for a functional on a class of functions with positive real parts

We establish sharp upper and lower bounds for the functionalJ (p)- Re{p (z)-zp'(z)/p(z), 1. where ¦z¦=r is fixed, 0 <r <1, p(z).P_n (A, B), –1 B < a 1, a certain class of regular functions in the disk with values in the right halfplane.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 5, pp. 686–689, May, 1990.     

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.     

On measures that agree on balls

The fundamental result: if and v are two finite Borel measures, defined in the spaceL ^p[0, 1] (1p<) or in C(K) (K is a metric compactum without isolated points), then from the equalities (B)=v(B) for all balls B of radius 1 there follows that =v. In addition, in the spaces C(K) and _p (1p<) from the inequalities (B) v(B) there follows that v.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 177, pp. 122–128, 1989.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

Packing random items of three colors

Consider three colors 1,2,3, and forj3, considern items (X _i,j)in of colorj. We want to pack these items inn bins of equal capacity (the bin size is not fixed, and is to be determined once all the objects are known), subject to the condition that each bin must contain exactly one item of each color, and that the total item sizes attributed to any given bin does not exceed the bin capacity. Consider the stochastic model where the random variables (X _i,jj)in,j3 are independent uniformly distributed over [0,1]. We show that there is a polynomial-time algorithm that produces a packing which has a wasted spaceK logn with overwhelming probability.Work partially supported by an N.S.F. grant.     

Problems and results on additive properties of general sequences,V

A very special case of one of the theorems of the authors states as follows: Let 1a ₁a ₂... be an infinite sequence of integers for which all the sumsa _i +a _j , 1ij, are distinct. Then there are infinitely many integersk for which 2k can be represented in the forma _i +a _j but 2k+1 cannot be represented in this form. Several unsolved problems are stated.Dedicated to our friend Professor E. Hlawka on the occasion of his seventieth birthday     

The Number of Linearly Independent Binary Vectors with Applications to the Construction of Hypercubes and Orthogonal Arrays, Pseudo ( t, m, s)-Nets and Linear Codes

We study formulae to count the number of binary vectors of length n that are linearly independent k at a time where n and k are given positive integers with 1kn. Applications are given to the design of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes.     

Covering a convex body by smaller homothetic copies

Let a convex bodyAE ⁿ be covered bys smaller homothetic copies with coefficients ₁, ..., _s , respectively. It is conjectured that ₁ + ...+ _s n. This conjecture is confirmed in two cases:n is arbitrary ands=n+1;s is arbitrary andn=2.     

On the rank of a spectral function

Let P(x), 0 x 1, be an absolutely continuous spectral function in the separable Hilbert spacesS. If the vectors h_j, j=1, 2, ..., s; s are such that the set P(x)h_j is complete inS, then the rank of the function P(x) equals the general rank of the matrix-function d/dxP(x)h_i,h_js₁.Translated from Matematicheskie Zametki, Vol. 5, No. 4, pp. 457–460, April, 1969.