October 2, 2000
Similar papers 5
July 28, 2016
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.
March 30, 2011
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...
April 14, 1999
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.
September 1, 2020
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...
April 29, 2005
This paper has been withdrawn by the author due to an error in the main proof (thanks to Carlos D'Andrea)
March 19, 2014
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 ...
September 5, 2016
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 $(...
May 3, 2006
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...
July 8, 2015
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...
September 28, 2018
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...