English
Related papers

Related papers: Almost-Everywhere Convergence and Polynomials

200 papers

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause

Let $\Gamma$ be a subset of $\{0,1,2,...\}$. We show that if $\Gamma$ has `gaps' then the completeness and frame properties of the system $\{t^ke^{2\pi i nt}: n\in\mathbb{Z},k\in\Gamma\}$ differ from those of the classical exponential…

Classical Analysis and ODEs · Mathematics 2023-04-11 Aleksei Kulikov , Alexander Ulanovskii , Ilya Zlotnikov

Let $G=SL_2(\mathbb R)^d$ and $\Gamma=\Gamma_0^d$ with $\Gamma_0$ a lattice in $SL_2(\mathbb R)$. Let $S$ be any "curved" submanifold of small codimension of a maximal horospherical subgroup of $G$ relative to an $\mathbb R$-diagonalizable…

Dynamical Systems · Mathematics 2020-07-08 Adrián Ubis

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

Combinatorics · Mathematics 2026-02-10 Édouard Bonnet , Julien Duron , John Sylvester , Viktor Zamaraev , Maksim Zhukovskii

In this paper we investigate problems on almost everywhere convergence of subsequences of Riemann sums \md0 R_nf(x)=\frac{1}{n}\sum_{k=0}^{n-1}f\bigg(x+\frac{k}{n}\bigg),\quad x\in \ZT. \emd We establish a relevant connection between…

Classical Analysis and ODEs · Mathematics 2016-12-28 G. A. Karagulyan

In this paper we show how polynomial walks can be used to establish a twisted recurrence for sets of positive density in $\mathbb{Z}^d$. In particular, we prove that if $\Gamma \leq \operatorname{GL}_d(\mathbb{Z})$ is finitely generated by…

Dynamical Systems · Mathematics 2017-06-27 Kamil Bulinski , Alexander Fish

We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…

Probability · Mathematics 2024-12-17 T. Bloom , D. Dauvergne , N. Levenberg

We derive the necessary and sufficient condition for almost sure convergence of the sequence of measurable functions, and consider some applications in the theory of Fourier series and in the theory of random fields.

Functional Analysis · Mathematics 2015-07-16 E. Ostrovsky , L. Sirota

We prove the $\Gamma$-convergence of sequences of differentially constrained, random integral functionals of the form \begin{equation*} \int_{U} f\Big(\omega, x/\varepsilon, \mathbb{A} u\Big) \mathrm{d} x \end{equation*} for the class of…

Analysis of PDEs · Mathematics 2023-08-08 Piotr Wozniak

We consider integral area-minimizing $2$-dimensional currents $T$ in $U\subset \mathbb R^{2+n}$ with $\partial T = Q[\![\Gamma]\!]$, where $Q\in \mathbb N \setminus \{0\}$ and $\Gamma$ is sufficiently smooth. We prove that, if $q\in \Gamma$…

Analysis of PDEs · Mathematics 2021-11-05 Camillo De Lellis , Stefano Nardulli , Simone Steinbrüchel

In this article, we obtain a super-exponential rate of convergence in total variation between the traces of the first $m$ powers of an $n\times n$ random unitary matrices and a $2m$-dimensional Gaussian random variable. This generalizes…

Probability · Mathematics 2020-02-06 Kurt Johansson , Gaultier Lambert

We study the continuity properties of trajectories for some random series of functions $\sum a\_kf(\alpha X\_k(\omega))$ where $a\_k$ is a complex sequence, $X\_k$ a sequence of real independent random variables, $f$ is a real valued…

Probability · Mathematics 2016-08-16 Frédéric Paccaut , Dominique Schneider

Let G be a connected semisimple Lie group with finite center and without compact factors, P a minimal parabolic subgroup of G, and \Gamma a lattice in G. We prove that every \Gamma-orbits in the Furstenberg boundary G/P is equidistributed…

Dynamical Systems · Mathematics 2007-05-23 A. Gorodnik , F. Maucourant

We obtain a compactness result for $\Gamma$-convergence of integral functionals defined on $\mathcal{A}$-free vector fields. This is used to study homogenization problems for these functionals without periodicity assumptions. More…

Analysis of PDEs · Mathematics 2026-03-10 Gianni Dal Maso , Rita Ferreira , Irene Fonseca

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

Number Theory · Mathematics 2020-11-25 James Maynard

Following an approach presented by N. Frantzikinakis, we prove that any multiple correlation sequence, defined by invertible measure preserving actions of commuting transformations with integer part polynomial iterates, is the sum of a…

Dynamical Systems · Mathematics 2016-09-28 Andreas Koutsogiannis

We establish convergence in norm and pointwise almost everywhere for the non-conventional (in the sense of Furstenberg) bilinear polynomial ergodic averages \[ A_N(f,g)(x) := \frac{1}{N} \sum_{n =1}^N f(T^nx) g(T^{P(n)}x)\] as $N \to…

Dynamical Systems · Mathematics 2022-01-24 Ben Krause , Mariusz Mirek , Terence Tao

The $k$-means method is an iterative clustering algorithm which associates each observation with one of $k$ clusters. It traditionally employs cluster centers in the same space as the observed data. By relaxing this requirement, it is…

Statistics Theory · Mathematics 2015-04-06 Matthew Thorpe , Florian Theil , Adam M. Johansen , Neil Cade

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang
‹ Prev 1 3 4 5 6 7 10 Next ›