◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

B. Krause

32 papers hereh-index 10368 citations44 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author9
  • first author11
  • middle author7
  • last author5

Across the 32 of 32 papers where every author was matched, so the position is known.

fields
  • math.CA26
  • math.DS3
  • math.NT3
same name
  • B. Krause — 7 papers, h 8
  • B. Krause — 6 papers, h 10
  • B. Krause — 4 papers, h 3
  • B. Krause — 2 papers, h 4
  • B. Krause — 1 paper, h 56
  • B. Krause — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082024
most citedPolynomial Ergodic Averages Converge Rapidly: Variations on a Theorem of Bourgain

31 citations · 128 across the 29 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

math.CA2016

On Convergence of Oscillatory Ergodic Hilbert Transforms

Ben Krause, Michael Lacey, Máté Wierdl

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighte…

math.CA2016

Sparse Bounds for Random Discrete Carleson Theorems

Ben Krause, Michael T. Lacey

We study discrete random variants of the Carleson maximal operator. Intriguingly, these questions remain subtle and difficult, even in this setting. Let {Xm​} be an independent…

math.CA2016★ 2 cited

Sparse Bounds for Maximal Monomial Oscillatory Hilbert Transforms

Ben Krause, Michael T. Lacey

For each d≥2, the Hilbert transform with a polynomial oscillation as below satisfies a (1,r) sparse bound, for all r>1 $$ H _{ \ast } f (x) = \sup _{ε} \Bigl\lvert…

math.CA2016

A Discrete Carleson Theorem Along the Primes with a Restricted Supremum

Laura Cladek, Kevin Henriot, Ben Krause +2

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_Λf(n) := \sup_{λ\in Λ} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.