Related papers: Degree lowering for ergodic averages along arithme…

We prove a generalization of van der Corput's difference theorem for sequences of vectors in a Hilbert space. This generalization is obtained by establishing a connection between sequences of vectors in the first Hilbert space with a vector…

We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by $d$. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of…

The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…

We obtain a generalization of the recent Kelley--Meka result on sets avoiding arithmetic progressions of length three. In our proof we develop the theory of the higher energies. Also, we discuss the case of longer arithmetic progressions,…

If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…

In this work, we study an optimizer, Grad-Avg to optimize error functions. We establish the convergence of the sequence of iterates of Grad-Avg mathematically to a minimizer (under boundedness assumption). We apply Grad-Avg along with some…

We obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain…

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

Often in the analysis of first-order methods for both smooth and nonsmooth optimization, assuming the existence of a growth/error bound or KL condition facilitates much stronger convergence analysis. Hence separate analysis is typically…

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

In 2022, Bergelson and Richter gave a new dynamical generalization of the prime number theorem by establishing an ergodic theorem along the number of prime factors of integers. They also showed that this generalization holds as well if the…

In analogy with the regularity lemma of Szemer\'edi, regularity lemmas for polynomials shown by Green and Tao (Contrib. Discrete Math. 2009) and by Kaufman and Lovett (FOCS 2008) modify a given collection of polynomials \calF =…

The maximum average degree $\mathrm{mad}(G)$ of a graph $G$ is the maximum average degree over all subgraphs of $G$. In this paper we prove that for every $G$ and positive integer $k$ such that $\mathrm{mad}(G) \ge k$ there exists $S…

This paper derives an infinite-horizon ergodic controller based on kernel mean embeddings for long-duration coverage tasks on general domains. While existing kernel-based ergodic control methods provide strong coverage guarantees on general…

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…

A $t$-spanner of a graph $G$ is a subgraph $H$ in which all distances are preserved up to a multiplicative $t$ factor. A classical result of Alth\"ofer et al. is that for every integer $k$ and every graph $G$, there is a $(2k-1)$-spanner of…

We generalize stochastic subgradient descent methods to situations in which we do not receive independent samples from the distribution over which we optimize, but instead receive samples that are coupled over time. We show that as long as…

In this paper we study the multiple ergodic averages $$ \frac{1}{n}\sum_{k=1}^n \varphi(x_k, x_{kq}, ..., x_{k q^{\ell-1}}), \qquad (x_n) \in \Sigma_m $$ on the symbolic space $\Sigma_m ={0, 1, ..., m-1}^{\mathbb{N}^*}$ where $m\ge 2,…

Consider a graph $G=(V,E)$ without isolated edges and with maximum degree $\Delta$. Given a colouring $c:E\to\{1,2,\ldots,k\}$, the weighted degree of a vertex $v\in V$ is the sum of its incident colours, i.e., $\sum_{e\ni v}c(e)$. For any…

We study the optimization of ergodic averages for multi-valued dynamical systems, i.e. where points may have multiple different forward orbits. Under upper semi-continuity assumptions, we show that the maximum space average with respect to…