Enregistré dans:
Détails bibliographiques
Auteur principal: Morimoto, Masaru
Format: Recurso digital
Langue:anglais
Publié: Zenodo 2026
Sujets:
Accès en ligne:https://doi.org/10.5281/zenodo.19392006
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866901714251022336
author Morimoto, Masaru
author_facet Morimoto, Masaru
contents <p>This paper develops a unified algebraic framework for hierarchical complex numbers, a discrete multi-layered structure in which each digit carries an independent sign bit.<br>The central operation is the digit-wise sign inversion, whose behavior is fully determined by two XOR-based mechanisms: local inversion (Target1) and inter-digit<br>propagation (Target2). We derive a closed general formula<br>\[<br>t(i,j)<br>=<br>\bigoplus_{k=0}^{n} (\bar{i_k} j_k)<br>\;\oplus\;<br>\bigoplus_{k=1}^{n} ((i_k \oplus j_k) j_{k-1}),<br>\]<br>which expresses the inversion parity purely in terms of bit agreement and disagreement.</p> <p>Using this formula, we show that the associated matrices possess a highly constrained and self-contained eigenvalue structure: all eigenvalues are $\pm 1$, eigenvectors<br>correspond directly to bit patterns, and the value component is governed by the XOR shift $a_{i\oplus j}$. These properties yield a fully closed discrete eigenvalue algebra with intrinsic self-similarity across digit layers.</p> <p>The paper also examines the impossibility of collapsing the two-series structure (Target1 and Target2) into a single homogeneous series, demonstrating that digit $k=0$ forms an essential singular layer that prevents such unification. Finally, we outline preliminary considerations for defining multiplication on hierarchical complex numbers, highlighting the inherent asymmetry introduced by Target2 and the resulting possibility of non-commutative behavior.</p>
format Recurso digital
id zenodo_https___doi_org_10_5281_zenodo_19392006
institution Zenodo
language eng
publishDate 2026
publisher Zenodo
record_format zenodo
spellingShingle Noncommutative Infinite Hierarchy
Morimoto, Masaru
XOR structure
hierarchical inversion
Target1 / Target2 conditions
digit inheritance
blockwise recursion
propagation rules
sign inversion parity
powers of two
rational-valued matrices
orthogonality
closure under multiplication
self-similarity
binary representation
<p>This paper develops a unified algebraic framework for hierarchical complex numbers, a discrete multi-layered structure in which each digit carries an independent sign bit.<br>The central operation is the digit-wise sign inversion, whose behavior is fully determined by two XOR-based mechanisms: local inversion (Target1) and inter-digit<br>propagation (Target2). We derive a closed general formula<br>\[<br>t(i,j)<br>=<br>\bigoplus_{k=0}^{n} (\bar{i_k} j_k)<br>\;\oplus\;<br>\bigoplus_{k=1}^{n} ((i_k \oplus j_k) j_{k-1}),<br>\]<br>which expresses the inversion parity purely in terms of bit agreement and disagreement.</p> <p>Using this formula, we show that the associated matrices possess a highly constrained and self-contained eigenvalue structure: all eigenvalues are $\pm 1$, eigenvectors<br>correspond directly to bit patterns, and the value component is governed by the XOR shift $a_{i\oplus j}$. These properties yield a fully closed discrete eigenvalue algebra with intrinsic self-similarity across digit layers.</p> <p>The paper also examines the impossibility of collapsing the two-series structure (Target1 and Target2) into a single homogeneous series, demonstrating that digit $k=0$ forms an essential singular layer that prevents such unification. Finally, we outline preliminary considerations for defining multiplication on hierarchical complex numbers, highlighting the inherent asymmetry introduced by Target2 and the resulting possibility of non-commutative behavior.</p>
title Noncommutative Infinite Hierarchy
topic XOR structure
hierarchical inversion
Target1 / Target2 conditions
digit inheritance
blockwise recursion
propagation rules
sign inversion parity
powers of two
rational-valued matrices
orthogonality
closure under multiplication
self-similarity
binary representation
url https://doi.org/10.5281/zenodo.19392006