Charles A. Cusack

Learn More
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles from one vertex and adds one pebble to the other. A vertex r is said to be reachable from a configuration if there exists a sequence of pebbling moves that places one pebble on(More)
I am interested in solving problems related to combinatorial design theory and cryptography by attacking them from two angles—computation and group theory. I am particularly interested in permutation groups—especially PSL(2,q) and closely related groups. The problems I am interested in include establishing the existence of t-designs and large sets, and the(More)
  • 1