Search arXivSearch

arXiv · 2412.14709

Minimal rank of primitively $n$-universal integral quadratic forms over local rings

Abstract

Let $F$ be a local field and let $R$ be its ring of integers. For a positive integer $n$, an integral quadratic form defined over $R$ is called primitively $n$-universal if it primitively represents all quadratic forms of rank $n$. It was proved in arXiv:2005.11268 that the minimal rank of primitively $1$-universal quadratic forms over the $p$-adic integer ring $\mathbb{Z}_p$ is $2$ if $p$ is odd, and $3$ otherwise. In this article, we completely determine the minimal rank of primitively $n$-universal quadratic forms over $R$ for any positive integer $n$ and any local ring $R$ such that $2$ is a unit or a prime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Byeong-Kweon Oh, Jongheun Yoon. 2024-12-19. Minimal rank of primitively $n$-universal integral quadratic forms over local rings. https://arxiv.org/abs/2412.14709

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT