|author:||Robert Erra, Nik Lygeros and Nigel Stewart|
On Minimal Strings Containing the Elements of
Hyperplane Arrangements, Symmetric Group, Permutations,
The permutations by decimation problem is thought
to be applicable to computer graphics, and raises
interesting theoretical questions in combinatory theory. We
present the results of some theoretical and practical
investigation into this problem. We show that sequences of
this form are
O(nin length, but finding optimal solutions can be difficult.
|If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.|
Robert Erra and Nik Lygeros and Nigel Stewart (2001), On
Minimal Strings Containing the Elements of
Sby Decimation, in Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, Robert Cori and Jacques Mazoyer and Michel Morvan and Rémy Mosseri (eds.), Discrete Mathematics and Theoretical Computer Science Proceedings AA, pp. 165-176
|bibtex:||For a corresponding BibTeX entry, please consider our BibTeX-file.|
|ps.gz-source:||dmAA0112.ps.gz (106 K)|
|ps-source:||dmAA0112.ps (348 K)|
|pdf-source:||dmAA0112.pdf (110 K)|
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.