Weak convergence of the periodic multiplicative Selmer algorithm
Number Theory
2025-11-18 v1
Abstract
In order to prove weak convergence of the periodic multiplicative Selmer algorithm we ensure that the periodicity matrix is positive and establish a relation between its entries and eigenvalues. Since we can imply that the limit of these relations exist, we arrive at the desired result.
Keywords
Cite
@article{arxiv.0812.4266,
title = {Weak convergence of the periodic multiplicative Selmer algorithm},
author = {J. Christopher Kops},
journal= {arXiv preprint arXiv:0812.4266},
year = {2025}
}
Comments
22 pages, 1 figure