- You are here:
- GT Home
- Home
- News & Events

Series: Other Talks

The speaker has combined his two loves to create a dynamic presentation called "Mathemagics," suitable for all audiences, where he demonstrates and explains his secrets for performing rapid mental calculations faster than a calculator. Reader's Digest calls him "America's Best Math Whiz". He has presented his high energy talk for thousands of groups throughout the world. This event is free but reservations are required. The signup form will be available before 5pm on February 25.
See details about the speaker.

Series: Other Talks

The SIAM Student Chapter at Georgia Tech will be hosting this conference. It is an extension of the ACES Workshop which has been held yearly by the universities of Auburn, Clemson, Emory, and South Carolina since 2006. As with the ACES Workshop, this conference is an opportunity for graduate students to present their research in applied mathematics and related fields as well as to meet with other graduate students from different universities and departments. See the conference site for more details.

Series: Other Talks

Hosted by Academic Affairs Honors Program in collaboration with the College of Sciences.

To watch a 15-minute presentation by Dr. Nadkarni see the
YouTube link.

Series: Other Talks

Hamiltonian systems typically exhibit a mixture of chaos and regularity, complicating any scheme to partition phase space and extract a symbolic description of the dynamics. In particular, the dynamics in the vicinity of stable islands can exhibit extremely complicated topology. We present an approach to extracting symbolic dynamics in such systems using networks of nested heteroclinic tangles-- fundamental geometric objects that organize phase space transport. These tangles can be used to progressively approximate the behavior in the vicinity of stable island chains. The net result is a symbolic approximation to the dynamics, and an associated phase-space partition, that includes the influence of stable islands. The utility of this approach is illustrated by examining two applications in atomic physics -- the chaotic escape of ultracold atoms from an atomic trap and the chaotic ionization of atoms in external fields.

Series: Other Talks

Dr. Skip Garibaldi, Emory University's Winship Distinguished Professor,
will make a presentation on Mathematics of the Lottery. He will discuss his
expository article: "Finding good bets in the lottery, and why you shouldn't take them"
recently published in the American Mathematical Monthly, Volume 117 (2010) 3-26.

Series: Other Talks

The purpose of the Georgia Scientific Computing Symposium (GSC 2010) is to provide an opportunity for professors, postdocs and graduate students in the Atlanta area to meet in an informal setting, to exchange ideas, and to highlight local scientific computing research. The one-day symposium is open to the whole research community. The event is free but registration is required.

Series: Other Talks

The Subset Sum and Knapsack problems are fundamental NP-complete problems and the pseudo-polynomial time dynamic programming algorithms for them appear in every algorithms textbook. The algorithms require pseudo-polynomial time and space. Since we do not expect polynomial time algorithms for Subset Sum and Knapsack to exist, a very natural question is whether they can be solved in pseudo-polynomial time and polynomial space. In this paper we answer this question affrmatively, and give the first pseudo-polynomial time, polynomial space algorithms for these problems. Our approach is based on algebraic methods and turns out to be useful for several other problems as well. If there is time i will also show how our method can be applied to give polynomial space exact algorithms for the classical Traveling Salesman, Weighted Set Cover and Weighted Steiner Tree problems. Joint work with Jesper Nederlof.

Series: Other Talks

Refreshments in Room 2222, Klaus Building from 2-3 PM.

Simple, distributed and iterative algorithms, popularly known as the message passing algorithms, have emerged as the architecture of choice for engineered networks as well as cannonical behavioral model for societal and biological networks. Despite their simplicity, message passing algorithms have been surprisingly effective. In this talk, I will try to argue in favor of such algorithms by means of two results in the context of designing efficient medium access in wireless networks and modeling agent behavior in road transportation networks. See the
full abstract,

Series: Other Talks

Series: Other Talks