Related papers: Arithmetic progressions in polynomial orbits
In this paper we prove the following theorem. Let $f:\mathbb{A}^2\rightarrow \mathbb{A}^2$ be a dominate polynomial endomorphisms defined over an algebraically closed field $k$ of characteristic $0$. If there are no nonconstant rational…
We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…
Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
A geometric progression of length $k$ and integer ratio is a set of numbers of the form $\{a,ar,\dots,ar^{k-1}\}$ for some positive real number $a$ and integer $r\geq 2$. For each integer $k \geq 3$, a greedy algorithm is used to construct…
Let $F : \mathrm{End}_{\mathbb{F_p}}(\mathbb{G}_{a/K}^d)$ be an additive polynomial mapping over a global function field $K/\mathbb{F}_q$, and let $P \in \mathbb{G}_a^d(K)$. Following Silverman, consider $\delta := \lim_{n \in \mathbb{N}}…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
In this note, we prove that if $A$ is a finite set of real numbers such that $|AA| = K|A|$, then for every polynomial $f \in \mathbb{R}[x,y]$ we have that $|f(A,A)| = \Omega_{K,\operatorname{deg} f}(|A|^2)$, unless $f$ is of the form…
A problem of recent interest has been to study how large subsets of the natural numbers can be while avoiding 3-term geometric progressions. Building on recent progress on this problem, we consider the analogous problem over quadratic…
We examine the behavior of the number of $k$-term arithmetic progressions in a random subset of $\mathbb{Z}/n\mathbb{Z}$. We prove that if a set is chosen by including each element of $\mathbb{Z}/n\mathbb{Z}$ independently with constant…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to…
A result of P\'olya states that every sequence of quadrature formulas $Q_n(f)$ with $n$ nodes and positive numbers converges to the integral $I(f)$ of a continuous function $f$ provided $Q_n(f)=I(f)$ for a space of algebraic polynomials of…
We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…
In [GTZ08, GTZ12], the following result was established: given polynomials $f,g\in\mathbb{C}[x]$ of degrees larger than $1$, if there exist $\alpha,\beta\in\mathbb{C}$ such that their corresponding orbits $\mathcal{O}_f(\alpha)$ and…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…
For an integer $b \geqslant 2$ and a set $S\subset \{0,\cdots,b-1\}$, we define the Kempner set $\mathcal{K}(S,b)$ to be the set of all non-negative integers whose base-$b$ digital expansions contain only digits from $S$. These well-studied…
We give necessary and sufficient conditions for a sequence to be exactly realizable as the sequence of numbers of periodic points in a dynamical system. Using these conditions, we show that no non-constant polynomial is realizable, and give…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…