Partitioning Zsp in finite fields and groups of trees and cycles

Abstract

This paper investigates the algebraic and graphical structure of the ring Zsp, with a focus on its decomposition into finite fields, kernels, and special subsets. We establish classical isomorphisms between Fs and pFs, as well as pFs and pFs+1,. We introduce the notion of arcs and rooted trees to describe the pre-periodic structure of Zsp, and prove that trees rooted at elements not divisible by s or p can be generated from the tree of unity via multiplication by cyclic arcs. Furthermore, we define and analyze the set Dsp, consisting of elements that are neither multiples of s or p nor "off-by-one" elements, and show that its graph decomposes into cycles and pre-periodic trees. Finally, we demonstrate that every cycle in Zsp contains inner cycles that are derived predictably from the cycles of the finite fields pFs and sFp, and we discuss the cryptographic relevance of Dsp, highlighting its potential for analyzing cyclic attacks and factorization methods.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…