Combinatorics and Graph Theory

Quasiperiodic Enumeration from Primitively Equidistant Square Triplet

Authors: Fian Qnoz
Comments: 13 Pages. 6 Figures.

Any prime number congruent to 1 (mod 4) can be factored into Gaussian integers. Such Gaussian factor—when raised to even powers—could be treated as a seed for enumerating further equidistant square triplets, while simultaneously being the mean of such triplet. Such array could be reshaped into 2D array of pixels with arbitrary ratio, exhibiting quasiperiodicity as they encode the Abs—Arg relation of their Binomial Expansion from its seed rational prime raised to n-th power. Two methods of enumeration are defined based on the permutation criterion of such triplet, i.e. unordered vs ordered.
Category: Combinatorics and Graph Theory