Related papers: Sarkozy's theorem in function fields

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

We denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n…

We prove a function field analogue of a conjecture of Schinzel on the factorization of univariate polynomials over the rationals. We derive from it a finiteness theorem for the irreducible factorizations of the bivariate Laurent polynomials…

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…

We prove the following statement. Let $f\in\mathbb{R}[x_1,\ldots,x_d]$, for some $d\ge 3$, and assume that $f$ depends non-trivially in each of $x_1,\ldots,x_d$. Then one of the following holds. (i) For every finite sets…

Sarnak's Density Conjecture is an explicit bound on the multiplicities of non-tempered representations in a sequence of cocompact congruence arithmetic lattices in a semisimple Lie group, which is motivated by the work of Sarnak and Xue.…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

In 1960, Sierpi\'nski proved that there exist infinitely many odd positive integers $k$ such that $k\cdot 2^n+1$ is composite for all positive integers $n$. In this paper, we prove some generalizations of Sierpi\'nski's theorem with $2^n$…

We show that differentiable functions, defined on a convex body $K \subseteq \mathbb R^d$, whose derivatives do not exceed a suitable given sequence of positive real numbers share many properties with polynomials. The role of the degree of…

The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

A famous theorem of Erdos and Szekeres states that any sequence of $n$ distinct real numbers contains a monotone subsequence of length at least $\sqrt{n}$. Here, we prove a positive fraction version of this theorem. For $n > (k-1)^2$, any…

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…

We derive properties of powers of a function satisfying a second-order linear differential equation. In particular we prove that the n-th power of the function satisfies an (n+1)-th order differential equation and give a simple method for…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…