Related papers: An algorithm for the Faulhaber polynomials

In this article, we give explicit formulas for the $p$-adic valuations of the Fibonomial coefficients ${p^a n \choose n}_F$ for all primes $p$ and positive integers $a$ and $n$. This is a continuation from our previous article extending…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

This paper provides analogues of the results of [G.Walker and R.M.W. Wood, Linking first occurrence polynomials over F_2 by Steenrod operations, J. Algebra 246 (2001), 739--760] for odd primes p. It is proved that for certain irreducible…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

In this paper, we present a probabilistic algorithm to compute the number of $\mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes…

Several years ago the second author playing with different "recognizers of real constants", e.g., the LLL algorithm, the Plouffe inverter, etc. found empirically the following formula. Let $p_n/q_n$ denote the $n$th convergent of the…

For an indeterminate moment problem we denote the orthonormal polynomials by P_n. We study the relation between the growth of the function P(z)=(\sum_{n=0}^\infty|P_n(z)|^2)^{1/2} and summability properties of the sequence (P_n(z)). Under…

Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…

We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

In this paper we treat the Fourier coefficients of Siegel Eisenstein series of level $p$ with trivial or quadratic character, for an odd prime $p$. The Euler $p$-factor of the Fourier coefficient is called the ramified Siegel series. First…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

We prove that if p is a prime with a primitive root 2 then S_p(2^p)=p and give a sufficient condition for an equality of kind S_p(2^p)=+or-p.

This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…

Building on work of Boneh, Durfee and Howgrave-Graham, we present a deterministic algorithm that provably finds all integers $p$ such that $p^r \mathrel| N$ in time $O(N^{1/4r+\epsilon})$ for any $\epsilon > 0$. For example, the algorithm…

In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of…

Let $B$ be the set of odd integers that are sums of two coprime squares. We prove that the trigonometric polynomial $S(\alpha;N)=\sum_{b\in B,b\leq N} e(b\alpha)$ satisfies \[ \frac{S(\alpha; N)}{N/\sqrt{\log N}}<<_{A,A'} \frac{1}{\phi(q)}…