Related papers: Polynomial equations modulo prime numbers
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…
An $x$-pseudopower to base $g$ is a positive integer which is not a power of $g$ yet is so modulo $p$ for all primes $p\le x$. We improve an upper bound for the least such number due to E. Bach, R. Lukes, J. Shallit, and H. C. Williams. The…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…
We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…
We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
We propose upper bounds for the number of modular constituents of the restriction modulo $p$ of a complex irreducible character of a finite group, and for its decomposition numbers, in certain cases.
We realize that geometric polynomials and p-Bernoulli polynomials and numbers are closely related with an integral representation. Therefore, using geometric polynomials, we extend some properties of Bernoulli polynomials and numbers such…
We study modular analogues of Schur numbers for systems of linear equations. We show that these only depend on the number of equations, not their coefficients and in the case of one equation show stronger bounds.
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…
We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $$\prod_{j=1}^n\prod_{k=1}^{p-1}(1-q^{pj-k})^s,$$ where $p$ is an odd prime and $n, s$ are positive integers. Let us denote by…
The Welch map $x \rightarrow g^{x-1+c}$ is similar to the discrete exponential map $x \rightarrow g^x$, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to…
We give upper and lower bounds for the number of solutions of the equation $p(z)\log|z|+q(z)=0$ with polynomials $p$ and $q$.