Search arXivSearch

arXiv · 1004.0224

On some algebraic properties of CM-types of CM-fields and their reflexes

Abstract

The purpose of this paper is to show that the reflex fields of a given CM-field is equipped with a certain combinatorial structure that has not been exploited yet. We prove three theorems using this structure; the first theorem is on the abelian extension generated by the moduli and the b-torsion points of abelian varieties of CM-type, for any natural number b. It is a generalization of the result by Wei on the abelian extension obtained by the moduli and all the torsion points. The second theorem gives a character identity of the Artin L-function of a CM-field K and the reflex fields of K. The character identity pointed out by Shimura follows from this. The third theorem states that some Pfister form is isomorphic to the orthogonal sum of Tr(\bar{a}a) (\bar{a} is the complex conjugation of a) defined on a direct sum of reflex fields. This result suggests that the theory of complex multiplication on abelian varieties has a relationship with the multiplicative forms in higher dimension.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ryoko Oishi-Tomiyasu. 2010-04-01. On some algebraic properties of CM-types of CM-fields and their reflexes. https://doi.org/10.1016/j.jnt.2010.03.021

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