License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-7833
URL: http://drops.dagstuhl.de/opus/volltexte/2006/783/

Asinowski, Andrei

Suballowable sequences of permutations

pdf-format:
Dokument 1.pdf (310 KB)


Abstract

We discuss a notion of "allowable sequence of permutations" and show a few combinatorial results and geometric applications.

BibTeX - Entry

@InProceedings{asinowski:DSP:2006:783,
  author =	{Andrei Asinowski},
  title =	{Suballowable sequences of permutations},
  booktitle =	{Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
  year =	{2006},
  editor =	{Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein},
  number =	{06201},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/783},
  annote =	{Keywords: Aequences of permutations}
}

Keywords: Aequences of permutations
Seminar: 06201 - Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Issue date: 2006
Date of publication: 07.11.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI