✦ LIBER ✦

Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms

✍ Scribed by Gwénaël Richomme; Patrice Séébold

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Combinatorial Proof of the Farkas-Kra

✍ F.G. Garvan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 516 KB

On the rigidity of complete spacelike hy

✍ Luis J. Alías, Antonio Gervásio Colares… 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 241 KB

Combinatorial Generation of Complexity b

✍ Ishiuchi, Kan’ichiro; Nakazawa, Takehito; Yagishita, Fumitoshi; Mino, Takashi; N 📂 Article 📅 2013 🏛 American Chemical Society 🌐 English ⚖ 770 KB

The indentation of an elastic layer by a

✍ J. P. Pauwelussen; J. B. Alblas 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 729 KB

Combinatorial Templates Generated by Dip

✍ Linette M. Demers; Chad A. Mirkin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 2 views

Combinatorial Templates Generated by Dip

✍ Linette M. Demers; Chad A. Mirkin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 2 views