No abstract uploaded!

No abstract uploaded!

From the work of Lian, Liu, and Yau on" Mirror Principle", in the explicit computation of the Euler data Q=\{Q_0, Q_1,...\} for an equivariant concavex bundle Q=\{Q_0, Q_1,...\} over a toric manifold, there are two places the structure of the bundle comes into play:(1) the multiplicative characteric class Q=\{Q_0, Q_1,...\} of Q=\{Q_0, Q_1,...\} one starts with, and (2) the splitting type of Q=\{Q_0, Q_1,...\} . Equivariant bundles over a toric manifold has been classified by Kaneyama, using data related to the linearization of the toric action on the base toric manifold. In this article, we relate the splitting type of Q=\{Q_0, Q_1,...\} to the classifying data of Kaneyama. From these relations, we compute the splitting type of a couple of nonsplittable equivariant vector bundles over toric manifolds that may be of interest to string theory and mirror symmetry. A code in Mathematica that carries out the computation of some of these examples is attached.

The fundamental problem of nonlinear filtering theory is how to solve robust D-M-Z equation in real time and in memoryless manner. This paper describes a new real time algorithm which reduces the nonlinear filtering problem to off-line computations. Our algorithm gives convergent solutions in both pointwise sense and L/sup 2/ in case that the drift term and observation dynamic term have linear growths. The algorithm presented is slightly better than that given in our previous paper (2000).

Given a loop on a surface, its homotopy class can be specified as a word consisting of letters representing the homotopy group generators. One of the interesting problems is how to compute the shortest word for a given loop. This is an NP-hard problem in general. However, for a closed surface that allows a hyperbolic metric and is equipped with a canonical set of fundamental group generators, the shortest word problem can be reduced to finding the shortest loop that is homotopic to the given loop, which can be solved efficiently. In this paper, we propose an efficient algorithm to compute the shortest words for loops given on triangulated surface meshes. The design of this algorithm is inspired and guided by the work of Dehn and BirmanSeries. In support of the shortest word algorithm, we also propose efficient algorithms to compute shortest paths and shortest loops under hyperbolic metrics using a novel