Thue–Morse Along Two Polynomial Subsequences

Stoll, Thomas

doi:10.1007/978-3-319-23660-5_5

Search citation statements

Order By: Relevance

Paper Sections

Select...

Problem 5: Counting Number Of Representations1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, where t is the Thue-Morse sequence. Stoll [28] showed that for odd natural numbers p > q there are integers n 1 , n 2 < p such that t(n 1 p), t(n 1 q) ∈ E, and t(n 2 p), t(n 2 q) ∈ O. Since t(2n) = t(n), we immediately get that E/E and O/O both contain all positive rational numbers.…”

Section: Problem 5: Counting Number Of Representationsmentioning

confidence: 95%

Quotients of Palindromic and Antipalindromic Numbers

Bai¹,

Meleshko²,

Riasat³

et al. 2022

Preprint

View full text Add to dashboard Cite

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of integers and rational numbers. For example, we show that the following problem is algorithmically decidable: given an integer N , determine if we can write N = A/B for palindromic numbers A and B. Given that N is representable, we find a bound on the size of the numerator of the smallest representation. We prove that the set of unrepresentable integers has positive density in N. We also obtain similar results for quotients of antipalindromic numbers (those for which the first half of the binary representation is the reverse complement of the second half). We also provide examples, numerical data, and a number of intriguing conjectures and open problems.

show abstract

Section: Problem 5: Counting Number Of Representationsmentioning

confidence: 95%