Related papers: A method for proving polynomial enumeration formul…
The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…
Using methods developed by Robinson, we find a complete theory suitable for a first order description of infintesimal neighborhoods. We use this to construct a specialisation having universal properties and to find a recursively enumerable…
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to…
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…
Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…
Using a sums of squares formula for two variable polynomials with no zeros on the bidisk, we are able to give a new proof of a representation for distinguished varieties. For distinguished varieties with no singularities on the two-torus,…
Assuming Schanuel's conjecture, we prove that any polynomial exponential equation in one variable must have a solution that is transcendental over a given finitely generated field. With the help of some recent results in Diophantine…
We extend some results about shifted Schur functions to the general context of shifted Macdonald polynomials. We obtain two explicit formulas for these polynomials: a $q$-integral representation and a combinatorial formula. Our main tool is…