Related papers: Almost-Everywhere Convergence and Polynomials

In this paper, we study the almost everywhere convergence of sequences of two-parameter ergodic averages over rectangles in the plane. On the one hand, we show that if the rectangles we consider have their sides with slopes in a finitely…

For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.

The main goal of the paper is to prove convergence in norm and pointwise almost everywhere on $L^p$, $p\in (1,\infty)$, for certain multiparameter polynomial ergodic averages in the spirit of Dunford and Zygmund for continuous flows. We…

We consider extremal problems for subgraphs of pseudorandom graphs. For graphs $F$ and $\Gamma$ the generalized Tur\'an density $\pi_F(\Gamma)$ denotes the density of a maximum subgraph of $\Gamma$, which contains no copy of~$F$. Extending…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

We prove that almost all geodesics on a noncompact locally symmetric space of finite volume grow with a logarithmic speed -- the higher rank generalization of a theorem of D. Sullivan (1982). More generally, under certain conditions on a…

Let $L^2(X,\Sigma,\mu,\tau)$ be a measure-preserving system, with $\tau$ a $\mathbb{Z}$-action. In this note, we prove that the ergodic averages along integer-valued polynomials, $P(n)$, \[ M_N(f):= \frac{1}{N}\sum_{n \leq N} \tau^{P(n)} f…

We establish pointwise almost everywhere convergence for the polynomial multiple ergodic averages $$\frac{1}{N} \sum_{n=1}^N \La(n) f_1(T^{P_1(n)} x)\cdots f_k(T^{P_k(n)} x)$$ as $N\to \infty$, where $\La$ is the von Mangoldt function, $T…

In this paper, we study the pointwise convergence of centain continuous-time polynomial ergodic averages. Our approach is based on the topological models of measurable flows. One of the main results of this paper is as follows: Let $a\in…

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

The alliance polynomial of a graph $\Gamma$ with order $n$ and maximum degree $\delta_1$ is the polynomial $A(\Gamma; x) = \sum_{k=-\delta_1}^{\delta_1} A_{k}(\Gamma) \, x^{n+k}$, where $A_{k}(\Gamma)$ is the number of exact defensive…

This article establishes a real-variable argument for Zygmund's theorem on almost everywhere convergence of strong arithmetic means of partial sums of Fourier series on $\mathbb{T}$, up to passing to a subsequence. Our approach extends to,…

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

We define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

We study the ring of all functions from the positive integers to some field. This ring, which we call \emph{the ring of number-theoretic functions}, is an inverse limit of the ``truncations'' \Gamma_n consisting of all functions f for which…

For a periodic function $f$ with bounded variation and integral zero on its period interval, we show that $\sum_{k=1}^\infty c_k^2 (\log\log k)^\gamma <\infty$, $\gamma>4$ implies the almost everywhere convergence of $\sum_{k=1}^\infty c_k…