Related papers: Degree lowering for ergodic averages along arithme…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…
We present a unified approach to extensions of Bourgain's Double Recurrence Theorem and Bourgain's Return Times Theorem to integer parts of the Kronecker sequence, emphasizing stopping times and metric entropy. Specifically, we prove the…
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. Moreover, the wide variety of such constraints in practical applications led to general modelling techniques and generic propagation algorithms,…
In this paper we are concerned with the study of additive ergodic averages in multiplicative systems and the investigation of the "pretentious" dynamical behaviour of these systems. We prove a mean ergodic theorem (Theorem A) that…
Let $\F$ a finite field. We show that the universal characteristic factor for the Gowers-Host-Kra uniformity seminorm $U^k(\X)$ for an ergodic action $(T_g)_{g \in \F^\omega}$ of the infinite abelian group $\F^\omega$ on a probability space…
In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…
The goal of multi-task learning is to enable more efficient learning than single task learning by sharing model structures for a diverse set of tasks. A standard multi-task learning objective is to minimize the average loss across all…
Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…
Preferential attachment is widely used to model power-law behavior of degree distributions in both directed and undirected networks. In a directed preferential attachment model, despite the well-known marginal power-law degree…
Estimating the average degree of graph is a classic problem in sublinear graph algorithm. Eden, Ron, and Seshadhri (ICALP 2017, SIDMA 2019) gave a simple algorithm for this problem whose running time depended on the graph arboricity, but…
We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…
Let $(X,\mu)$ be an arbitrary measure space equipped with a family of pairwise commuting measure preserving transformations $T_1, \dotsc, T_m$. We prove that the ergodic averages \[ A_{N;X}^{P_1, \dotsc, P_m}f = \frac{1}{N} \sum_{n=1}^N…
To profit from price oscillations, investors frequently use threshold-type strategies where changes in the portfolio position are triggered by some indicators reaching prescribed levels. In this paper, we investigate threshold-type…
Let T be an ergodic automorphism of the d-dimensional torus T^d, and f be a continuous function from T^d to R^l. On the probability space T^d equipped with the Lebesgue-Haar measure, we prove the weak convergence of the sequential empirical…
This is an earlier, but more general, version of "An L^1 Ergodic Theorem for Sparse Random Subsequences". We prove an L^1 ergodic theorem for averages defined by independent random selector variables, in a setting of general…
Let $T$ be the Koopman operator of a measure preserving transformation $\theta$ of a probability space $(X,\Sigma,\mu)$. We study the convergence properties of the averages $M_nf:=\frac1n\sum_{k=0}^{n-1}T^kf$ when $f \in L^r(\mu)$, $0<r<1$.…
Semi-invertible multiplicative ergodic theorems establish the existence of an Oseledets splitting for cocycles of non-invertible linear operators (such as transfer operators) over an invertible base. Using a constructive approach, we…
We study mean convergence of multiple ergodic averages, where the iterates arise from smooth functions of polynomial growth that belong to a Hardy field. Our results include all logarithmico-exponential functions of polynomial growth, such…
We study the mean length $\ell(k)$ of the shortest paths between a vertex of degree $k$ and other vertices in growing networks, where correlations are essential. In a number of deterministic scale-free networks we observe a power-law…