2011
DOI: 10.1201/b10493
|View full text |Cite
|
Sign up to set email alerts
|

Algebraic Number Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
20
0
2

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 74 publications
(26 citation statements)
references
References 0 publications
1
20
0
2
Order By: Relevance
“…Then (cf. [7]) either p is a prime ideal, or p = P 1 P 2 , where P 1 , P 2 are prime ideals (and not necessarily different). The fundamental theorem of arithmetic yields k = qj is prime q βj j p l =P l,1 P l,2 p α l l so we get the unique factorization k = q j βj P α l l,1 P α l l,2 .…”
Section: A1 Integral Points In Spherical Stripsmentioning
confidence: 99%
“…Then (cf. [7]) either p is a prime ideal, or p = P 1 P 2 , where P 1 , P 2 are prime ideals (and not necessarily different). The fundamental theorem of arithmetic yields k = qj is prime q βj j p l =P l,1 P l,2 p α l l so we get the unique factorization k = q j βj P α l l,1 P α l l,2 .…”
Section: A1 Integral Points In Spherical Stripsmentioning
confidence: 99%
“…is a power of ℓ times a unit, it follows that ∆ L/Q is a power of 5 times a power of ℓ. If L 1 and L 2 are two extensions of Q ramified only at primes in a set S, then L 1 , L 2 /Q is ramified only at primes in S (see Theorem 4.67 of [12]). It follows from this that the splitting field of x ℓ k − 3+ √ 5 2 is ramified only at 5 and ℓ and hence K ℓ k /Q is too.…”
Section: Galois Theorymentioning
confidence: 98%
“…We begin by reviewing some algebraic number theory. For an introduction to these ideas, see [12]. If L/K is a Galois extension of number fields and α ∈ L, define the norm of α to be N L/K (α) = σ∈Gal(L/K) σ(α).…”
Section: Introductionmentioning
confidence: 99%
“…and T qR : � K R /qR. We refer the reader to [20] and [11,[21][22][23][24] for the thorough introduction to algebraic number theory. Let χ be a distribution on K R .…”
Section: Module-lwe Problem and Compression Algorithmmentioning
confidence: 99%