The invariance of the type of a $v$-palindrome
Daniel Tsai

TL;DR
This paper proves that the type of a $v$-palindrome, a recently introduced concept, remains invariant regardless of the number $m$ used in its definition, highlighting a fundamental property of these structures.
Contribution
The paper establishes the invariance of the type of a $v$-palindrome with respect to different concatenation numbers $m$, advancing understanding of their structural properties.
Findings
Type of a $v$-palindrome is invariant over all $m$
Provides a foundational property of $v$-palindromes
Enhances theoretical understanding of $v$-palindromes
Abstract
The notion of a -palindrome is recently introduced by the author. Later, the author defined the notion of the type of a -palindrome with respect to a number which can be repeatedly concatenated to form . We prove that this notion of type is invariant over all .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · graph theory and CDMA systems · Mathematical Dynamics and Fractals
