We use the Atiyah-Bott-Segal-Singer Lefschetz fixed point formula to calculate the Hirzebruch ?_y genus X_y(S^[n]), where S^[n] is the Hilbert scheme of points of length n of a surface S. Combinatorial interpretation of the weights of the fixed points of the natural torus action on (²)^[n] is used. This is the first step to prove a conjectural formula about the elliptic genus of the Hilbert schemes.

Different from conventional spaceborne or airborne synthetic aperture radar (SAR) with optimal aperture length, an imaging radar with highly suboptimal aperture length acquires the data in short bursts by a geometry spreading over a large range. A polarlike or pseudopolar format grid is introduced to sample data close to the resolution, which presents the design of a separable kernel for efficient FFT implementation. The proposed imaging algorithm formulates the reflectivity image of the target scene as an interpolation-free double image series expansion with two usual approximation-induced phase error terms being taken into account, whereby more generalized application scenarios with high frequency, large bandwidth or larger aperture length for imaging a target scene located within either the far-field or the near-field of the radar aperture are processable with high accuracy. In addition, convergence

A computational method, based on ₁-minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small

The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by Gromov. For a large collections of polyhedra with interior non-negative scalar curvature and mean convex faces, we prove the dihedral angles along its edges cannot be everywhere less or equal than those of the corresponding Euclidean model, unless it is a isometric to a flat polyhedron.

No abstract uploaded!