Conformal Mappings of Riemannian Spaces onto Ricci Symmetric Spaces

Mathematical Notes -     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

Peeling phylogenetic ‘oranges’

We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible.     

On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

Noise Path Synthesis with Nonlinear Joints

An efficient synthesis approach is developed which permits thecalculation of the steady-state frequency response of an assembly whichis comprised of linear components and nonlinear joints. Receptancematrices are used to characterize the linear components, which permitscondensation of the system to just the joint degrees-of-freedom.Furthermore, the calculated nonlinear joint forces are then used tostudy the power flow in the assembly, as well as detailed dynamicbehavior within the components. Integrated into the technique is acontinuation scheme which permits efficient parametric studies.     

The many facets of linear programming

We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods. Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001     

Flips and the Hilbert scheme over an exterior algebra

We study the tangent space at a monomial point M in the Hilbert scheme that parameterizes all ideals with the same Hilbert function as M over an exterior algebra.     

Local algorithms in exterior tomography

Exterior tomographic data are taken over lines outside a central region, and such data occur in the industrial nondestructive evaluation of large objects such as rockets. We explain, using microlocal analysis, which singularities are well reconstructed from exterior data, and we explain how this phenomenon is reflected in the singular value decomposition for the exterior transform [E.T. Quinto, Singular value decompositions and inversion methods for the exterior Radon transform and a spherical transform, J. Math. Anal. Appl. 95 (1983) 437–448]. We extend Lambda Tomography to exterior data and to limited angle exterior data. The algorithm is tested on industrial data from Perceptics, Inc.