Supercuspidal Representations of Finite Reductive Groups

Supercuspidal Representations of GLn: Ex

Supercuspidal Representations of GLn: Explicit Whittaker Functions

✍ Colin J Bushnell; Guy Henniart 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 241 KB

On Primitive Linear Representations of F

On Primitive Linear Representations of Finite Groups

✍ Michael Aschbacher 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Equivalence of Uniform Orthogonal Repres

Equivalence of Uniform Orthogonal Representations of Finite Groups

✍ C. Riehm 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Let V be a finite dimensional vector space over a field K of characteristic / 2, and b: the orthogonal group of b. Another orthogonal representation Ž . Ž . Ј: G ª O bЈ is orthogonally equi¨alent to if there is an isometry : Ž . VªVЈwhich commutes with the action of G, i.e., satisfies bЈ u, Ž . sb

Effective Equivalence of Orthogonal Repr

Effective Equivalence of Orthogonal Representations of Finite Groups

✍ C. Riehm 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Let V be a finite dimensional vector space over a field K of characteristic / 2, and b: the orthogonal group of b. Another orthogonal representation Ž . Ž . Ј: G ª O bЈ is orthogonally equi¨alent to if there is an isometry : Ž . VªVЈwhich commutes with the action of G, i.e., satisfies bЈ u, Ž . sb

Constructing Representations of Finite G

Constructing Representations of Finite Groups and Applications to Finitely Presented Groups

✍ W Plesken; B Souvignier 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 180 KB

The Graphical Regular Representations of

The Graphical Regular Representations of Finite Metacyclicp-Groups

✍ Cai Heng Li; Hyo-Seob Sim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A Cayley graph = Cay(G, S) is called a graphical regular representation of the group G if Aut = G. One long-standing open problem about Cayley graphs is to determine which Cayley graphs are graphical regular representations of the corresponding groups. A simple necessary condition for to be a graphi