Cardinality of 2 and Higher Distance Sets

Cardinality of 2 and Higher Distance Sets: This presentation focuses on an improved upper bound on the cardinality of a 2-distance set proved by Blokhuis in 1984. Using the polynomial method, this new bound is achieved by including additional linearly independent polynomials to the set. We then move on to give bounds on the cardinality of certain three and higher distance sets in different spaces.

Propagation of Information in a Network : Graphs are used to model communication networks and in the study of epidemics. In particular we are interested in the time it takes for information to propagate from a single vertex throughout a finite network. The expected propagation time, E(n), is dependent on the number of vertices, the graph's topology and the probability of successful transmission between vertices. We will focus our attention on paths, stars and complete graphs. The propagation time of a given network may be optimized without increasing the number of edges.

Event Topic

Discrete Applied Math Seminar