Weak convergence of the periodic multiplicative Selmer algorithm

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Kops, J. Christopher
Format: Preprint
Publié: 2008
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915621793431552
author Kops, J. Christopher
author_facet Kops, J. Christopher
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_0812_4266
institution arXiv
publishDate 2008
record_format arxiv
spellingShingle Weak convergence of the periodic multiplicative Selmer algorithm
Kops, J. Christopher
Number Theory
11A55, 11J70, 11K50
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.
title Weak convergence of the periodic multiplicative Selmer algorithm
topic Number Theory
11A55, 11J70, 11K50
url https://arxiv.org/abs/0812.4266