Calculs effectifs de congruences entre caract\`eres de Dirichlet
Julien Puydt (IF)

TL;DR
This paper develops methods to compute explicit congruences between Dirichlet characters and demonstrates their application through concrete examples, enhancing computational techniques in number theory.
Contribution
It introduces effective algorithms for finding congruences between Dirichlet characters and provides practical examples of their implementation.
Findings
Algorithms for explicit congruences between Dirichlet characters
Effective computational methods demonstrated with examples
Enhanced tools for research in algebraic number theory
Abstract
This article aims to find explicit congruences between Dirichlet characters and gives various results on how to find some effectively on a computer. It ends with concrete examples putting those ideas in application.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · semigroups and automata theory · Finite Group Theory Research
