Jason Hill (CU Boulder (doctoral candidate) and SpotXchange (data scientist))
X
The aim of these talks is to discuss the algorithms and data structures used to examine finite permutation groups, and to question where parallel processing can be a benefit. In the first talk, we'll aim to answer the following questions: How are permutations stored and multiplied on a computer? How are permutation groups stored, and how do we determine invariants such as group order? How are stabilizer subgroups computed?
Parallel Permutation Group Algorithms
Feb. 03, 2015 2pm (Math 220)
Functional Analysis
Marty Walter (University of Colorado, Boulder) Negative Definite Functions Sponsored by the Meyer Fund
Parallel Permutation Group Algorithms