AbstractGiven a system of polynomial equations over a finite field, estimating the p-divisibility of the number of solutions of the system is a classical problem which has been studied extensively since Chevalley–Warning. The degrees of the polynomials concerned play a crucial role in such estimates. Instead of considering all the variables, we focus on the variables with lower degree and the isolated variables and find a partial improvement of the Ax–Katz theorem. Our result also generalizes, improves and unifies those recently obtained for a single polynomial
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
In this paper, we show under the abc conjecture that the Diophantine equation f(x)=u!+v! has only fi...
In the paper we obtain the lower bound for the number of polynomials with the absolute value of thei...
AbstractGiven a system of polynomial equations over a finite field, estimating the p-divisibility of...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
AbstractIn this work, we introduce the p-weight degree of a polynomial over a finite field with resp...
Using some commutative algebra we prove Max Noether’s Theorem, the Jacobi Formula and B´ezout’s The...
In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting...
AbstractWe study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Štefankovič...
AbstractWe present a simple and general algebraic technique for obtaining results in Additive Number...
Assuming Schanuel's conjecture, we prove that any polynomial–exponential equation in one variable mu...
AbstractEstimates are given for the number of variables required to solve p-adic equations. In parti...
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system with...
AbstractDuring the last 10 years the classical Khintchine theorem on approximation of real numbers b...
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Pui...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
In this paper, we show under the abc conjecture that the Diophantine equation f(x)=u!+v! has only fi...
In the paper we obtain the lower bound for the number of polynomials with the absolute value of thei...
AbstractGiven a system of polynomial equations over a finite field, estimating the p-divisibility of...
AbstractLet f be a polynomial over finite field Fq with q elements and let N(f=0) denote the number ...
AbstractIn this work, we introduce the p-weight degree of a polynomial over a finite field with resp...
Using some commutative algebra we prove Max Noether’s Theorem, the Jacobi Formula and B´ezout’s The...
In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting...
AbstractWe study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Štefankovič...
AbstractWe present a simple and general algebraic technique for obtaining results in Additive Number...
Assuming Schanuel's conjecture, we prove that any polynomial–exponential equation in one variable mu...
AbstractEstimates are given for the number of variables required to solve p-adic equations. In parti...
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system with...
AbstractDuring the last 10 years the classical Khintchine theorem on approximation of real numbers b...
We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Pui...
AbstractWe show explicit estimates on the number of q-ratinoal points of an Fq-definable affine abso...
In this paper, we show under the abc conjecture that the Diophantine equation f(x)=u!+v! has only fi...
In the paper we obtain the lower bound for the number of polynomials with the absolute value of thei...