Back to search

University of North Texas

A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

Abstract

dc:description

We investigate a class of minimal sequences on a finite alphabet Ak = {1,2,...,k} having (k - 1)n + 1 distinct subwords of length n. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of binary Sturmian sequences. We describe two simple combinatorial algorithms for constructing characteristic Arnoux-Rauzy sequences (one of which is new even in the Sturmian case). Arnoux-Rauzy sequences arising from fixed points of primitive morphisms are characterized by an underlying periodic structure. We show that every Arnoux-Rauzy sequence contains arbitrarily large subwords of the form V^2+ε and, in the Sturmian case, arbitrarily large subwords of the form V^3+ε. Finally, we prove that an irrational number whose base b-digit expansion is an Arnoux-Rauzy sequence is transcendental.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1998

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Risley, Rebecca N.
Contributors dc:contributor
  • Zamboni, Luca Quardo, 1962-
  • Jackson, Steve, 1957-
  • Iaia, Joseph A.

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
  • Risley, Rebecca N.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
call-no: 379 N81 no.7528
untcat: b2122340
local-cont-no: 1002660157-risely
https://digital.library.unt.edu/ark:/67531/metadc278440/
ark: ark:/67531/metadc278440

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Risley, Rebecca N.. A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence. University of North Texas, 1998. https://doi.org/10.12794/metadc278440