W&M Featured Events
This calendar presented by
William & Mary
[PAST EVENT] Chase Albert--Honors Thesis Defense
April 25, 2011
2:30pm - 3:30pm
Abstract: A permutation may be characterized as b-banded when it moves no element
more than b places. Every permutation may be factored into tridiagonal (1-banded) permutations, we prove that an upper bound on the number of tridiagonal factors necessary is 2-1, verifying a conjecture of Gilbert Strang.
A vertex identifying code of a graph is a subset D of the graph's vertices with the property that for every pair of vertices v1 and v2, N(v1) \ D and N(v2) \ D are distinct and nonempty (where N(v) is the neighborhood function, the set of all vertices adjacent to v, here including v). We compute an upper bound of 1/3 and a strict lower bound of 3/10 for the innite snub hexagonal grid.
more than b places. Every permutation may be factored into tridiagonal (1-banded) permutations, we prove that an upper bound on the number of tridiagonal factors necessary is 2-1, verifying a conjecture of Gilbert Strang.
A vertex identifying code of a graph is a subset D of the graph's vertices with the property that for every pair of vertices v1 and v2, N(v1) \ D and N(v2) \ D are distinct and nonempty (where N(v) is the neighborhood function, the set of all vertices adjacent to v, here including v). We compute an upper bound of 1/3 and a strict lower bound of 3/10 for the innite snub hexagonal grid.