On square permutations

The following theorem gives an upper bound on the number of non-real fixed points of an automorphism in terms of the number of connected component of the real part of the

I hope it adds some news ideas and results to the …xed point theory in the framework of generalized functions algebras, with application to the Cauchy-Lipschitz problem in a

We consider encoding finite automata as least fixed points in a proof- theoretical framework equipped with a general induction scheme, and study au- tomata inclusion in that

Our theorem shows that the results of Bingham & Doney (1974, 1975) and de Meyer (1982) remain true in the general case (where A i are not necessarily bounded), so that they can

— The critical weight of each basic region U^ is equal to the number of fixed points (necessarily of rotation number zero) on the finite part of ^Up or to d— 1.. times the length

Besides giving a complete analytic proof of the flower theorem, Abate’s work made evident that, firstly, the dynamics near isolated fixed points can be well understood only once

From Theorem 4.4, a standard Sturmian word which is a fixed point of a nontrivial morphism has a slope with an ultimately periodic continued fraction expansion.. If its period has

In Section 5.1, we give presentations of certain braid groups of T 2 , in Section 5.2, we describe the set of homotopy classes of split 2-valued maps of T 2 , and in Section 5.3,