Search for dissertations about: "Combinatorics on words"

Showing result 1 - 5 of 6 swedish dissertations containing the words Combinatorics on words.

  2. 1. Digital lines, Sturmian words, and continued fractions

    Author : Hanna Uscka-Wehlou; Christer Oscar Kiselman; Maciej Klimek; Gunilla Borgefors; Mikael Passare; Damien Jamet; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; digital geometry; digital line; hierarchy of runs; combinatorics on words; Sturmian word; upper mechanical word; characteristic word; irrational slope; continued fraction; Gauss map; fixed point; Discrete mathematics; Diskret matematik; matematik; Mathematics;

    Abstract : In this thesis we present and solve selected problems arising from digital geometry and combinatorics on words. We consider digital straight lines and, equivalently, upper mechanical words with positive irrational slopes a... READ MORE

  4. 2. On numbers badly approximable by q-adic rationals

    Author : Johan Nilsson; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Number theory; Symbolic dynamics; Combinatorics on words; Badly approximable numbers; Diophantine approximation; Mathematics; Matematik; Dynamical systems;

    Abstract : The thesis takes as starting point diophantine approximation with focus on the area of badly approximable numbers. For the special kind of rationals, the q-adic rationals, we consider two types of approimations models, a one-sided and a two-sided model, and the sets of badly approximable numbers they give rise to. READ MORE

  5. 3. Symbolic sequences, crucial words and iterations of a morphism

    Author : Sergey Kitaev; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; symbolic sequence; combinatorics on words; morphism; iteration of a morphism; set of prohibitions; complete set of prohibitions; crucial word; Arshon sequence; sequence of sigma; set of prohibitions;

    Abstract : .... READ MORE

  6. 4. Dynamics and limits in algebraic combinatorics

    Author : Samu Potka; Svante Linusson; Victor Reiner; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Matematik;

    Abstract : This thesis consists of the following six articles.Properties of the Edelman-Greene bijection. Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. READ MORE

  7. 5. Enumerative combinatorics related to partition shapes

    Author : Jonas Sjöstrand; Anders Björner; Christian Krattenthaler; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; partition shape; sign-imbalance; Robinson-Schensted correspondence; chess tableau; restricted word; cylindrical lattice walk; Poincaré polynomial; Bruhat interval; rook polynomial; pattern avoidance; partitionsform; teckenobalans; Robinson-Schensted-korrespondens; schacktablå; begränsade ord; cylindriska latticestigar; poincarépolynom; bruhatintervall; tornpolynom; mönsterundvikande permutation; MATHEMATICS; MATEMATIK;

    Abstract : This thesis deals with enumerative combinatorics applied to three different objects related to partition shapes, namely tableaux, restricted words, and Bruhat intervals. The main scientific contributions are the following. READ MORE