AI
Alex Iosevich
math.COmath.CAcs.ITmath.ITmath.NTmath.PRstat.AP
On Valency
published · living versionsW_uqdn93v7·v1 · currentpublished
Bourgain's Lambda(p) selection theorem: a greedy proof with polynomial failure bounds
with Will Burstein, Ben Krause
1 version
Preprints & journals
8 papers in the corpus · 2018–2026Spectral synthesis with the complexity parameter in 2609.25404v1 · Alex Iosevich, Zhihe Li, Ke Yu2026 · 0 citationsarXiv
Edge complexity of weighted graphs: involutory symmetries and NP-hardness2609.23842v1 · Vishal Gupta, Alex Iosevich2026 · 0 citationsarXiv
Bourgain's Lambda(p) selection theorem: a greedy proof with polynomial failure bounds2609.12566v1 · Will Burstein, Alex Iosevich, Ben Krause2026 · 0 citationsarXivon Valency
Edge complexity of graphs2607.15598v1 · Vishal Gupta, Alex Iosevich, Joshua Iosevich et al.2026 · 0 citationsarXiv
Large values in time series and additive combinatorics2604.21292v1 · Alex Iosevich, Vishal Gupta2026 · 0 citationsarXiv
Interpolation of point configurations in the discrete plane2408.07010v2 · Esen Aksoy, Alex Iosevich, Brian McDonald2024 · 0 citationsarXiv
VC-Dimension and Distance Chains in 2210.03058v2 · Ruben Ascoli, Livia Betti, Justin Cheigh et al.2022 · 0 citationsarXiv
On the quotient set of the distance set1802.08297v1 · A. Iosevich, D. Koh, H. Parshall2018 · 10 citationsMoscow J. Comb. Number Th. 8 (2019) 103-115
Career total: 16 works. 8 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.