Related papers: A Polynomial Method Approach to Zero-Sum Subsets i…

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

We establish operator-valued versions of the earlier foundational factorization results for noncommutative polynomials due to Helton (Ann.~Math., 2002) and one of the authors (Linear Alg.~Appl., 2001). Specifically, we show that every…

We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints,…

We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate…

For a finite set $\cal F$ of polynomials over fixed finite prime field of size $p$ containing all polynomials $x^2 - x$ a Nullstellensatz proof of the unsolvability of the system $$ f = 0\ ,\ \mbox{ all } f \in {\cal F} $$ in the field is a…

Given a sequence of orthogonal polynomials $(p_n)_n$ with respect to a positive measure in the real line, we study the real zeros of finite combinations of $K+1$ consecutive orthogonal polynomials of the form $$…

Let f be a polynomial of degree n in ZZ[x_1,..,x_n], typically reducible but squarefree. From the hypersurface {f=0} one may construct a number of other subschemes {Y} by extracting prime components, taking intersections, taking unions, and…

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

We prove that for an arbitrary $\varepsilon>0$ and any multiplicative subgroup $\Gamma \subseteq \mathbf{F}_p$, $1\ll |\Gamma| \le p^{2/3 -\varepsilon}$ there are no sets $B$, $C \subseteq \mathbf{F}_p$ with $|B|, |C|>1$ such that…

Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…

We present new generalizations of Olson's theorem and of a consequence of Alon's Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime…

Recently, using machinery's from Ergodic theory, Z. Lian, and R. Xiao proved if $P$ is any polynomial with no constant term, then for every finite coloring of $\mathbb{N}$, there exists two infinite subsets $B,C$ of $\mathbb{N}$ such that…

The Graph Minor Structure Theorem, originally proven by Robertson and Seymour [JCTB, 2003], asserts that there exist functions $f_1, f_2 \colon \mathbb{N} \to \mathbb{N}$ such that for every non-planar graph $H$ with $t := |V(H)|$, every…

In this paper, a polynomial version of Furstenberg joining is introduced and its structure is investigated. Particularly, it is shown that if all polynomials are non-linear, then almost every ergodic component of the joining is a direct…

The Davenport constant for a finite abelian group $G$ is the minimal length $\ell$ such that any sequence of $\ell$ terms from $G$ must contain a nontrivial zero-sum sequence. For the group $G=(\mathbb Z/n\mathbb Z)^2$, its value is $2n-1$,…

An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…

Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+\infty otherwise. Let A_1,...,A_n be finite nonempty subsets of F, and let $$f(x_1,...,x_n)=a_1x_1^k+...+a_nx_n^k+g(x_1,...,x_n)\in…

Let $G$ be a finite abelian group with exponent $n$. Let $\eta(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise…

We study a nonlinear analogue of additive commutators, known as \textit{polynomial commutators}, defined by $p(ab) - p(ba)$ for a polynomial $p \in F[x]$ and elements $a, b$ in an algebra $R$ over a field $F$. Originally introduced by…

Given any dimension function $h$, we construct a perfect set $E \subseteq \mathbb{R}$ of zero $h$-Hausdorff measure, that contains any finite polynomial pattern. This is achieved as a special case of a more general construction in which we…