Robert Erra ; Nik Lygeros ; Nigel Stewart - On Minimal Strings Containing the Elements of S_n by Decimation

dmtcs:2289 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) - https://doi.org/10.46298/dmtcs.2289
On Minimal Strings Containing the Elements of S_n by Decimation

Authors: Robert Erra ; Nik Lygeros ; Nigel Stewart

    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(n^2)$ in length, but finding optimal solutions can be difficult.


    Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
    Section: Proceedings
    Published on: January 1, 2001
    Imported on: November 21, 2016
    Keywords: Permutations,q-analogs,Hyperplane Arrangements,Symmetric Group,[INFO] Computer Science [cs],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 125 times.
    This article's PDF has been downloaded 192 times.