Residue Class Degree and Ramification Index

Algebra ◽  
2007 ◽  
pp. 65-74
1972 ◽  
Vol 46 ◽  
pp. 97-109
Author(s):  
Susan Williamson

Let k denote the quotient field of a complete discrete rank one valuation ring R of unequal characteristic and let p denote the characteristic of R̅; assume that R contains a primitive pth root of unity, so that the absolute ramification index e of R is a multiple of p — 1, and each Gallois extension K ⊃ k of degree p may be obtained by the adjunction of a pth root.


2021 ◽  
Vol 71 (1) ◽  
pp. 251-263
Author(s):  
Guillermo Mantilla-Soler

Abstract Let L be a number field. For a given prime p, we define integers α p L $ \alpha_{p}^{L} $ and β p L $ \beta_{p}^{L} $ with some interesting arithmetic properties. For instance, β p L $ \beta_{p}^{L} $ is equal to 1 whenever p does not ramify in L and α p L $ \alpha_{p}^{L} $ is divisible by p whenever p is wildly ramified in L. The aforementioned properties, although interesting, follow easily from definitions; however a more interesting application of these invariants is the fact that they completely characterize the Dedekind zeta function of L. Moreover, if the residue class mod p of α p L $ \alpha_{p}^{L} $ is not zero for all p then such residues determine the genus of the integral trace.


2002 ◽  
Vol 12 (2) ◽  
Author(s):  
M.V. Larin

AbstractWe give a complete description of the polynomials f(x) with integer coefficients such that the period of the recurring sequence u


1988 ◽  
Vol 31 (3) ◽  
pp. 469-474
Author(s):  
Robert W. van der Waall

Let K be a field, G a finite group, V a (right) KG-module. If H is a subgroup of G, then, restricting the action of G on V to H, V is also a KH-module. Notation: VH.Suppose N is a normal subgroup of G. The KN-module VN is not irreducible in general, even when V is irreducible as KG-module. A part of the well-known theorem of A. H. Clifford [1, V.17.3] yields the following.


Author(s):  
A. Haddley ◽  
R. Nair

AbstractLet $${\mathcal {M}}$$ M denote the maximal ideal of the ring of integers of a non-Archimedean field K with residue class field k whose invertible elements, we denote $$k^{\times }$$ k × , and a uniformizer we denote $$\pi $$ π . In this paper, we consider the map $$T_{v}: {\mathcal {M}} \rightarrow {\mathcal {M}}$$ T v : M → M defined by $$\begin{aligned} T_v(x) = \frac{\pi ^{v(x)}}{x} - b(x), \end{aligned}$$ T v ( x ) = π v ( x ) x - b ( x ) , where b(x) denotes the equivalence class to which $$\frac{\pi ^{v(x)}}{x}$$ π v ( x ) x belongs in $$k^{\times }$$ k × . We show that $$T_v$$ T v preserves Haar measure $$\mu $$ μ on the compact abelian topological group $${\mathcal {M}}$$ M . Let $${\mathcal {B}}$$ B denote the Haar $$\sigma $$ σ -algebra on $${\mathcal {M}}$$ M . We show the natural extension of the dynamical system $$({\mathcal {M}}, {\mathcal {B}}, \mu , T_v)$$ ( M , B , μ , T v ) is Bernoulli and has entropy $$\frac{\#( k)}{\#( k^{\times })}\log (\#( k))$$ # ( k ) # ( k × ) log ( # ( k ) ) . The first of these two properties is used to study the average behaviour of the convergents arising from $$T_v$$ T v . Here for a finite set A its cardinality has been denoted by $$\# (A)$$ # ( A ) . In the case $$K = {\mathbb {Q}}_p$$ K = Q p , i.e. the field of p-adic numbers, the map $$T_v$$ T v reduces to the well-studied continued fraction map due to Schneider.


2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan ◽  
Solly Aryza

Steganography is related to the addition of information to a given medium (referred to as cover media) without making visible changes to it. Most of the proposed steganography techniques cannot be applied to store large-scale data. In the new technique for RGB image steganography, color intensity (R-G-B) is used to determine the number of bits you want to store in each pixel. Meanwhile, to improve the security of stored confidential files, cryptographic methods will be applied. The Paillier cryptosystem invented by Pascal Paillier in 1999 is a probabilistic asymmetric algorithm for public key cryptography. The security of the Paillier algorithm depends on the problem of calculating the n-residue class that is believed to be very difficult to compute. This problem is known as the Composite Residuosity (CR) and is the basis of this Paillier cryptosystem. The software created can save secret files into a digital image into a stego image. The secret file can be extracted out through the extraction process.


2017 ◽  
Vol 174 ◽  
pp. 14-25 ◽  
Author(s):  
Xin Zhang ◽  
Chun-Gang Ji

Sign in / Sign up

Export Citation Format

Share Document