ON THE PARITY SLOPE OF WORDS OF LOW COMPLEXITY

Cristian Cobeli, Alexandru Zaharescu

Research output: Contribution to journalArticlepeer-review

Abstract

We calculate the parity divisor functions associated to the ranks of the infinite monoletter word and to the Sturmian words and prove that there is a tilt of size proportional to log2−1/2 towards the number of odd divisors.

Original languageEnglish (US)
Pages (from-to)329-336
Number of pages8
JournalProceedings of the Romanian Academy Series A - Mathematics Physics Technical Sciences Information Science
Volume23
Issue number4
StatePublished - Oct 1 2022

Keywords

  • Sturmian words
  • low complexity
  • number of divisors
  • parity

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics
  • General Engineering
  • General Physics and Astronomy

Fingerprint

Dive into the research topics of 'ON THE PARITY SLOPE OF WORDS OF LOW COMPLEXITY'. Together they form a unique fingerprint.

Cite this