Completely invariant components of the Fatou sets of meromorphic maps are discussed. Positive answers are given to Baker’s and Bergweiler’s problems that such components are the only Fatou components for certain classes of meromorphic maps.

The notion of central stability was first formulated for sequences of representations of the symmetric groups by Putman. A categorical reformulation was subsequently given by Church, Ellenberg, Farb, and Nagpal using the notion of FI-modules, where FI is the category of finite sets and injective maps. We extend the notion of central stability from FI to a wide class of categories, and prove that a module is presented in finite degrees if and only if it is centrally stable. We also introduce the notion of d-step central stability, and prove that if the ideal of relations of a category is generated in degrees at most d, then every module presented in finite degrees is d-step centrally stable.

This paper studies affine Deligne-Lusztig varieties $X_{w}(b)$ in the affine flag variety of a quasi-split tamely ramified group. We describe the geometric structure of $X_{w}(b)$ for a minimal length element $w$ in the conjugacy class of an extended affine Weyl group, generalizing one of the main results in \cite{HL} to the affine case. We then provide a reduction method that relates the structure of $X_{w}(b)$ for arbitrary elements $w$ in the extended affine Weyl group to those associated with minimal length elements. Based on this reduction, we establish a connection between the dimension of affine Deligne-Lusztig varieties and the degree of the class polynomial of affine Hecke algebras. As a consequence, we prove a conjecture of G\"ortz, Haines, Kottwitz and Reuman in \cite{GHKR}.

A multilevel quality-guided phase unwrapping algorithm for real-time 3D shape measurement is presented. The quality map is generated from the gradient of the phase map. Multilevel thresholds are used to unwrap the phase level by level. Within the data points in each level, a fast scan-line algorithm is employed. The processing time of this algorithm is approximately 18.3 ms for an image size of 640480 pixels in an ordinary computer. We demonstrate that this algorithm can be implemented into our real-time 3D shape measurement system for real-time 3D reconstruction. Experiments show that this algorithm improves the previous scan-line phase unwrapping algorithm significantly although it reduces its processing speed slightly.

No abstract uploaded!