The analysis of a fringe heuristic for binary search trees

A detailed analysis is presented for the behaviour of binary search trees built by using a heuristic that performs only local reorganizations at the bottom of the tree.     

Decomposability of free Tarski algebras

In this paper we study the direct decomposability of free Tarski algebras. We show that infinite freely generated Tarski algebras are directly indecomposable, whereas finite freely generated Tarski algebras can only be decomposed into a direct product of two factors, one of which is the two-element Tarski algebra.     

Admissible convergence in Cartan-Hadamard manifolds

In the context of a complete simply connected Riemannian manifold of pinched negative curvature, we show that several families of approach domains are equivalent for convergence to points of the boundary, and for the purposes of H^p-theory.     

Stability of general relativistic static thick disks: the isotropic Schwarzschild thick disk

We study the stability of general relativistic static thick disks. As an application we consider the thick disk generated by applying the “displace, cut, fill and reflect” method, usually known as the image method, to the Schwarzschild metric in isotropic coordinates. The isotropic Schwarzschild thick disk obtained from this method is the simplest model to describe, in the context of General Relativity, real thick galaxies. Stability under a general first order perturbation of the disk energy momentum tensor is investigated. The first order perturbation, when applied to the conservation equations, leads to a set of differential equations that have fewer equations than unknowns. In this article we search for perturbations in which the perturbation of the four velocity in a certain direction leads to a pressure perturbation in the same direction. We found that, in general, the isotropic Schwarzschild thick disk is stable under these kinds of perturbations.     

Extended Hydrodynamics from Enskog’s Equation for a Two-Dimensional System General Formalism

Balance equations are derived from Enskog’s kinetic equation for a two-dimensional system of hard disks using Grad’s moment expansion method. This set of equations constitute an extended hydrodynamics for moderately dense bi-dimensional fluids. The set of independent hydrodynamic fields in the present formulations are: density, velocity, temperature and also—following Grad’s original idea—the symmetric and traceless pressure tensor p _ij and the heat flux vector q ^k . An approximation scheme similar in spirit to one made by Grad in his original work is made. Once the hydrodynamics is derived it is used to discuss the nature of a simple one-dimensional heat conduction problem. It is shown that, not too far from equilibrium, the nonequilibrium pressure in this case only depends on the density, temperature and heat flux vector. PACS: 51.10.+y, 05.20.Jj, 44.10.+i, 05.70.Ln     

Rational approximation schemes for bi-continuous semigroups

This paper extends the Hille-Phillips functional calculus and rational approximations results due to R. Hersh, T. Kato, P. Brenner, and V. Thomée to generators of bi-continuous semigroups. The method yields error estimates for rational time-discretization schemes for such semigroups, in particular for dual semigroups, Feller semigroups such as the Ornstein-Uhlenbeck semigroup, the heat semigroup, semigroups induced by nonlinear flows, implemented semigroups, and evolution semigroups. Furthermore, the results provide error estimates for a new class of inversion formulas for the Laplace transform.     

Searchability in merging and implicit data structures

We introduce the notion ofsearchability as a property of an in place merging algorithm. We show that a pair of sorted arrays can be merged in place in linear time, so that a search can be performed in logarithmic time at any point during the merging process. We apply this method to devise an implicit data structure which can support searches inO(log² n) time in the worst case, andO(logn) on the average, and insertions inO(logn) time, in the worst case.This research was partly supported by NSERC under grant A8237 and presented in preliminary form at the 10th International Colloquium on Automata, Languages and Programming.On leave from the University of Chile.