Let G be a dihedral group and let T be a collection of irreducible representations of G. In the simplest case, a subset C of G is a Delsarte T-design if, for each representation ρ in T, the matrix Σ_{g∈C} ρ(g) has trace zero. Every finite group gives rise to an association scheme called the conjugacy class scheme of the group. This MQP explores Delsarte T-designs in the context of this association scheme.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Herlihy, Rhianna

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-042424-190058
• 121583

Keyword

• Delsarte theory
• Algebraic combinatorics
• Representation theory
• Combinatorial design theory
• Association schemes

Advisor

• Martin, William J.

Year

• 2024

Date created

• 2024-04-24

Resource type

• Major Qualifying Project

Major

• Mathematical Sciences

Source

• E-project-042424-190058

Rights statement

• In Copyright