Related papers: Generic solutions of equations with iterated expon…
We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
Generic Newton polygons for L-functions of exponential sums associated to Laurent polynomials in one variable are determined. The corresponding Hasse polynomials are also determined.
In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
We look for spectral type differential equations for the generalized Jacobi polynomials and for the Sobolev-Laguerre polynomials. We use a method involving computeralgebra packages like Maple and Mathematica and we will give some…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.
We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…
We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.
Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…
In this paper, we study some typical arithmetic properties of Euler's totient function of polynomials over finite fields. Especially, we study polynomial analogues of some classical conjectures about Euler's totient function, such as…
We show that the existence of exceptional polynomials leads to the presence of non-trivial supersymmetry. The existence of these polynomials reveals several distinct isospectral potentials for the Schr\"odinger equation. All Schr\"odinger…
In this paper we use tools from set theory and the uncountable categoricity of Zilber's pseudo-exponential field to show that Zilber's field is isomorphic to the complex field with (standard) exponentiation and hence Schanuel's conjecture…
Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…
We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
We develop a class of integrals on a manifold M called exponential iterated integrals, an extension of K. T. Chen's iterated integrals. It is shown that the matrix entries of any upper triangular representation of the fundamental group of M…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
Using notions of composita and composition of generating functions we obtain explicit formulas for Chebyshev polynomials, Legendre polynomials, Gegenbauer polynomials, Associated Laguerre polynomials, Stirling polynomials, Abel polynomials,…