Related papers: A method for proving polynomial enumeration formul…

We prove a factorization formula for the Taylor series coefficients of a zero of a polynomial as a function of the polynomial's coefficients. This result extends to more general functions which we call "complex-exponent polynomials". To…

Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…

A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

The question of how to certify the non-negativity of a polynomial function lies at the heart of Real Algebra and it also has important applications to Optimization. In the setting of symmetric polynomials Timofte provided a useful way of…

The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and…

Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…

We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

Using the methodology of (rigorous) {\it experimental mathematics}, we give a simple and motivated solution to Zudilin's question concerning a $q$-analog of a problem posed by Asmus Schmidt about a certain binomial coefficients sum. Our…

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…