Optimization problems on planar lattice transmitter networks

When
Start: 10/26/2015 - 4:15pm
End  : 10/26/2015 - 5:15pm

Category
Applied Math Seminar

Speaker
Lenny Fukshansky (CMC)

Abstract

Consider a network of radio transmitters of equal power placed at points of a two-dimensional lattice. On the one hand, we would like to choose a lattice that would maximize the coverage area of our network; on the other, we want to maximize the signal-to-noise ratio. We present some results and conjectures in the direction of these optimization problems and their relation to each other on some particularly interesting classes of planar lattices, as well as discuss some counting results on the number of possible such lattice networks of fixed determinant. This work came out of a Fletcher Jones Fellowship project in 2011.

Where
Emmy Noether Room Millikan 1021 Pomona College

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences