A new measure of asymmetry of binary words
Alex Ravsky

TL;DR
This paper introduces a novel measure of asymmetry for binary words based on minimal deletions needed to achieve symmetry, providing bounds for this measure.
Contribution
It defines a new asymmetry measure for binary words and derives upper and lower bounds for it, advancing understanding of word symmetry properties.
Findings
Established upper and lower bounds for the asymmetry measure
Provided a formal definition of the asymmetry measure
Analyzed properties of binary words related to symmetry
Abstract
A binary word is symmetric if it is a palindrome or an antipalindrome. We define a new measure of asymmetry of a binary word equal to the minimal number of letters of the word whose deleting from the word yields a symmetric word and obtain upper and lower estimations of this measure.
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
Topicssemigroups and automata theory · Advanced Algebra and Logic · Computability, Logic, AI Algorithms
