ID: math/0010024

A proof of Pisot's dth root conjecture

October 2, 2000

View on ArXiv

Similar papers 4

A Note on The Positivity of the Coefficients of Some Power Series Expansions

April 4, 2011

79% Match
Omran Kouba
Complex Variables
Classical Analysis and ODEs

In this short note, a general result concerning the positivity, under some conditions, of the coefficients of a power series is proved. This allows us to answer positively a question raised by Guo (2010) about the sign of the coefficients of a power series relating the residual errors in Halley's iterations for the $p$th root.

Find SimilarView on arXiv

A note on a generalization of the Hadamard quotient theorem

September 8, 2013

79% Match
Vesselin Dimitrov
Number Theory

We consider a generalization of the "Hadamard quotient theorem" of Pourchet and van der Poorten. A particular case of our conjecture states that if $f := \sum_{n \geq 0} a(n)x^n$ and $g := \sum_{n \geq 0} b(n)x^n$ represent, respectively, an algebraic and a rational function over a global field $K$ such that $b(n) \neq 0$ for all $n$ and the coefficients of the power series $h := \sum_{n \geq 0} a(n)/b(n)x^n$ are contained in a finitely generated ring, then $h$ is algebraic. ...

Find SimilarView on arXiv

Approximation of values of algebraic elements over the ring of power sums

October 19, 2021

79% Match
Clemens Fuchs, Sebastian Heintze
Number Theory

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies \begin{equation*} G(n) = G_n = b_1 c_1^n + \cdots + b_h c_h^n \end{equation*} with $ c_1,\ldots,c_h \in \mathbb{Z} $ and $ b_1,\ldots,b_h \in \mathbb{Q} $. Furthermore, let $ f \in \mathbb{Q}[x,y] $ be absolutely irreducible and $ \alpha : \mathbb{N} \ri...

Find SimilarView on arXiv

On the Order of Power Series and the Sum of Square Roots Problem

April 26, 2023

79% Match
Louis Gaillard, Gorav Jindal
Computational Complexity
Symbolic Computation

This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that has a non-zero coefficient in $f(x)$. Our first result is that the order of the Wronskian of these power series is equivalent up to a polynomial factor, to the maximum order which occurs in the linear combination of these power series. This...

Find SimilarView on arXiv

On roots of unity in orbits of rational functions

March 13, 2016

79% Match
Alina Ostafe
Number Theory

In this paper we characterise univariate rational functions over a number field $\K$ having infinitely many points in the cyclotomic closure $\K^c$ for which the orbit contains a root of unity. Our results are similar to previous results of Dvornicich and Zannier describing all polynomials having infinitely many preperiodic points in $\K^c$.

Find SimilarView on arXiv

Rational series and asymptotic expansion for linear homogeneous divide-and-conquer recurrences

June 30, 2013

79% Match
Philippe Dumas
Computational Complexity

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been studied from the asymptotic standpoint. We show how a mechanical process permits to compute their asymptotic expansion. It is based on linear algebra, with Jordan normal form, joint spectral radius, and dilation equations. The method is compared...

Find SimilarView on arXiv

Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach

January 19, 2014

79% Match
Bruno Grenet
Symbolic Computation
Computational Complexity
Data Structures and Algorith...

We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the computation of irreducible factors of degree at most $d$ of univariate lacunary polynomials and to the factorization of low-degree multivariate polynomials. The reduction runs in time polynomial in the size of the input polynomial and in $d$. As...

Find SimilarView on arXiv

On the selection of polynomials for the DLP quasi-polynomial time algorithm in small characteristic

June 26, 2017

79% Match
Giacomo Micheli
Number Theory
Cryptography and Security

In this paper we characterize the set of polynomials $f\in\mathbb F_q[X]$ satisfying the following property: there exists a positive integer $d$ such that for any positive integer $\ell$ less or equal than the degree of $f$, there exists $t_0$ in $\mathbb F_{q^d}$ such that the polynomial $f-t_0$ has an irreducible factor of degree $\ell$ over $\mathbb F_{q^d}[X]$. This result is then used to progress in the last step which is needed to remove the heuristic from one of the qu...

Find SimilarView on arXiv

Sur les {\pi}-exponentielles I : Vecteurs de Witt annul\'es par Frobenius et Algorithme de (leur rayon de convergence)

March 3, 2014

79% Match
Rodolphe Richard
Number Theory

(Quoted from the article) Our object is the theory of "{\pi}-exponentials" Pulita developed in his thesis [...] We start with an abstract algebra statement about the structure of the kernel of iterations of the Frobenius endomorphism on the ring of Witt vectors with coordinates in the ring of integers of an ultrametric extension of $\mathbf{Q}_p$. Provided sufficiently (ramified) roots of unity are available, it is, unexpectedly simply, a principal ideal with respect to an ex...

Find SimilarView on arXiv

On the transcendence of some infinite sums

September 13, 2009

79% Match
Pingzhi Yuan, Juan Li
Number Theory

In this paper we investigate the infinite convergent sum $T=\sum_{n=0}^\infty\frac{P(n)}{Q(n)}$, where $P(x)\in\bar{\mathbb{Q}}[x]$, $Q(x)\in\mathbb{Q}[x]$ and $Q(x)$ has only simple rational zeros. N. Saradha and R. Tijdeman have obtained sufficient and necessary conditions for the transcendence of $T$ if the degree of $Q(x)$ is 3. In this paper we give sufficient and necessary conditions for the transcendence of $T$ if the degree of $Q(x)$ is 4 and $Q(x)$ is reduced.

Find SimilarView on arXiv