相关论文: On fewnomials, integral points and a toric version…

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Given integers $\ell > m >0$, we define monic polynomials $X_n$, $Y_n$, and $Z_n$ with the property that $\mu$ is a zero of $X_n$ if and only if the triple $(\mu,\mu+m,\mu+\ell)$ satisfies $x^n + y^n = z^n$. It is shown that the…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

The simplest version of Bertini's irreducibility theorem states that the generic fiber of a non-composite polynomial function is an irreducible hypersurface. The main result of this paper is its analog for a free algebra: if $f$ is a…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We prove several results related to the theorem of Logvinenko and Sereda on determining sets for functions with Fourier transforms supported in an interval. We obtain a polynomial instead of exponential bound in this theorem, and we extend…

We establish an effective Bertini-type theorem for hypersurfaces $X_f \colon f = 0$ defined over a finite field $k$ for which $f$ has no linear factors over the algebraic closure $\overline{k}$. Given a line $L$ defined over $k$ and a…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Given two nonzero polynomials $f, g \in\mathbb R[x,y]$ and a point $(a, b) \in \mathbb{R}^2,$ we give some necessary and sufficient conditions for the existence of the limit $\displaystyle \lim_{(x, y) \to (a, b)} \frac{f(x, y)}{g(x, y)}.$…

Let P^n denote the n-dimensional projective space defined over the algebraic closure of a finite field F_q, let V contained P^n be a complete intersection defined over F_q of dimension r and singular locus of dimension at most s, and let…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let P(x,y) be a rational polynomial and k in Q be a generic value. If the curve (P(x,y)=k) is irreducible and admits an infinite number of points whose coordinates are integers then there exist algebraic automorphisms that send P(x,y) to…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…