Skip to main content

Write a PREreview

A Ladder-Based Traversal Notation for Repeated Symbolic Sequences

Posted
Server
Preprints.org
DOI
10.20944/preprints202605.1865.v1

This paper introduces a ladder-based traversal framework for representing repeated symbolic structures within symbolic and numerical sequences. Repeated structures are interpreted as ordered traversal paths between hierarchical rung states, for example permitting repetition to be analysed as directed traversal behaviour rather than solely as static substring occurrence.The framework defines traversal states using traversal direction, rung progression between adjacent repetition orders, traversal-gap structure, and climb behaviour. Valid traversal is restricted to transitions between neighbouring rung states only. The model additionally permits chained traversal paths spanning multiple repetition orders, overlapping embeddings in which symbolic occurrences participate in multiple traversals, and recursive overlap between rung states.Unlike conventional repetition frameworks that primarily characterise repeated substrings through periodicity or maximal interval structure, the proposed framework provides a traversal-oriented and geometric interpretation of symbolic repetition in which repeated structures may be analysed as interconnected traversal systems rather than purely linear strings. Potential applications include symbolic sequence fingerprinting, traversal-density analysis, overlap statistics, traversal entropy measures, and Monte-Carlo comparison of traversal behaviour within random and non-random symbolic systems.

You can write a PREreview of A Ladder-Based Traversal Notation for Repeated Symbolic Sequences. A PREreview is a review of a preprint and can vary from a few sentences to a lengthy report, similar to a journal-organized peer-review report.

Before you start

We will ask you to log in with your ORCID iD. If you don’t have an iD, you can create one.

What is an ORCID iD?

An ORCID iD is a unique identifier that distinguishes you from everyone with the same or similar name.

Start now