4 citations · 10 across the 7 of their papers we have counts for
7 papers
Aperiodicity and subword complexity in the binary expansion of powers of three
Ralf Stephan
We prove two results on the fine structure of the binary digits of . First, for every fixed period , the number of positions at which the binary expansion of brea…
Superlinear complexity of the steering word
Ralf Stephan
Write with the nearest integer and , and let , , be the resulting \emph{stee…
Interleaved snowballing: Reducing the workload of literature curators
Ralf Stephan
We formally define the literature (reference) snowballing method and present a refined version of it. We show that the improved algorithm can substantially reduce curator work, eve…
On a class of reducible trinomials
Ralf Stephan
In this short note we give an expression for some numbers such that the polynomial is reducible.
Prove or Disprove. 100 Conjectures from the OEIS
Ralf Stephan
Presented here are over one hundred conjectures ranging from easy to difficult, from many mathematical fields. I also summarize briefly methods and tools that have led to this coll…
Divide-and-conquer generating functions. Part I. Elementary sequences
Ralf Stephan
Divide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is…