In this paper we study the geometric location of periodic points of power series defined over fields of prime characteristic @math . More specifically, we find a lower bound for the absolute value of all periodic points in the open unit disk of minimal period @math of 2-ramified power series. We prove that this bound is optimal for a large class of power series. Our main technical result is a computation of the first significant terms of the @math th iterate of 2-ramified power series. As a by-product we obtain a self-contained proof of the characterization of 2-ramified power series.
In @cite_5 the authors give a corresponding result of Theorem for minimally ramified power series, where @math is expressed in terms of the coefficients of the first two non-linear terms. Provided the information from Theorem we can make a corresponding version of Corollary for minimally ramified power series, where the conditions for optimality are expressed in terms of the four lowest degree non-linear terms.
@cite_5
2135702680 230449344 2042993834 2007104311
We study analytic germs in one variable with a parabolic fixed point at the origin, over an ultrametric ground field of positive characteristic. It is conjectured that for such a germ the origin is isolated as a periodic point. Our main result is an affirmative solution of this conjecture in the case of a generic germ with a prescribed multiplier. The genericity condition is explicit: the power series is minimally ramified, i.e. the degree of the first nonlinear term of each of its iterates is as small as possible. Our main technical result is a computation of the first significant terms of a minimally ramified power series. From this we obtain a lower bound for the norm of nonzero periodic points, from which we deduce our main result. As a by-product we give a new and self-contained proof of a characterization of minimally ramified power series in terms of the iterative residue. Let ( O ) k be the ring of integers of a finite extension k of the field ( Q ) p of p-adic numbers. The endomorphisms of a formal group law defined over ( O ) k provide nontrivial examples of commuting formal series with coefficients in ( O ) k . This article deals with the inverse problem formulated by Jonathan Lubin within the context of non-Archimedean dynamical systems. We present a large family of series, with coefficients in ( Z ) p , which satisfy Lubin's conjecture. These series are constructed with the help of Lubin–Tate formal group laws over ( Q ) p . We introduce the notion of minimally ramified series which turn out to be modulo p reductions of some series of this family. The commutant monoids of these minimally ramified series are determined by using the Fontaine–Wintenberger theory of the field of norms which allows an interpretation of them as automorphisms of ( Z ) p -extensions of local fields of characteristic zero. A particularly effective example illustrating the paper is given by a family of series generalizing Cebysev polynomials The following theorem is proved. Let f(x_1, , x_m) be a binary nonzero polynomial of m variables of degree . H the number of binary m -tuples (a_1, , a_m) with f(a_1, , a_m) = 1 is less than 2^ m- +1 , then f can be reduced by an invertible affme transformation of its variables to one of the following forms. where m + and 3 . This theorem completely characterizes the codewords of the th-order Reed-Muller code whose weights are less than twice the minimum weight and leads to the weight enumerators for those codewords. These weight formulas are extensions of Berlekamp and Sloane's results. In this paper we study the approximation algorithms for a class of discrete quadratic optimization problems in the Hermitian complex form. A special case of the problem that we study corresponds to the max-3-cut model used in a recent paper of Goemans and Williamson J. Comput. System Sci., 68 (2004), pp. 442-470]. We first develop a closed-form formula to compute the probability of a complex-valued normally distributed bivariate random vector to be in a given angular region. This formula allows us to compute the expected value of a randomized (with a specific rounding rule) solution based on the optimal solution of the complex semidefinite programming relaxation problem. In particular, we present an @math -approximation algorithm, and then study the limit of that model, in which the problem remains NP-hard. We show that if the objective is to maximize a positive semidefinite Hermitian form, then the randomization-rounding procedure guarantees a worst-case performance ratio of @math , which is better than the ratio of @math for its counterpart in the real case due to Nesterov. Furthermore, if the objective matrix is real-valued positive semidefinite with nonpositive off-diagonal elements, then the performance ratio improves to 0.9349.