Skip to content

DIRICHLET IMPROVABILITY FOR <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core=

Sep 2026 · Journal of the Australian Mathematical Society · pp. 1-24 · 0 citations · 29 references

Abstract

<jats:p> We study the problem of improving Dirichlet’s theorem of metric Diophantine approximation in the most general and multiplicative form in the <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>S</mml:mi> </mml:math> <jats:tex-math>$S$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S1446788726101669_inline2.png"> <jats:alt-text content-type="machine-generated">upper S</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> -adic setting. Our approach is based on translation of the problem related to Dirichlet improvability into a dynamical one, and the main technique of our proof is the <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>S</mml:mi> </mml:math> <jats:tex-math>$S$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S1446788726101669_inline3.png"> <jats:alt-text content-type="machine-generated">upper S</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> -adic version of quantitative nondivergence estimate due to Kleinbock and Tomanov. The main result of this paper can be regarded as the number field version of earlier works of Kleinbock and Weiss [‘Dirichlet’s theorem on Diophantine approximation and homogeneous flows’, <jats:italic>J. Mod. Dyn.</jats:italic> <jats:bold>4</jats:bold> (2008), 43–62], and of the second named author and Ghosh [‘Dirichlet’s theorem in function fields’, <jats:italic>Canad. J. Math.</jats:italic> <jats:bold>69</jats:bold> (3) (2017), 532–547]. Also, this in turn generalizes a result of Datta and Radhika [‘Singular Vectors on Manifolds over Number Fields’, <jats:italic>Monatsh. Math.</jats:italic> <jats:bold>200</jats:bold> (3) (2023), 545–568] on singularity of vectors to any number field <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>K</mml:mi> </mml:math> <jats:tex-math>$K$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S1446788726101669_inline4.png"> <jats:alt-text content-type="machine-generated">upper K</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>S</mml:mi> </mml:math> <jats:tex-math>$S$</jats:tex-math> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" content-type="simple" xlink:href="S1446788726101669_inline5.png"> <jats:alt-text content-type="machine-generated">upper S</jats:alt-text> </jats:inline-graphic> </jats:alternatives> </jats:inline-formula> containing all Archimedian places. </jats:p>

View source

Similar papers

Sep 2026

Computing volume of a polytope and integrals in high dimensions deterministically

<jats:p> We design a Correlation-Decay based quasi-polynomial time deterministic approximation algorithm for computing high dimensional integrals, applied in two settings. The first is computing the volume of an independent set polytope with restrictions. Randomized polynomial tim...

D. Gamarnik, Devin Smedira · 0 citations
Review Open access Sep 2026

The Book Review Column

Computational Intractability: A Guide to Algorithmic Lower Bounds (The MIT Press, forthcoming), by Erik Demaine (MIT), William Gasarch (University of Maryland), and Mohammad Hajiaghayi (University of Maryland), is a sequel to Garey & Johnson's classic book Computers and Intractability: A Guide to the Theory of NP-Compl...

Nicholas Q. Tran · 0 citations
Review Mar 2026

The Book Review Column

Games on Graphs: From Logic and Automata to Algorithms (Cambridge University Press, 2026), by Nathana¨el Fijalkow (Ed.) (University of Warsaw), is a collection of articles on infinite duration games on graphs, with applications in program verification and synthesis. Extremal Graph and Hypergraph Theory (Cambridge Unive...

Nicholas Q. Tran · 0 citations
Sep 2026

Price of answers: Perplexity AI and the content ecosystem dilemma

February 2026 was a testing time for Perplexity AI, Inc. as it prepared rebuttals to lawsuits from global media houses. The New York Times filed in the Southern District of New York, accusing Perplexity of taking paywalled content through retrieval-augmented generation and distributing millions of its articles unlawful...

A. K. Jha, Nikita Nadkarni · 0 citations
Sep 2026

What George Eliot Read: The George Eliot Archive ’s Reading Project and the Making of an Open-Access Digital Library

This article describes the construction and scholarly rationale of George Eliot’s Reading, an open-access digital library of 923 texts that Eliot documented reading over her lifetime, launched in 2025 as a subproject of the George Eliot Archive. The premise is straightforward: gather the primary-source evidence that...

Beverley Park Rilett, S. Guyer · 0 citations
#machine learning Preprint Sep 2026

GenLimitLib: A Formal Library for Language Generation in the Limit and AI-Assisted Mathematical Research

We present GenLimitLib, a source-aligned Lean 4 library for language generation in the limit. Introduced by Kleinberg and Mullainathan at NeurIPS 2024, language generation in the limit studies a theoretical question motivated by LLMs: how to generate valid new strings from observed examples. This young and rapidly evol...

Shuang Li, Peng Zhang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.