Computing groups of Hecke characters
RESEARCH IN NUMBER THEORY(2022)
摘要
We describe algorithms to represent and compute groups of Hecke characters. We make use of an idèlic point of view and obtain the whole family of such characters, including transcendental ones. We also show how to isolate the algebraic characters, which are of particular interest in number theory. This work has been implemented in Pari/GP, and we illustrate our work with a variety of explicit examples using our implementation.
更多查看译文
关键词
Hecke characters, Algorithms, Maximum CM subfield, Infinity types, Pari, GP
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要