Estimates of the number of rational mappings from a fixed variety to varieties of general type

First we find effective bounds for the number of dominant rational maps $f:X \rightarrow Y$ between two fixed smooth projective varieties with ample canonical bundles. The bounds are of the type $\{A \cdot K_X^n\}^{\{B \cdot K_X^n\}^2}$, where $n=dimX$, $K_X$ is the canonical bundle of $X$ and $A,B$ are some constants, depending only on $n$. Then we show that for any variety $X$ there exist numbers $c(X)$ and $C(X)$ with the following properties: For any threefold $Y$ of general type the number of dominant rational maps $f:X \r Y$ is bounded above by $c(X)$. The number of threefolds $Y$, modulo birational equivalence, for which there exist dominant rational maps $f:X \r Y$, is bounded above by $C(X)$. If, moreover, $X$ is a threefold of general type, we prove that $c(X)$ and $C(X)$ only depend on the index $r_{X_c}$ of the canonical model $X_c$ of $X$ and on $K_{X_c}^3$.Comment: A revised version. The presentation of results and proofs has been improved. AMS-TeX, 19 page

On C-fibrations over projective curves

The goal of this paper is to present a modified version (GML) of ML invariant which should take into account rulings over a projective base and allow further stratification of smooth affine rational surfaces. We provide a non-trivial example where GML invariant is computed for a smooth affine rational surface admitting no C-actions. We apply GML invariant to computation of ML invariant of some threefolds.Comment: 21 pages, LaTe

Jordan properties of automorphism groups of certain open algebraic varieties

Let $W$ be a quasiprojective variety over an algebraically closed field of characteristic zero. Assume that $W$ is birational to a product of a smooth projective variety $A$ and the projective line. We prove that if $A$ contains no rational curves then the automorphism group $G:=Aut(W)$ of $W$ is Jordan. That means that there is a positive integer $J=J(W)$ such that every finite subgroup $\mathcal{B}$ of ${G}$ contains a commutative subgroup $\mathcal{A}$ such that $\mathcal{A}$ is normal in $\mathcal{B}$ and the index $[\mathcal{B}:\mathcal{A}] \le J$

Algorithmic decidability of Engel's property for automaton groups

We consider decidability problems associated with Engel's identity ($[\cdots[[x,y],y],\dots,y]=1$ for a long enough commutator sequence) in groups generated by an automaton. We give a partial algorithm that decides, given $x,y$, whether an Engel identity is satisfied. It succeeds, importantly, in proving that Grigorchuk's $2$-group is not Engel. We consider next the problem of recognizing Engel elements, namely elements $y$ such that the map $x\mapsto[x,y]$ attracts to $\{1\}$. Although this problem seems intractable in general, we prove that it is decidable for Grigorchuk's group: Engel elements are precisely those of order at most $2$. Our computations were implemented using the package FR within the computer algebra system GAP

A guided tour of asynchronous cellular automata

Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field. We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat