ID: math/0010024

A proof of Pisot's dth root conjecture

October 2, 2000

View on ArXiv

Similar papers 5

On powers that are sums of consecutive like powers

July 28, 2016

79% Match
Vandita Patel, Samir Siksek
Number Theory

Let $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no solutions.

Find SimilarView on arXiv

On the values of G-functions

March 30, 2011

79% Match
Stéphane LM-Orsay Fischler, Tanguy ICJ Rivoal
Number Theory

Let f be a G-function (in the sense of Siegel), and x be an algebraic number; assume that the value f(x) is a real number. As a special case of a more general result, we show that f(x) can be written as g(1), where g is a G-function with rational coefficients and arbitrarily large radius of convergence. As an application, we prove that quotients of such values are exactly the numbers which can be written as limits of sequences a(n)/b(n), where the generating series of both se...

Find SimilarView on arXiv

A proof of Kummer's theorem

April 14, 1999

79% Match
Bruno Gauthier
Classical Analysis and ODEs

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The second section discusses the new proof, in the third section sketches of similar proofs for Bailey's and Dixon's theorems are given.

Find SimilarView on arXiv

Irreducibility of integer-valued polynomials I

September 1, 2020

79% Match
Devendra Prasad
Commutative Algebra

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\ \forall\ a \in S \}.$ This article is an effort to study the irreducibility of integer-valued polynomials over arbitrary subsets of a unique factorization domain. We give a method to construct special kinds of sequences, which we call $d$-seque...

Find SimilarView on arXiv

A simple proof of a conjecture on univariate polynomials and their roots

April 29, 2005

79% Match
P. Ullrich
Commutative Algebra

This paper has been withdrawn by the author due to an error in the main proof (thanks to Carlos D'Andrea)

Find SimilarView on arXiv

On a class of power ideals

March 19, 2014

79% Match
Jörgen Backelin, Alessandro Oneto
Commutative Algebra
Algebraic Geometry
Combinatorics

In this paper we study the class of power ideals generated by the $k^n$ forms $(x_0+\xi^{g_1}x_1+\ldots+\xi^{g_n}x_n)^{(k-1)d}$ where $\xi$ is a fixed primitive $k^{th}$-root of unity and $0\leq g_j\leq k-1$ for all $j$. For $k=2$, by using a $\mathbb{Z}_k^{n+1}$-grading on $\mathbb{C}[x_0,\ldots,x_n]$, we compute the Hilbert series of the associated quotient rings via a simple numerical algorithm. We also conjecture the extension for $k>2$. Via Macaulay duality, those power ...

Find SimilarView on arXiv

Waring's Problem for Polynomial Rings and the Digit Sum of Exponents

September 5, 2016

79% Match
Seth Dutter, Cole Love
Number Theory

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these methods we establish bounds on the necessary number of $k$-th powers in terms of the sum of the digits of $k$ in its base-$p$ expansion. As one particular application we prove that for any fixed prime $p>2$ and any $\epsilon>0$ the number of $(...

Find SimilarView on arXiv

The Casas-Alvero conjecture for infinitely many degrees

May 3, 2006

79% Match
Bothmer Hans-Christian Graf von, Oliver Labs, ... , van de Woestijne Christiaan
Commutative Algebra
Algebraic Geometry

Over a field of characteristic zero, it is clear that a polynomial of the form (X-a)^d has a non-trivial common factor with each of its d-1 first derivatives. The converse has been conjectured by Casas-Alvero. Up to now there have only been some computational verifications for small degrees d. In this paper the conjecture is proved in the case where the degree of the polynomial is a power of a prime number, or twice such a power. Moreover, for each positive characteristic p...

Find SimilarView on arXiv

Lower Bounds by Birkhoff Interpolation

July 8, 2015

79% Match
Ignacio LIP Garcia-Marco, Pascal LIP Koiran
Computational Complexity

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor. Previous lower bounds for this problem were only of order $\Omega$($\sqrt$ d), and were obtained from arguments based on Wronskian determinants a...

Find SimilarView on arXiv

Rationalizing roots: an algorithmic approach

September 28, 2018

79% Match
Marco Besier, Straten Duco van, Stefan Weinzierl
Mathematical Physics

In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which rationalizes the square roots. In this paper, we give an algorithm for rationalizing roots. The algorithm is applicable whenever the algebraic hypersurface associated with the root has a point of multiplicity $(d-1)$, where $d$ is the degree...

Find SimilarView on arXiv