18 citations · 30 across the 11 of their papers we have counts for
13 papers
Targeted Modality Dropout for Real-Robot Manipulation Robust to Intermittent Vision Loss
Genki Shikada, Kazuki Osamura, Masaru Ide +2
Imitation learning policies that integrate multiple sensory modalities are prone to overreliance on a dominant modality, such as vision, during training, which can disrupt policy e…
Linnik's problem for multiplicative functions
Kaisa Matomäki, Joni Teräväinen
We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let be a multiplica…
Low-lying zeros in families of Maass form L-functions: an extended density theorem
Martin Čech, Lucile Devin, Daniel Fiorilli +2
We study the one-level density of low-lying zeros in the family of Maass form -functions of prime level tending to infinity. Generalizing the influential work of Iwaniec, Lu…
On optimality of mollifiers
Martin Čech, Kaisa Matomäki
Mollifiers are used in a variety of contexts, for instance to study the non-vanishing of -functions. In this paper, we study the general question of finding optimal mollifiers a…
Higher uniformity of arithmetic functions in short intervals II. Almost all intervals
Kaisa Matomäki, Maksym Radziwiłł, Xuancheng Shao +2
We study higher uniformity properties of the von Mangoldt function , the Möbius function , and the divisor functions on short intervals for almost all $x \in…
The sixth moment of Dirichlet L-functions at the central point
Vorrapan Chandee, Xiannan Li, Kaisa Matomäki +1
In 1970, Huxley obtained a sharp upper bound for the sixth moment of Dirichlet -functions at the central point, averaged over primitive characters modulo and all moduli…
A note on zero density results implying large value estimates for Dirichlet polynomials
Kaisa Matomäki, Joni Teräväinen
In this note we investigate connections between zero density estimates for the Riemann zeta function and large value estimates for Dirichlet polynomials. It is well known that esti…
Primes in arithmetic progressions and short intervals without -functions
Kaisa Matomäki, Jori Merikoski, Joni Teräväinen
We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new -function free proof of Linnik's problem of b…
Almost primes in almost all short intervals II
Kaisa Matomäki, Joni Teräväinen
We show that, for almost all , the interval contains products of exactly two primes. This improves on a work of the second author that had in plac…
Singmaster's conjecture in the interior of Pascal's triangle
Kaisa Matomäki, Maksym Radziwiłł, Xuancheng Shao +2
Singmaster's conjecture asserts that every natural number greater than one occurs at most a bounded number of times in Pascal's triangle; that is, for any natural number …
Almost primes in almost all very short intervals
Kaisa Matomäki
We show that as soon as with , almost all intervals with contain a product of at most two primes. In the proof we use…
Discorrelation between primes in short intervals and polynomial phases
Kaisa Matomäki, Xuancheng Shao
Let and . We obtain estimates for the following exponential sum over primes in short intervals: \[ \sum_{N < n \leq N+H} Λ(n) e(g(n)), \] where is a…
A note on the Liouville function in short intervals
Kaisa Matomäki, Maksym Radziwiłł
In this note we give a short and self-contained proof that, for any , for almost all . We also sketch a proof of a g…