相关论文: S\'ark\"ozy's Theorem in Various Finite Field Sett…
Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…
Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists…
Let $\omega$ be a sequence of positive integers. Given a positive integer $n$, we define $$ r_n(\omega) = | \{ (a,b)\in \mathbb{N}\times \mathbb{N}\colon a,b \in \omega, a+b = n, 0 <a<b \}|. $$ S. Sidon conjectured that there exists a…
Let F and K be fields of characteristic 0, with F a subset of K. Let K[x] denote the ring of polynomials with coefficients in K. For p in K[x]\F[x], deg(p) = n, let r be the highest power of x with a coefficient not in F. We define the F…
We establish a polynomial ergodic theorem for actions of the affine group of a countable field $K$. As an application, we deduce--via a variant of Furstenberg's correspondence principle--that for fields of characteristic zero, any "large"…
Let $A$ be a sufficiently dense subset of a finite field $\mathbb F_q$ or a finite, cyclic ring $\mathbb Z/ N\mathbb Z$. Assuming that $q$ and $N$ have no small prime divisors, we show that generalised Fermat equations have the expected…
Let $F\in\mathbb{C}[x,y,z]$ be a constant-degree polynomial,and let $A,B,C\subset\mathbb C$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{11/6})$ points of the Cartesian product $A\times B\times C$, unless $F$ has a…
Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…
Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper, we prove that for any quadratic polynomial $f(x,y,z) \in \mathcal{R}[x,y,z]$ that is of the form $axy+R(x)+S(y)+T(z)$ for some one-variable polynomials $R, S , T$,…
We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…
We establish the restricted sumset analogue of the celebrated conjecture of S\'{a}rk\"{o}zy on additive decompositions of the set of nonzero squares over a finite field. More precisely, we show that if $q>13$ is an odd prime power, then the…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
The following ``Key Lemma'' plays an important role in Parusinski's work on the existence of Lipschitz stratifications in the class of semianalytic sets: For any positive integer n, there is a finite set of homogeneous symmetric polynomials…
Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…
Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…
Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…
Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…
We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…
We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…