PreprintCC BY-ND 4.0HAL
ON THE ZEROS OF THE RAMIFICATION POLYNOMIAL
Abstract
The ramification of an integer n in pmod m is an additive encoding in the language of modular arithmetic. Formally, an integer n≡ apmod m is said to ramify in pmod m for fixed m≥ 2 when there exists some integer r with $1
Related
- Convergence of a Family of Accelerated Schröder-like Methods for the Simultaneous Extraction of Simple and Multiple Polynomial Zeros
- k-Lucas Annulus for Polynomial Zeros
- Zeros of the independence polynomial on recursive sequences of graphs
- A NOTE ON THE RAMIFICATION CHARACTER, RAMIFICATION POLYNOMIALS AND ASSOCIATED DIRICHLET L-FUNCTION
- On finiteness properties of the unramified Iwasawa module of a ℤp-extension with restricted ramification
BibTeX
@misc{agama2026zeros,
title = {{ON THE ZEROS OF THE RAMIFICATION POLYNOMIAL}},
author = {Theophilus Agama},
howpublished = {HAL},
year = {2026},
month = nov,
url = {https://hal.science/hal-05847019v1},
note = {CC BY-ND 4.0},
}
RIS
TY - UNPB
TI - ON THE ZEROS OF THE RAMIFICATION POLYNOMIAL
AU - Theophilus Agama
PY - 2026
DA - 2026/11/01
PB - HAL
UR - https://hal.science/hal-05847019v1
AB - The ramification of an integer n in pmod m is an additive encoding in the language of modular arithmetic. Formally, an integer n≡ apmod m is said to ramify in pmod m for fixed m≥ 2 when there exists some integer r with $1
ER -