p-convex iteration groups

Convex Hulls by Automata Iteration ∗

This paper considers the problem of computing the real convex hull of a finite set of ndimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The conv...

Computing Convex Hulls by Automata Iteration

This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The con...

Polynomial iteration in characteristic p ∗ †

Let f(x) = ∑d s=0 asx s ∈ Z[x] be a polynomial with ad 6≡ 0 mod p. Take z ∈ Fp and let Oz = {fi(z)}i∈Z+ ⊂ Fp be the orbit of z under f , where fi(z) = f(fi−1(z)) and f0(z) = z. For M < |Oz|, we study the diameter of the partial orbit Oz,M = {z, f(z), f2(z), . . . , fM−1(z)} and prove that diam Oz,M & min { M c log logM , Mp , M 1 2p 1 2 } , where ‘diameter’ is naturally defined in Fp and c depe...

Convex $L$-lattice subgroups in $L$-ordered groups

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

Iteration Theory and Inequalities for Kleinian Groups