Les beaux automorphismes

Assume that the class of partial automorphisms of the monster model of a complete theory has the amalgamation property. The beautiful automorphisms are the automorphisms of models ofT which: 1. are strong, i.e. leave the algebraic closure (inT ^eq) of the empty set pointwise fixed, 2. are obtained by the Fraïsse construction using the amalgamation property that we have just mentioned. We show that all the beautiful automorphisms have the same theory (in the language ofT plus one unary function symbol for the automorphism), and we study this theory. In particular, we examine the question of the saturation of the beautiful automorphisms. We also prove that in some cases (in particular if the theory is -stable andG-trivial), almost all (in the sense of Baire categoricity) automorphisms of the saturated countable model are beautiful and conjugate.     

Longitudinal acceptance computation for A 50 MeV race track microtron

The algorithm for analysing of longitudinal motion and for calculating phase trajectory in race track microtron (RTM) with small injection energy and small energy gain per turn is described. A longitudinal acceptance is calculated.We are indebted to E. A. Perelshtein and N. Ju. Kazarinov and A. Ju. Molodozhencev for stimulating advices. We thank M. Slodika for work with program coding.