Some examples of lexicographic order algorithms and some open combinatorial problems

TitleSome examples of lexicographic order algorithms and some open combinatorial problems
Publication TypeJournal Article
Year of Publication1997
AuthorsVandev D
JournalAnnuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique
Volume89
IssueLivre 2 - Mathématiques Appliquée et Informatique
Pagination203-2015
ISSN0205-0808
Keywordsenumerating algorithms, lexicographic order functions
Abstract

A general reasoning based on the lexicographic order is studied. It helps to create algorithms for generation of sets of words having certain natural and good properties. Several examples are considered and the performance of the proposed algorithms is calculated. An open combinatorial problem regarding the set of partitions arises.

1991/95 MSC

68E05, 65C20

AttachmentSize
PDF icon 89-203-215.pdf1.25 MB