Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Pointwise and L2 bounds in some nonstandard problems for the heat equation

We consider some initial-boundary value problems for the linear and nonlinear heat equation where the gradient of the solution is prescribed on the boundary. Assuming that a solution exists, we obtain bounds for the solution and its gradient by maximum principle arguments or by means of differential and integral inequalities.     

An unknotting theorem for delta and sharp edge‐homotopy

Two spatial embeddings of a graph are said to be delta (resp. sharp) edge‐homotopic if they are transformed into each other by self delta (resp. sharp) moves and ambient isotopies. We show that any two spatial embeddings of a graph are delta (resp. sharp) edge‐homotopic if and only if the graph does not contain a subgraph which is homeomorphic to the theta graph or the disjoint union of two 1‐spheres, or equivalently G is homeomorphic to a bouquet. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lower bounds for the blow-up time in a temperature dependent Navier-Stokes flow

In this paper we consider two different initial-boundary value problems in temperature dependent viscous flow when the temperature equation has a nonlinear heat source term. When blow-up occurs we derive lower bounds for the blow-up time in each case.     

Spatial decay in a double diffusive convection problem in Darcy flow

This paper deals with a model of time-dependent double diffusive convection in Darcy flow. In particular it is concerned with the spatial decay of solutions when the flow is confined to a semi-infinite cylinder. Decay bounds for an energy expression are derived.     

Regularity of Bunimovich’s stadia

Stadia are popular models of chaotic billiards introduced by Bunimovich in 1974. They are analogous to dispersing billiards due to Sinai, but their fundamental technical characteristics are quite different. Recently many new results were obtained for various chaotic billiards, including sharp bounds on correlations and probabilistic limit theorems, and these results require new, more powerful technical apparatus. We present that apparatus here, in the context of stadia, and prove “regularity” properties.      

Empirical minimization

We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.     

An expansion in the exponent for compound binomial approximations

The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.