1,356,884 research outputs found

    Benearnica Christianissimi Regis quinque dierum expeditio

    No full text
    [Jean Arnoux]Verf. ermittelt in: Backer/Sommervogel, I, 570TitelvignetteBogensignaturen: A

    Episturmian words: a survey

    No full text
    In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic properties, we consider episturmian morphisms that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their connection to the balance property, and related notions such as finite episturmian words, Arnoux-Rauzy sequences, and "episkew words" that generalize the skew words of Morse and Hedlund

    ARNOUX-RAUZY INTERVAL EXCHANGES

    No full text
    International audienceThe Arnoux-Rauzy systems are defined in [5], both as symbolic systems on three letters and exchange transformations of six intervals on the circle. In connection with a conjecture of S.P. Novikov, we investigate the dynamical properties of these interval exchange transformations, and precise their relation with the symbolic systems, which was known only to be a semi-conjugacy. In order to do this, we define a new system which is an exchange transformation of nine intervals on the line (it was described in [3] for a particular case). Our main result is that the semi-conjugacy determines a measure-theoretic isomorphism (between the three systems) under a diophantine (sufficient) condition, which is satisfied by almost all Arnoux-Rauzy systems for a suitable measure. However, under another condition, the interval exchange transformations are not uniquely ergodic and the isomorphism does not hold for all invariant measures. Finally, we give conditions for these interval exchange transformations to be weakly mixing

    ARNOUX-RAUZY INTERVAL EXCHANGE TRANSFORMATIONS

    No full text
    International audienceThe Arnoux-Rauzy systems are defined in [5], both as symbolic systems on three letters and exchanges of six intervals on the circle. In connection with a conjecture of S.P. Novikov, we investigate the dynamical properties of the interval exchanges, and precise their relation with the symbolic systems, which was known only to be a semi-conjugacy; in order to do this, we define a new system which is an exchange of nine intervals (it was described in [3] for a particular case). Our main result is that the semi-conjugacy determines a measure-theoretic isomorphism under an explicit (sufficient) condition, which is satisfied by almost all Arnoux-Rauzy systems for a suitable measure; but, under another condition, the interval exchanges are not uniquely ergodic and the isomorphism does not hold for all invariant measures; finally, we give conditions for these interval exchanges to be weakly mixing

    La sintaxis del diálogo en Berceo

    No full text
    Al Profesor Dr. Rafael Cano Aguilar: Me dirijo a Usted para informarle que por parte de las editoras del Homenaje a Ofelia Kovacci, la Dra. Elvira N. de Arnoux y yo, no hay ningún inconveniente para que su artículo "La sintaxis del diálogo en Berceo" se incluya en el repositorio digital de la Universidad de Sevilla

    Clustering and Arnoux-Rauzy words

    No full text
    International audienceWe characterize the clustering of a word under the Burrows-Wheeler transform in terms of the resolution of a bounded number of bispecial factors belonging to the language generated by all its powers. We use this criterion to compute, in every given Arnoux-Rauzy language on three letters, an explicit bound K such that each word of length at least K is not clustering; this bound is sharp for a set of Arnoux-Rauzy languages including the Tribonacci one. In the other direction, we characterize all standard Arnoux-Rauzy clustering words, and all perfectly clustering Arnoux-Rauzy words. We extend some results to episturmian languages, characterizing those which produce infinitely many clustering words, and to larger alphabets

    Clustering and Arnoux-Rauzy words

    No full text
    We characterize the clustering of a word under the Burrows-Wheeler transform in terms of the resolution of a bounded number of bispecial factors belonging to the language generated by all its powers. We use this criterion to compute, in every given Arnoux-Rauzy language on three letters, an explicit bound KK such that each word of length at least KK is not clustering; this bound is sharp for a set of Arnoux-Rauzy languages including the Tribonacci one. In the other direction, we characterize all standard Arnoux-Rauzy clustering words, and all perfectly clustering Arnoux-Rauzy words. We extend some results to episturmian languages, characterizing those which produce infinitely many clustering words, and to larger alphabets

    Léon Arnoux chez Minton

    No full text
    « Un gentleman qui avait depuis longtemps la réputation d’en savoir plus long sur la production de la céramique et ses mystères qu’aucun autre savant en France ». Ainsi Sir Matthew Digby-Wyatt, designer et architecte Anglais de renom, évoque-t-il Léon Arnoux. Ce qui atteste de la grande réputation dont jouissait Arnoux à son arrivée en Angleterre en 1849 (ill. 1).A ne pas en douter, les raisons qui à cette époque l’amenèrent à s’y rendre étaient de plusieurs ordres : problèmes – entre autres..

    Balance properties of Arnoux-Rauzy words

    No full text
    International audienceThe paper deals with balances and imbalances in Arnoux-Rauzy words. We provide sufficient conditions for CC-balancedness, but our results indicate that even a characterization of 2-balanced Arnoux-Rauzy words on a 3-letter alphabet is not immediate

    Balancedness of Arnoux-Rauzy and Brun words

    No full text
    International audienceWe study balancedness properties of words given by the Arnoux-Rauzy and Brun multi-dimensional continued fraction algorithms. We show that almost all Brun words on 3 letters and Arnoux-Rauzy words over arbitrary alphabets are finitely balanced; in particular, boundedness of the strong partial quotients implies balancedness. On the other hand, we provide examples of unbalanced Brun words on 3 letters
    corecore