Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Asinowski, Andrei License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-7833
URL:

Suballowable sequences of permutations

pdf-format:


Abstract

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


BibTeX - Entry

@InProceedings{asinowski:DagSemProc.06201.9,
  author =	{Asinowski, Andrei},
  title =	{{Suballowable sequences of permutations}},
  booktitle =	{Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6201},
  editor =	{Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/783},
  URN =		{urn:nbn:de:0030-drops-7833},
  doi =		{10.4230/DagSemProc.06201.9},
  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 | Privacy Published by LZI