Search arXivSearch

arXiv · 2007.06821

Branches in the Bruhat-Tits tree for local fields of even characteristic

Abstract

We extend our previous computations for the relative positions of branches of quaternions to the case of local fields of even characteristic. This is a key step to understand the set of maximal orders containing a given suborder, which is useful, for instance, to compute relative spinor images, thus solving the selectivity problem. In our previous work, the results where given in terms of the quadratic defect. In the present context, we introduce and characterize an analogous concept for Artin-Schreier extensions. It is no longer useful to restrict our attention to orders generated by pure quaternions, as a separable quadratic extension contains no non-trivial element of null trace. In this work we state our result for an arbitrary pair of generators, for which we discuss a more general version of the Hilbert symbol in this context.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Arenas-Carmona, Claudio Bravo. 2020-07-14. Branches in the Bruhat-Tits tree for local fields of even characteristic. https://arxiv.org/abs/2007.06821

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