Balanced word: Difference between revisions
Jump to navigation
Jump to search
Sano et al. (2003) have a different definition for "m-balanced". |
No edit summary |
||
| Line 4: | Line 4: | ||
where |''u''|<sub>''x''<sub>''i''</sub></sub> is the number of occurrences of the letter ''x''<sub>''i''</sub> in the word ''u''. | where |''u''|<sub>''x''<sub>''i''</sub></sub> is the number of occurrences of the letter ''x''<sub>''i''</sub> in the word ''u''. | ||
== Properties == | |||
A balanced word or necklace in ''N'' letters has a [[maximum variety]] bound of <math> N \choose {\lceil N/2 \rceil}</math>. | A balanced word or necklace in ''N'' letters has a [[maximum variety]] bound of <math> N \choose {\lceil N/2 \rceil}</math>. | ||
== Generalizations == | |||
[[Category:Scale]][[Category:Terms]] | [[Category:Scale]][[Category:Terms]] | ||
Revision as of 05:46, 24 December 2023
Let d ≥ 0. A word or necklace s is balanced if its balance satisfies the following:
[math]\displaystyle{ \operatorname{balance}(s) := \max \big\{ \big| |w|_{x_i} - |w'|_{x_i} \big| : x_i \text{ is a letter of }s\text{ and }k = \operatorname{len}(w) = \operatorname{len}(w') \big\} \leq 1, }[/math]
where |u|xi is the number of occurrences of the letter xi in the word u.
Properties
A balanced word or necklace in N letters has a maximum variety bound of [math]\displaystyle{ N \choose {\lceil N/2 \rceil} }[/math].