On some theoretical and computational aspects of Anatol Vieru’s periodic sequences - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Soft Computing Année : 2004

On some theoretical and computational aspects of Anatol Vieru’s periodic sequences

Moreno Andreatta
Carlos Agon
  • Fonction : Auteur
  • PersonId : 919490
  • IdRef : 110826965

Résumé

This article develops some aspects of Anatol Vieru's compositional technique based on finite difference calculus of periodic sequences taking values in a cyclic group. After recalling some group-theoretical properties, we focus on the decomposition algorithm enabling to represent any periodic sequence taking values in a cyclic group as a sum of a reducible and a reproducible sequence. The implementation of this decomposition theorem in a computer aided music composition language, as OpenMusic, enables to easily verify if a given periodic sequence is reducible or reproducible. In this special case, one of the two terms will be identically zero. This means that every periodic sequence has in itself a certain degree of reducibility and reproducibility. We also suggest how to use this result in order to explain some regularities of the distribution of numerical values in the case of the finite addition process and how to generalize the decomposition theorem by means of the Fitting Lemma. This opens the problem of the musical relevance of a generalized module-theoretical approach in Vieru's theory of periodic sequences.
Fichier principal
Vignette du fichier
index.pdf (1.1 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01161049 , version 1 (08-06-2015)

Identifiants

  • HAL Id : hal-01161049 , version 1

Citer

Moreno Andreatta, Dan Tudor Vuza, Carlos Agon. On some theoretical and computational aspects of Anatol Vieru’s periodic sequences. Soft Computing, 2004, 8 (9), pp.588-596. ⟨hal-01161049⟩
129 Consultations
196 Téléchargements

Partager

Gmail Facebook X LinkedIn More