#### Filter Results:

#### Publication Year

2005

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We calculate the character table of the maximal subgroup of the Monster N (3B) ∼ = 3 1+12 +. 2. Suz:2, and also of the group 3 1+12 :6. Suz:2, which has the former as a quotient. The strategy is to induce characters from the inertia groups in 3 1+12 :6. Suz:2 of characters of 3 1+12. We obtain the quotient map to N (3B) computationally, and our careful… (More)

We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Weiser (which only considered terminating ones) and, as such, is an accurate characterisation of the semantic relationship between a program and the slice produced by these algorithms.… (More)

We describe a procedure for determining (up to algebraic con-jugacy) which conjugacy class any element of the Monster lies in, using computer constructions of representations of the Monster in characteristics 2 and 7. We use this procedure to calculate explicit representatives for each conjugacy class.

- Blockin, Blockin Blockin, Blockin Blockin Blockin, Blockin Blockin∋ ! > ? ∋& ! = ! ∋ Blockin=∋= Blockin&∋ ; Blockin, Blockin Blockin, Blockin ! Blockin Blockin ) %∋ Blockin +8 others
- 2015

We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Weiser (which only considered terminating ones) and, as such, is an accurate characterisation of the semantic relationship between a program and the slice produced by these algorithms.… (More)

- ‹
- 1
- ›