 |
 |
Algebra |
|
Authors: Theophilus Agama
An addition chain of length $h$ that leads to a number $n$ is a sequence of positive integers $s_0=1,s_1=2,ldots,s_h=n$ such that $s_i=s_j+s_k$~($i>jgeq k$) for each $1leq ileq h$. We introduce a matrix-theoretic framework for studying the properties of arbitrary addition chains that lead to a target integer $ngeq 2$ by associating each chain and the sequence of dominant and lower weight summands that calculate each term in the chain an adjacency matrix that encodes the internal geometry. In this linear-algebraic and matrix theoretic framework, we investigate how rank, rank profiles, singular values, eigenvalues, matrix norms, predecessor depths, and track-interaction terms encode the combinatorial and arithmetic structure of addition chains.
Comments: 23 Pages. (Note by viXra Admin: Please submit article written with AI assistance to ai.viXra.org)
Download: PDF
[v1] 2026-09-17 23:02:29
Unique-IP document downloads: 0 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|