Abstract: On minimal strings containing by decimation the elements of the symmetric group

N. Lygeros




Abstract: 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.







free counters


Opus