On N-algebraic power series having polynomial growths
نویسنده
چکیده
We study polynomial growth of algebraic series. It is proved that if an Nalgebraic series r with arbitrarily many commuting variables has polynomial growth, then r is in fact N-rational. Also, polynomial growth is decidable. Similar results are proved forN-algebraic series with noncommuting variables having bounded supports. It is also shown that polynomial growth is not decidable for N-algebraic series having noncommuting variables without the additional condition on the supports.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملFormal Power Series Solutions of Algebraic Ordinary Differential Equations
In this paper, we consider nonlinear algebraic ordinary differential equations (AODEs) and study their formal power series solutions. Our method is inherited from Lemma 2.2 in [J. Denef and L. Lipshitz, Power series solutions of algebraic differential equations, Mathematische Annalen, 267(1984), 213-238] for expressing high order derivatives of a differential polynomial via their lower order on...
متن کاملAlgebraic Diagonals and Walks: Algorithms, Bounds, Complexity
The diagonal of a multivariate power series F is the univariate power series Diag F generated by the diagonal terms of F . Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and enumerative combinatorics. We study algorithmic questions related to diagonals in the case where F is the Taylor expansion of a bivariate rational function. It...
متن کاملAlgebraic Generalized Power Series and Automata
A theorem of Christol states that a power series over a finite field is algebraic over the polynomial ring if and only if its coefficients can be generated by a finite automaton. Using Christol’s result, we prove that the same assertion holds for generalized power series (whose index sets may be arbitrary well-ordered sets of nonnegative rationals).
متن کاملOn the complexity of solving ordinary differential equations in terms of Puiseux series
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007