No abstract uploaded!

Let$F$be families of meromorphic functions in a domain$D$, and let$R$be a rational function whose degree is at least 3. If, for any$f∈$$F$, the composite function$R(f)$has no fixed-point in$D$, then$F$is normal in$D$. The number 3 is best possible. A new and much simplified proof of a result of Pang and Zalcman concerning normality and, shared values is also given.

We give a block decomposition of the dg category of character sheaves on a simple and simply-connected complex reductive group G, similar to the one in generalized Springer correspondence. As a corollary, we identify the category of character sheaves on G as the category of quasi-coherent sheaves on an explicitly defined derived stack G^.

The theory of virtual fundamental class defines important invariants such as the Gromov–Witten and the Donaldson– Thomas invariants. It has been generalized to the cosection localized virtual cycle which has applications in Seiberg– Witten, Fan–Jarvis–Ruan–Witten and other invariants. In this paper, we prove the formulas of virtual pullback, torus localization and wall crossing for cosection localized virtual cycles.

There is much research on the dynamical complexity on irregular sets andlevel sets of ergodic average from the perspective of density in base space, theHausdorff dimension, Lebesgue positive measure, positive or full topological entropy (andtopological pressure), etc. However, this is not the case from the viewpoint of chaos.There are many results on the relationship of positive topological entropy and variouschaos. However, positive topological entropy does not imply a strong version of chaos,called DC1. Therefore, it is non-trivial to study DC1 on irregular sets and level sets. Inthis paper, we will show that, for dynamical systems with specification properties, thereexist uncountable DC1-scrambled subsets in irregular sets and level sets. Meanwhile, weprove that several recurrent level sets of points with different recurrent frequency haveuncountable DC1-scrambled subsets. The major argument in proving the above results isthat there exists uncountable DC1-scrambled subsets in saturated sets.