Search arXivSearch

arXiv · 2104.06228

Geometry of the $p$-adic special orthogonal group $SO(3)_p$

Abstract

We derive explicitly the structural properties of the $p$-adic special orthogonal groups in dimension three, for all primes $p$, and, along the way, the two-dimensional case. In particular, starting from the unique definite quadratic form in three dimensions (up to linear equivalence and rescaling), we show that every element of $SO(3)_p$ is a rotation around an axis. An important part of the analyis is the classification of all definite forms in two dimensions, yielding a description of the rotation subgroups around any fixed axis, which all turn out to be abelian and parametrised naturally by the projective line. Furthermore, we find that for odd primes $p$, the entire group $SO(3)_p$ admits a representation in terms of Cardano angles of rotations around the reference axes, in close analogy to the real orthogonal case. However, this works only for certain orderings of the product of rotations around the coordinate axes, depending on the prime; furthermore, there is no general Euler angle decomposition. For $p=2$, no Euler or Cardano decomposition exists.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sara Di Martino, Stefano Mancini, Michele Pigliapochi, Ilaria Svampa, Andreas Winter. 2023-01-26. Geometry of the $p$-adic special orthogonal group $SO(3)_p$. https://doi.org/10.1134/s1995080223060355

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