Sebastian Egner
Markus Püschel
- 1.BABAI~ L.~ LUKS~ E. M.~ AND SERESS~ A. Fast Management of Permutation Groups. SIAM Journal of Computing 26 (1997)F 1310-1342. Google Scholar
Digital Library
- 2.BABAI~ L.~ AND SERESS~ A. On the Diameter of Permutation Groups. Eur. J. Comb. ~ (1992)F 231-243. Google ScholarDigital Library
- 3.BRADLY~ L. D. Java-applet implementing Rubik% Cube. http ://www. pha. jhu. edu/~idb/ j ava/rubik, html.Google Scholar
- 4.BUTLER~ G. Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer ScienceF 559. SpringerF 1991.Google Scholar
- 5.CONWAY~ J. H. M13. in Bailey, R. A. (ed.), Surveys in Combinatorics, London Math. Soc. Lect. Note Series 2~1 (1997).Google Scholar
- 6.COOPERMAN~ G.~ AND FINKELSTEIN~ L. New Methods for Using Cayley Graphs in Interconnection Networks. Discrete Applied Mathematics 3?'/38, special issue on Interconnection Networks (1992)F 95-118. Google ScholarDigital Library
- 7.COOPERMAN~ G.~ FINKELSTEIN~ L.~ AND SARAWAGI~ N. Applications of Cayley Graphs. Lecture Notes in Computer Science, AAECC-8 508 (1991)F 367-378. Google ScholarDigital Library
- 8.EGNER, S. Java-applet for M13. avalon, ira. uka. de/ home/egner/m13/m13, html.Google Scholar
- 9.HUPPERT, B. Endliche GruppenF ~1. I. SpringerF 1983.Google Scholar
- 10.KAIB~ M. Gitterbasenreduktion fiir beliebige Normen. PhD thesisF Mathematics Dept.F Univ. ~nkfurt (Main)F 1994.Google Scholar
- 11.LALLEMENT~ G. Semigroups and Combinatorial Applications. J. Wiley &: SonsF 1979. Google ScholarDigital Library
- 12.MATZ~ O.~ MILLER~ A.~ POTTHOFF~ A.~ THOMA$~ W.~ AND E.~ V. Report on the Program AMoRE. Tech. rep.F Institut fiir Informatik und Praktische MathematikF Uniersit5t KielF 1995.Google Scholar
- 13.MINKWITZ~ T. An Algorithm for Solving the Factorization Problem in Permutation Groups. Journal of Symbolic Computation to appear (1998). Google ScholarDigital Library
- 14.MORTAZAVI~ M. Loyds% Fifteen. math.berkeley.edu/ ~mo rt azav / j ava_t e st / sq/Sq2, html.Google Scholar
- 15.MOTWANI~ 1~.~ AND RAGHAVAN~ P. Randomized Algorithms. Cambridge Univ. PressF 1995. Google ScholarDigital Library
- 16.OSTERLUND, P. The shared GAP-package AbStab. http://www-gap, dcs. st-and, ac. uk/,-~gap/F 1995.Google Scholar
- 17.RITTER~ H. A ufzShlung yon kurzen Gittervektoren in allgemeiner Norm. PhD thesisF Mathematics Dept.F Univ. Frankfurt (Main)F 1997.Google Scholar
- 18.SCH(SNERT~ M.~ ET AL. GAP GroupsFAlgorithms and ProgrammingF v3.4.3. Tech. rep.F Lehrstuhl D fly MathematikF 1WTH AachenF 1995.Google Scholar
- 19.The Cube Lover's Archive. http://www.math.rwthaachen, de/,-~Martin. Schoenert/Cube-Lovers/. Collected E-mailsF 1980-1996.Google Scholar
Index Terms
- Solving puzzles related to permutation groups
Recommendations
Permutation tableaux and permutation patterns
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the -diagrams of Alex Postnikov [A. Postnikov, Webs in ...
On the sign-imbalance of permutation tableaux
Permutation tableaux were introduced by Steingrmsson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length n is the sum of signs over ...
Linear optimization over permutation groups
For a permutation group given by a set of generators, the problem of finding ''special'' group members is NP-hard in many cases, e.g., this is true for the problem of finding a permutation with a minimum number of fixed points or a permutation with a ...
Comments