Student Talk Series: Carl D. Garthwaite, Vencore Inc., April 16th in Olin 268 @ noon

Title: So You Think Your Errors Are Random…


In the development of radio frequency systems for digital communications, great attention is given to achieving low error rate performance.

Oversimplification of assumptions, however, such as treating bit errors as independent, identically distributed (iid) events may lead to seriously flawed

projections of performance.  An examination of the statistical behavior of error sequence correlation shows how reasonable observation schemes supported by

computer-based models can yield useful insight into likely system performance.

Distinguished Visiting Professor Talk Series: Constanze Liaw, Baylor University, April 14th @4pm in Olin 372


Title: Perspectives on Rank 1 Perturbations


The central question in perturbation theory is as follows. Let A and B be linear transformations; think of (NxN)-matrices or differential operators.

we know the eigenvalues of A and have partial information about B. What can we say about the eigenvalues of A+B?

The perturbation is said to be of rank 1, if we assume that B is a vector projection. This seemingly simple example (a) exhibits a surprisingly rich theory with connections

to harmonic analysis and operator theory; and (b) arises naturally in mathematical physics via a change of boundary conditions of a second order differential operator.

Distinguished Visiting Professor Talk Series: Constanze Liaw, Baylor University, April 16th @4pm in Olin 372

Title: Finding Cyclic Vectors

Abstract:  In perturbation theory, the cyclicity (i.e. completeness of the forward orbit for some vector) of an operator is often a natural assumption

in the hypothesis of many results. We discuss two sets of results. (a) We consider rank one perturbations and some applications concerning the

locations where functions of the Payley-Wiener class are allowed to have zeros. (b) We study so-called Anderson-type Hamiltonians (a

generalization of random Schroedinger operators) and state that under mild conditions, every non-zero vector is cyclic almost surely. This result is

related to the long-standing problem of Anderson localization.

Student Talk Series: Kevin Wilson ’03, National Security Agency, April 9th in Olin 268 @ noon

Title: How a Mathematician Defeated the Enigma (and a pitch for doing math at NSA).


Have you ever wondered how the German Enigma cryptographic device was defeated in World War II? Come see how a mathematician helped shorten the war by two years, and learn some math and history along the way. You will also have the opportunity to learn about mathematical summer internships and careers at NSA.

The Bucknell Pre-calculus Requirement

College-level mathematics is exciting and empowering, and the Mathematics Department wants your experience to begin in the best way possible!  We are providing and requiring a 6-week online preparation course—the ALEKS Prep. for Calculus—for all students who will take MATH 201.  Results from previous years show that working through this online course will get you started on the path to success in college calculus.

The Prep. for Calculus course will be available starting July 19. The deadline for completion for Fall Calculus enrollment is Aug. 29; we recommend you start by Aug 1. Students with a Spring Calculus enrollment may choose to complete this requirement over the summer or over winter break.

To get started, read the Prep. for Calculus Information sheet then visit the Bucknell ALEKS Prep. for Calculus Moodle page.