Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 173 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 37 tok/s Pro
GPT-5 High 38 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 442 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Quantitative Matrix-Driven Diophantine approximation on $M_0$-sets (2504.21555v1)

Published 30 Apr 2025 in math.NT

Abstract: Let $E\subset [0,1){d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|){-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices $\mathcal{A}=(A_n){n\in\N}$ such that the minimal singular values of $A{n+1}A_{n}{-1}$ are uniformly bounded below by $K>1$. We prove a quantitative Schmidt-type counting theorem under the following constraints: (1) the points of interest are restricted to $E$; (2) the denominators of the ``shifted'' rational approximations are drawn exclusively from $\mathcal{A}$. Our result extends the work of Pollington, Velani, Zafeiropoulos, and Zorin (2022) to the matrix setting, advancing the study of Diophantine approximation on fractals. Moreover, it strengthens the equidistribution property of the sequence $(A_n{\bf x})_{n\in\N}$ for $\mu$-almost every ${\bf x}\in E.$ Applications include the normality of vectors and shrinking target problems on fractal sets.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.