Words / CONCEPT
Palindromic factorisations bound integral potentials
Palindromic factorisations bound integral potentials
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH10
DOCUMENT LINKS1
potential_pl_bound
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A mismatch path constructs reflected unequal Fibonacci lettersstructural-affinity · Closed
- An explicit upper bound for Frid prefixesstructural-affinity · Closed
- Compressed co-accessibility and product potentialsstructural-affinity · Closed
- Minimum nonempty palindrome factorisationstructural-affinity · Closed
- Palindrome reflection forces the paired endpoint languagestructural-affinity · Closed
- Regroup endpoint paths into six-bit chunksstructural-affinity · Closed
- The exact palindromic length of every Frid prefixstructural-affinity · Closed
- The exact weighted cycle for the Frid digit familystructural-affinity · Closed
- The literal reachable product-state table is grouped by endpoint state q and first rank state pstructural-affinity · Closed
- The seventeen literal arrays store all 829 endpoint moves for six-bit chunksstructural-affinity · Closed
- Uniform prefix bound for the AKMP substitutionstructural-affinity · Closed
- Words: Golden Critical Exponentstructural-affinity · Closed
- Words: Golden Factor Complexitystructural-affinity · Closed
- Words: Golden Recurrencestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance