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.     

A Genetic Algorithm for Solving a Capacitated p-Median Problem

Facility-location problems have several applications, such as telecommunications, industrial transportation and distribution. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated p-median problem. The proposed GA uses not only conventional genetic operators, but also a new heuristic “hypermutation” operator suggested in this work. The proposed GA is compared with a tabu search algorithm.     

Synthese und Eigenschaften von Sr3Mo1.5Zn0.5O7‐δ, einer Phase mit perowskitverwandter Schichtstruktur

Synthesis and Properties of the Layered Perovskite Phase Sr₃Mo_1.5Zn_0.5O_7‐δ The new layered perovskite phase Sr₃Mo_1.5Zn_0.5O_7‐δ was synthesized by solid state reaction using a Zn/ZnO oxygen buffer. The crystal structure was refined from X‐ray powder pattern by the Rietveld method. The compound crystallizes tetragonal in the space group I4/mmm (no. 139) with the lattice parameters a = 3.9631(3) Å, c = 20.583(1) Å. An oxygen deficiency corresponding to δ ≈ 0.25 was determinated, indicating the presence of molybdenum in mixed valence (Mo⁴⁺ and Mo⁶⁺).     

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.