output
20022011
most citedThe Ariadne's Clew Algorithm

125 citations

Showing 2006Show all

10 papers · 1 filter

math.NT2006

A note on univoque self-Sturmian numbers

Jean-Paul Allouche

We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of a unimodal continuous map from the unit interv…

quant-ph20061 cited

Approaches to Quantum Error Correction

Julia Kempe

The purpose of this little survey is to give a simple description of the main approaches to quantum error correction and quantum fault-tolerance. Our goal is to convey the necessar…

cs.DC20063 cited

Discovering Network Topology in the Presence of Byzantine Faults

Mikhail Nesterenko, Sébastien Tixeuil

We study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. We formally state the weak and strong versions of the problem. The weak version re…

math.NT200620 cited

On univoque Pisot numbers

J. -P. Allouche, C. Frougny, K. G. Hare

We study Pisot numbers which are univoque, i.e., such that there exists only one representation of 1 as , with . We p…

math.NT2006

Von Koch and Thue-Morse revisited

J. -P. Allouche, G. Skordev

We revisit the relation between the von Koch curve and the Thue-Morse sequence given in a recent paper of Ma and Goldener by relating their study to papers written by Coquet and De…

math.CO20061 cited

A simple bijection between permutation tableaux and permutations

Sylvie Corteel

We present a simple a bijection between permutations of with descents and permutation tableaux of length with columns.