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.     

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.     

Fire containment in grids of dimension three and higher

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid P_n×P_n×P_n which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.     

Compensated Compactness, Paracommutators, and Hardy Spaces

LetB₁: ⁿ× ^N₁→ ^m₁,B₂: ⁿ× ^N₂→ ^m₂andQ: ^m₂→ ^m₁be bilinear forms which are related as follows: ifμandνsatisfyB₁(ξ, μ)=0 andB₂(ξ, ν)=0 for someξ≠0, thenμ^τQν=0. Supposep⁻¹+q⁻¹=1. Coifman, Lions, Meyer and Semmes proved that, ifuL^p( ⁿ) andvL^q( ⁿ), and the first order systemsB₁(D, u)=0,B₂(D, v)=0 hold, thenu^τQvbelongs to the Hardy spaceH¹( ⁿ), provided that both (i)p=q=2, and (ii) the ranks of the linear mapsB_j(ξ, ·) : ^N_j→ ^m₁are constant. We apply the theory of paracommutators to show that this result remains valid when only one of the hypotheses (i), (ii) is postulated. The removal of the constant-rank condition whenp=q=2 involves the use of a deep result of Lojasiewicz from singularity theory.     

Timetabling County Cricket Fixtures Using a Form of Tabu Search

This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems.