Anastasios Fragkos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anastasios Fragkos has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Michael T. Lacey
School of Mathematics, Georgia Institute of Technology, Atlanta, USA
3 shared publications - Alex Burgin
School of Mathematics, Georgia Institute of Technology, Atlanta, USA
2 shared publications - Dario Mena
Georgia Institute of Technology
2 shared publications - Maria Carmen Reguera2 shared publications
- A. Walton Green
Department of Mathematics, Washington University in Saint Louis, Saint Louis, USA
1 shared publication - Ben Krause
Department of Mathematics, University of Bristol, Bristol, UK
1 shared publication
Latest Publications
- 28 April 2026
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 313 (1) , 8
Fractionally modulated discrete Carleson’s theorem and pointwise ergodic theorems along certain curves
- 28 April 2026
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 313 (1) , 8
Fractionally modulated discrete Carleson’s theorem and pointwise ergodic theorems along certain curves
- Top Cited Papers
- 24 February 2026
- Published by Springer Nature in Journal d'Analyse Mathématique
- p. 1-26
Multilinear Wavelet Compact T(1) Theorem
- 24 February 2026
- Published by Springer Nature in Journal d'Analyse Mathématique
- p. 1-26
Top Cited PapersMultilinear Wavelet Compact T(1) Theorem
- Open Access
Integer Cantor Sets: Arithmetic Combinatorial Properties
Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective property with power savings (b) characterize uniform distribution, (c) establish polynomial mean ergodic theorems and (d) study metric pair correlation of Cantor sets.
Open AccessInteger Cantor Sets: Arithmetic Combinatorial Properties
Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective property with power savings (b) characterize uniform distribution, (c) establish polynomial mean ergodic theorems and (d) study metric pair correlation of Cantor sets.
- Open Access
Szemerédi's Theorem Along Cantor Sets of Integers
Let $\mathcal C= \{k_1<k_2 < \cdots\}$ be Cantor set of integers, that is a set of integers with restricted digits modulo a base $b$, and suppose $0$ is one of the restricted digits. We show that $$ \liminf_N \Expectation_{n\in [N]} m(A\cap T^{-k_n} A \cap \cdots \cap T^{-\ell k_n} A )>0. $$ This is an extension of the IP Ergodic Theorem of Furstenberg and Katznelson, and a partial extension of recent work of Kra and Shalom. In particular, this implies that for any subset of integers $A$ of positive upper Banach density, there is a set $B$ of integers $n$ of positive lower Banach density such that $A$ contains an $\ell+1$ term progression, with step size $k_n$, where $n\in B$. This is a complement to recent results of Kra and Shalom, for IP Sets of integers, and Burgin, concerning Sarkozy's Theorem for Primes with restricted digits.Open AccessSzemerédi's Theorem Along Cantor Sets of Integers
Let $\mathcal C= \{k_1<k_2 < \cdots\}$ be Cantor set of integers, that is a set of integers with restricted digits modulo a base $b$, and suppose $0$ is one of the restricted digits. We show that $$ \liminf_N \Expectation_{n\in [N]} m(A\cap T^{-k_n} A \cap \cdots \cap T^{-\ell k_n} A )>0. $$ This is an extension of the IP Ergodic Theorem of Furstenberg and Katznelson, and a partial extension of recent work of Kra and Shalom. In particular, this implies that for any subset of integers $A$ of positive upper Banach density, there is a set $B$ of integers $n$ of positive lower Banach density such that $A$ contains an $\ell+1$ term progression, with step size $k_n$, where $n\in B$. This is a complement to recent results of Kra and Shalom, for IP Sets of integers, and Burgin, concerning Sarkozy's Theorem for Primes with restricted digits. - Open Access
The Wiener Wintner and Return Times Theorem Along the Primes
We prove the following Return Times Theorem along the sequence of prime times, the first extension of the Return Times Theorem to arithmetic sequences: For every probability space, $(Ω,ν)$, equipped with a measure-preserving transformation, $T \colon Ω\to Ω$, and every $f \in L^\infty(Ω)$, there exists a set of full probability, $Ω_f \subset Ω$ with $ν(Ω_f) =1$, so that for all $ω\in Ω_f$, for any other probability space $(X,μ)$, equipped with a measure-preserving transformation $S : X \to X$, for any $g \in L^{\infty}(X)$, \begin{align} \frac{1}{N} \sum_{n \leq N} f(T^{p_n} ω) g(S^{p_n} \cdot) \end{align} converges $μ$-almost surely; above, $\{ 2=p_1 < p_2 < \dots \}$ are an enumeration of the primes. The Wiener-Wintner theorem along the primes is an immediate corollary. Our proof lives at the interface of classical Fourier analysis, combinatorial number theory, higher order Fourier analysis, and pointwise ergodic theory, with $U^3$ theory playing an important role; our $U^3$-estimates for \emph{Heath-Brown} models of the von Mangoldt function may be of independent interest.Open AccessThe Wiener Wintner and Return Times Theorem Along the Primes
We prove the following Return Times Theorem along the sequence of prime times, the first extension of the Return Times Theorem to arithmetic sequences: For every probability space, $(Ω,ν)$, equipped with a measure-preserving transformation, $T \colon Ω\to Ω$, and every $f \in L^\infty(Ω)$, there exists a set of full probability, $Ω_f \subset Ω$ with $ν(Ω_f) =1$, so that for all $ω\in Ω_f$, for any other probability space $(X,μ)$, equipped with a measure-preserving transformation $S : X \to X$, for any $g \in L^{\infty}(X)$, \begin{align} \frac{1}{N} \sum_{n \leq N} f(T^{p_n} ω) g(S^{p_n} \cdot) \end{align} converges $μ$-almost surely; above, $\{ 2=p_1 < p_2 < \dots \}$ are an enumeration of the primes. The Wiener-Wintner theorem along the primes is an immediate corollary. Our proof lives at the interface of classical Fourier analysis, combinatorial number theory, higher order Fourier analysis, and pointwise ergodic theory, with $U^3$ theory playing an important role; our $U^3$-estimates for \emph{Heath-Brown} models of the von Mangoldt function may be of independent interest. - 6 November 2024
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 378 (3) , 1551-1592
The weak-type Carleson theorem via wave packet estimates
We prove that the weak- L p L^{p} norms, and in fact the sparse ( p , 1 ) (p,1) -norms, of the Carleson maximal partial Fourier sum operator are ≲ ( p − 1 ) − 1 \lesssim (p-1)^{-1} as p → 1 + p\to 1^+ . This is an improvement on the Carleson-Hunt theorem, where the same upper bound on the growth order is obtained for the restricted weak- L p L^p type norm, and which was the strongest quantitative bound prior to our result. Furthermore, our sparse ( p , 1 ) (p,1) -norms bound imply new and stronger results at the endpoint p = 1 p=1 . In particular, we obtain that the Fourier series of functions from the weighted Arias de Reyna space Q A ∞ ( w ) \mathrm {QA}_{\infty }(w) , which contains the weighted Antonov space L log L log log log L ( T ; w ) L\log L\log \log \log L(\mathbb T; w) , converge almost everywhere whenever w ∈ A 1 w\in A_1 . This is an extension of the results of Antonov [Proceedings of the XXWorkshop on Function Theory (Moscow, 1995), 1996, pp. 187–196] and Arias De Reyna, where w w must be Lebesgue measure. The backbone of our treatment is a new, sharply quantified near- L 1 L^1 Carleson embedding theorem for the modulation-invariant wave packet transform. The proof of the Carleson embedding relies on a newly developed smooth multi-frequency decomposition which, near the endpoint p = 1 p=1 , outperforms the abstract Hilbert space approach of past works, including the seminal one by Nazarov, Oberlin and Thiele [Math. Res. Lett. 17 (2010), pp. 529–545]. As a further example of application, we obtain a quantified version of the family of sparse bounds for the bilinear Hilbert transforms due to Culiuc, Ou and the first author.
- 6 November 2024
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 378 (3) , 1551-1592
The weak-type Carleson theorem via wave packet estimates
We prove that the weak- L p L^{p} norms, and in fact the sparse ( p , 1 ) (p,1) -norms, of the Carleson maximal partial Fourier sum operator are ≲ ( p − 1 ) − 1 \lesssim (p-1)^{-1} as p → 1 + p\to 1^+ . This is an improvement on the Carleson-Hunt theorem, where the same upper bound on the growth order is obtained for the restricted weak- L p L^p type norm, and which was the strongest quantitative bound prior to our result. Furthermore, our sparse ( p , 1 ) (p,1) -norms bound imply new and stronger results at the endpoint p = 1 p=1 . In particular, we obtain that the Fourier series of functions from the weighted Arias de Reyna space Q A ∞ ( w ) \mathrm {QA}_{\infty }(w) , which contains the weighted Antonov space L log L log log log L ( T ; w ) L\log L\log \log \log L(\mathbb T; w) , converge almost everywhere whenever w ∈ A 1 w\in A_1 . This is an extension of the results of Antonov [Proceedings of the XXWorkshop on Function Theory (Moscow, 1995), 1996, pp. 187–196] and Arias De Reyna, where w w must be Lebesgue measure. The backbone of our treatment is a new, sharply quantified near- L 1 L^1 Carleson embedding theorem for the modulation-invariant wave packet transform. The proof of the Carleson embedding relies on a newly developed smooth multi-frequency decomposition which, near the endpoint p = 1 p=1 , outperforms the abstract Hilbert space approach of past works, including the seminal one by Nazarov, Oberlin and Thiele [Math. Res. Lett. 17 (2010), pp. 529–545]. As a further example of application, we obtain a quantified version of the family of sparse bounds for the bilinear Hilbert transforms due to Culiuc, Ou and the first author.