OCTOBER 12 - OCTOBER 18, 2005 |
|
Princeton University Graduate Student Seminar | |
Topic: | A polynomial with a big Galois group |
Presenter: | Elena Fuchs, Princeton University |
Date: | Wednesday, October 12, 2005, Time: 12:30 p.m., Location: Fine Hall 224 |
Abstract: | Given an irreducible polynomial $f$ over $\mathbb Q$, we can represent its Galois group as a group of permutations on the $n$ roots, where $n$ is the degree of $f$. A natural question to ask is when the Galois group is all of ${\bf S}_n$ -- i.e., when is it ``very big", and thus useful for all kinds of stuff? There are several examples of such polynomials, and a particularly nice one is the truncated exponential polynomial, $$f_n(x) = 1+x +\frac{x^2} {2!} + \cdots + \frac{x^n}{n!},$$ which Schur proved to have Galois group ${\bf S}_n$ or ${\bf A}_n$. In this talk, we give a sketch of a recent and much simpler proof due to R. Coleman, involving Newton Polygons, which are amazing on their own. |
Statistical Mechanics Seminar | |
Topic: | Quantum dynamics of many-body systems with a singular mean-field interaction |
Presenter: | Laszlo Erdos, University of Munich |
Date: | Wednesday, October 12, 2005,Time: 2:00 p.m., Location: Jadwin 343 |
Abstract: | We prove that the one-particle density matrix of three dimensional interacting Bose systems with a short-scale repulsive pair interaction converges to the solution of the cubic non-linear Schr\"odinger equation in a suitable scaling limit. Our method is to study an infinite system of coupled evolution equations for the k-particle density matrices (Gross-Pitaevski hierarchy). The main technical achievement is the uniqueness of the solution to the Gross-Pitaevskii hierarchy in a certain Sobolev space. This result can be viewed as an extension of the well-posedness theorem of the cubic nonlinear Schr\"odinger equation to infinite dimensions. This is a joint work with B. Schlein and H.T. Yau. |
Discrete Mathematics Seminar | |
Topic: | Algebraic techniques for Turan problems |
Presenter: | Peter Keevash, Caltech |
Date: | Wednesday, October 12, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
Abstract: | See http://www.math.princeton.edu/~bsudakov/keevash2005-2006.pdf |
Topology Seminar | |
Topic: | Computing Khovanov-Rozansky Homology |
Presenter: | Jacob Rasmussen, Princeton University |
Date: | Thursday, October 13, 2005, Time: 4:30 p.m., Location: Fine Hall 314 |
Abstract: | I'll talk about techniques for computing Khovanov and Rozansky's sl(N) homology. In particular, I'll describe a class of "thin" knots for which the homology is particularly simple. Two-bridge knots are examples of thin knots. |
Geometric Analysis Seminar | |
Topic: | The obstacle problem for the fractional Laplacian |
Presenter: | Luis Silvestre, Courant Institute, NYU |
Date: | Friday,October 14, 2005, Time: 3:00 p.m., Location: Fine Hall 314 |
Abstract: | Obstacle problems, in general, are free boundary problems where one studies the minimum supersolution of an elliptic equation that is above a given function. We will study the problem with the fractional laplacian, that is an integro-differential operator. In particular we will present an almost optimal regularity result for the solutions. The obstacle problem can be obtained from an optimal stopping problem in stochastic control, which is related to pricing of american options in financial mathematics. The obstacle problem for the fractional laplacian is also related to thin obstacle problems. |
OCTOBER 17 - OCTOBER 21, 2005 |
|
PACM Colloquium | |
Topic: | Algebraic topology and the statistics of natural images |
Presenter: | Gunnar Carlsson, Mathematics, Stanford University |
Date: | Monday, October 17, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Abstract: | Natural images taken with a digital camera can be viewed as vectors in a high-dimensional vector space whose dimension is the number of pixels. To understand the set of natural images within this vector space is a very interesting problem, but as stated it is very difficult and likely intractable. A. Lee, D. Mumford, and K. Pedersen have created a data set consisting of small (3 by 3) patches, and one can then ask questions about this set. We (V. de Silva, T. Ishkanov, and myself) have used algebraic topological techniques to obtain information about this set, and I will discuss this application of topological methods in this talk. I will also discuss potential applications in compression and in the neuroscience of vision. |
Mathematical Physics Seminar | |
Topic: | Correlations within the spectrum of a large quantum graph |
Presenter: | Gregory Berkolaiko, Texas A&M University |
Date: | Tuesday, October 18, 2005, Time: 4:30 p.m., Location: Jadwin 343 |
Abstract: | We will begin with the description of the notion of quantum graphs, their spectra, the random matrix conjecture, and the trace formula which forms one of the main tools of the analysis of correlations in the spectrum. We will then discuss the combinatorial ideas behind the expansion of the related form factor, which is used to measure the correlations within the spectrum. The ideas originate from a similar work done on quantum billiards. Transplanting the theory to quantum graphs puts the derivation on a more solid mathematical footing and helps to identify the problems that still prevent us from calling it a "proof". |
Princeton University Graduate Student Seminar | |
Topic: | TBA |
Presenter: | Andrew Snowden, Princeton University |
Date: | Wednesday, October 19, 2005, Time: 12:30 p.m., Location: Fine Hall 224 |
Statistical Mechanics Seminar | |
Topic: | Entropy and chaos in the Kac model |
Presenter: | Michael Loss, Georgia Tech |
Date: | Wednesday, October 19, 2005,Time: 2:00 p.m., Location: Jadwin 343 |
Abstract: | In his 1956 paper Mark Kac investigated the probabilistic foundations of kinetic theory. Introducing an N-particle master equation he was able to derive a spatially homogenous, nonlinear model Boltzmann equation in the limit as N --> \infty. Key was the notion of `chaotic sequence' (which Kac called `sequences having the Boltzmann property'). I will review various aspects of this topic. |
Discrete Mathematics Seminar | |
Topic: | The minimum spanning tree and other problems for random subgraphs |
Presenter: | Jan Vondrak, Microsoft Research |
Date: | Wednesday, October 19, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
Abstract: | See http://www.math.princeton.edu/~bsudakov/vondrak2005-2006.pdf |
Department Colloquium | |
Topic: | Bi-Lipschitz and coarse invariants |
Presenter: | Assaf Naor, Microsoft Research |
Date: | Wednesday, October 19, 2005,Time: 4:30 p.m., Location: Fine Hall 314 |
Abstract: | In this talk we will discuss the problem of finding geometric invariants of metric spaces which can be used to prove bi-Lipschitz and coarse nonembeddability results. This topic is largely motivated by recent applications to geometric group theory and theoretical computer science, as well as Banach space theory, from which many of the problems and methods originated. In particular, we will discuss ways to transfer the theory of type, cotype and uniform convexity to the context of arbitrary metric spaces, and present some applications to embedding theory and the Lipschitz extension problem. |
Operations Research and Financial Engineering Seminar *** Please note special date | |
Topic: | Principal-Agent Problems in Continuous Time |
Presenter: | Jaksa Cvitanic, Caltech |
Date: | Thursday, October 20, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
Abstract: | We consider a framework in which the principal hires an agent to perform a given task. The principal offers the agent a contract, which is a random payoff paid at the terminal date. The agent can control both the drift and the volatility of the underlying process. We characterize optimal contracts in terms of a solution to a Forward-Backward Stochastic Differential Equations (FBSDE) system. We consider two different frameworks. In the first framework, the principal and the agent both have full information on the agent's actions; in examples, we show that if the principal and the agent have the same CRRA utility, or they both have (possibly different) CARA utilities, the optimal contract is (ex-post) linear; if they have different CRRA utilities, the optimal contract is nonlinear, and can be of the call option type. In the second framework, the principal cannot observe the agent's actions; For the case of quadratic cost and separable utility, the optimal contracts can be obtained as a solution to a simple BSDE. |
Topology Seminar | |
Topic: | Periodic solutions of Hamilton's equations on Tori |
Presenter: | Nancy Hingston, the College of New Jersey |
Date: | Thursday, October 20, 2005, Time: 4:30 p.m., Location: Fine Hall 314 |
Abstract: | Let the torus T^2n carry the standard symplectic structure, and a Hamiltonian function H of period 1 in the time variable. By the Arnold Conjecture, proved for the torus by Conley and Zehnder, the Hamiltonian flow has at least 2n+1 orbits of period 1. Conley and Zehnder also proved, under the additional assumption that all period 1 orbits are nondegenerate: If there are only finitely many orbits of period 1, then there are orbits of arbitrarily large minimal (integer) period. We prove this statement also holds in the degenerate case. Thus there are always infinitely many orbits of integer period. This settles a conjecture of Conley for the torus; this conjecture is still open for other compact symplectic manifolds. |
Geometric Analysis Seminar | |
Topic: | Local smooth solutions to degenerate hyperbolic Monge-Ampere equations |
Presenter: | Qing Han, University of Notre Dame |
Date: | Friday, October 21, 2005, Time: 3:00 p.m., Location: Fine Hall 314 |
Abstract: | In this talk, we shall discuss the existence of local smooth solutions to degenerate hyperbolic Monge-Ampere type equations, which include as special cases the equation of prescribing Gauss curvature in $n$-space and Darboux equation for the isometric embedding of surfaces in 3-space. We shall prove the existence of local smooth solutions by imposing a certain condition on the zero set of directional derivatives of (nonpositive) Gauss curvature. The Gauss curvature is allowed to degenerate at arbitrary degree. |
Geometric Analysis Seminar *** Please note special time | |
Topic: | The Monge-Ampere operator and geodesics in the space of Kahler metrics |
Presenter: | Jacob Sturm, Rutgers University |
Date: | Friday, October 21, 2005, Time: 4:00 p.m., Location: Fine Hall 314 |
Abstract: | Let L be an ample line bundle on a compact complex manifold X, and let H be the space of Kahler metrics in the first Chern class of L. We shall prove that the geodesics in the infinite dimensional symmetric space H can be uniformly approximated by geodesics in the finite dimensional symmetric spaces H_k = GL(N_k+1)/U(N_k+1), where N_k is the dimension of the space of global sections of L^k. Thus the H_k are becoming flat inside H as k tends to infinity. |
OCTOBER 24 - OCTOBER 28, 2005 |
|
PACM Colloquium | |
Topic: | Sparse recovery |
Presenter: | Terence Tao, Mathematics, University of California, Los Angeles |
Date: | Monday, October 24, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Abstract: | Suppose one is given a small number of (possibly noisy) linear measurements of a signal. If the number of measurements is less than the number of degrees of freedom of the signal, then one of course cannot reconstruct the signal from the measurements in general. But if one makes the additional hypothesis that the signal is sparse, or at least compressible, then it does become possible to recover the signal accurately, stably, and quickly. The key is decoherence: the measurement basis has to be very "skew" with respect to the sparsity basis. We will survey a number of recent theoretical developments of this idea by several groups and in several contexts (Fourier reconstruction, linear codes, statistical selection.) |
Joint Princeton University and Institute for Advanced Study Special Seminar | |
Topic: | TBA |
Presenter: | Michael Benedicks, KTH Stockholm |
Date: | Tuesday, October 25, 2005, Time: 3:15 p.m., Location: IAS SH-101 |
Operations Research and Financial Engineering Seminar | |
Topic: | Exact Simulation of Stochastic Volatility and Other Affine Jump Diffusion Processes |
Presenter: | Mark Broadie, Columbia University |
Date: | Tuesday, October 25, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
Abstract: | The stochastic differential equations for affine jump diffusion models do not yield exact solutions that can be directly simulated. Discretization methods can be used for simulating security prices under these models. However, discretization introduces bias into the simulation results and a large number of time steps may be needed to reduce the discretization bias to an acceptable level. This paper suggests a method for the exact simulation of the stock price and variance under Heston's stochastic volatility model and other affine jump diffusion processes. The sample stock price and variance from the exact distribution can then be used to generate an unbiased estimator of the price of a derivative security. We compare our method with the more conventional Euler discretization method and demonstrate the faster convergence rate of the error in our method. Specifically, our method achieves an O(s^{-1/2}) convergence rate, where s is the total computational budget. The convergence rate for the Euler discretization method is O(s^{-1/3}) or slower, depending on the model coefficients and option payoff function. (This is joint work with Ozgur Kaya) |
Princeton University Graduate Student Seminar | |
Topic: | Regular Homotopy Classes of Singular Maps |
Presenter: | Andras Juhasz, Princeton University |
Date: | Wednesday, October 26, 2005, Time: 12:30 p.m., Location: Fine Hall 224 |
Abstract: | Two locally generic maps $f,g : M^n --> R^{2n-1}$ are called regularly homotopic if they lie in the same path-component of the space of locally generic maps. Our main result is that if $n$ is not equal to $3$ and $M^n$ is a closed n-manifold then the regular homotopy class of every locally generic map $f : M^n --> R^{2n-1}$ is completely determined by the number of its singular points provided that $f$ is singular (i.e., $f$ is not an immersion). In the case $n=3$ a geometric classification is given for immersions of orientable $3$-manifolds into $5$-space up to regular homotopy. |
Discrete Mathematics Seminar | |
Topic: | Hyperbolic van der Warden and Valiant Schrijver conjectures |
Presenter: | Leonid Gurvits, Los Alamos Laboratory |
Date: | Wednesday, October 26, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
Abstract: | See http://www.math.princeton.edu/~bsudakov/gurvitz.pdf |
Special Analysis Seminar *** Please note special time, date, and location | |
Topic: | Variations around the Ginzburg-Landau model for a superconducting cylinder |
Presenter: | Myrto Sauvageot, Laboratoire Jacques-Louis Lions |
Date: | Wednesday, October 26, 2005, Time: 3:00 p.m., Location: Fine Hall 601 |
Analysis Seminar | |
Topic: | Functional versions of some Geometric Inequalities |
Presenter: | Vitali Milman, University of Tel Aviv |
Date: | Thursday, October 27, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Topology Seminar | |
Topic: | Volume and angle structures on 3-manifolds |
Presenter: | Feng Luo, Rutgers University |
Date: | Thursday, October 27, 2005, Time: 4:30 p.m., Location: Fine Hall 314 |
Abstract: | We introduce a finite dimensional variational approach to find constant curvature metrics on triangulated closed 3-manifolds. The approach is based on the Schlaefli formula for volume of tetrahedra. Schlaefli formula suggests that the volume is best expressed in terms of dihedral angles than in edge lengths. Based on this observation, we defined the concept of an angle structure on a tetrahedron and on a triangulated closed 3 manifold, and defined their volume. These are natural generalizations of constant sectional curvature metrics and their volume. It is shown that the volume functional can be extended continuously to the compact closure of the moduli space of angle structure, verifying a conjecture of John Milnor. The main result shows that for a 1-vertex triangulation of a closed 3-manifold if the volume function on the moduli space of all angle structures has a local maximum point, then either the manifold admits a constant curvature Riemannian metric, or the manifold is reducible. |
NOVEMBER 7 - 11, 2005 |
|
PACM Colloquium | |
Topic: | Bounds on the Optimal Density of Sphere Packings in High Dimensions |
Presenter: | Sal Torquato, Chemistry, Princeton University |
Date: | Monday, November 7, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Abstract: | Sphere packings in high dimensions are of great interest to mathematicians and physicists, and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the maximal packing density due to Minkowski in d-dimensional Euclidean space \Re^d. The asymptotic behavior of this bound is controlled by 2^{-d} in high dimensions. Using an optimization procedure that we introduced earlier [1] and a conjecture concerning the existence of disordered sphere packings in \Re^d, we obtain a provisional lower bound on the density whose asymptotic behavior is controlled by 2^{-0.7786}, thus providing the putative exponential improvement of Minkowski's bound [2]. The conjecture states that a hard-core nonnegative tempered distribution is a pair correlation function of a translationally invariant disordered sphere packing in \Re^d for asymptotically large d if and only if the Fourier transform of the autocovariance function is nonnegative. The conjecture is supported by two explicit analytically characterized disordered packings, numerical simulations in low dimensions, and known necessary conditions that only have relevance in very low dimensions. A byproduct of our approach is an asymptotic lower bound on the average kissing number whose behavior is controlled by 2^{0.2213}, which is to be compared to the best known asymptotic lower bound on the individual kissing number of 2^{0.2075}. Interestingly, our optimization procedure is precisely the dual of a primal linear program devised by Cohn and Elkies [3] to obtain upper bounds on the density, and hence has implications for linear programming bounds.
|
Algebraic Geometry Seminar | |
Topic: | TBA |
Presenter: | Ch. Hacon, University of Utah |
Date: | Tuesday, November 8, 2005, Time: 4:30 p.m., Location: Fine Hall 322 |
Operations Research and Financial Engineering Seminar | |
Topic: | TBA |
Presenter: | Kharen Musaelian, JP Morgan |
Date: | Tuesday, November 8, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
Discrete Mathematics Seminar | |
Topic: | TBA |
Presenter: | Dhruv Mubayi, University of Illinois at Chicago |
Date: | Wednesday, November 9, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
Department Colloquium | |
Topic: | TBA |
Presenter: | Christopher Hacon, University of Utah |
Date: | Wednesday, November 9, 2005, Time: 4:30 p.m., Location: Fine Hall 314 |
Analysis Seminar | |
Topic: | Long range scattering for the Maxwell-Schroedinger system |
Presenter: | Giorgio Velo, Universitã di Bologan and INFN |
Date: | Thursday, November 10, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Geometric Analysis Seminar | |
Topic: | TBA |
Presenter: | Xiaodong Wang, Michigan State University |
Date: | Friday, November 11, 2005, Time: 3:00 p.m., Location: Fine Hall 314 |
NOVEMBER 14 - 18, 2005 |
|
PACM Colloquium | |
Topic: | Homological Methods for Sensor Networks |
Presenter: | Robert Ghrist, Mathematics, University of Illinois |
Date: | Monday, November 14, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Abstract: | As sensor engineering and manufacturing evolve to produce smaller devices, we will have the problem of dealing with large numbers of very localized objects. What types of global problems can be solved by a swarm of local sensors? Topologists solved a similar problem nearly a century ago. This talk will demonstrate the surprising effectiveness of homology theory in sensor networks. |
Algebraic Geometry Seminar | |
Topic: | Quasi-reductive group schemes |
Presenter: | Gopal Prasad, IAS |
Date: | Tuesday, November 15, 2005, Time: 4:30 p.m., Location: Fine Hall 322 |
Operations Research and Financial Engineering Seminar | |
Topic: | TBA |
Presenter: | Adrian Lewis, Cornell University |
Date: | Tuesday, November 15, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
NOVEMBER 21 - 25, 2005 |
|
PACM Colloquium | |
Topic: | Seismic tomography: some mathematical aspects |
Presenter: | Guust Nolet, Geosciences, Princeton University |
Date: | Monday, November 21, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Abstract: | "Seismic tomography" is the term geophysicists use for a collection of methods to use seismic waves to image the interior of the Earth, much like in a CAT scan. Tomographic imaging has led to important discoveries, such as the observation that ocean floor subducts to the bottom of the Earth's mantle and - more recently - that plumes of hot material rise up from the lower mantle. In its simplest form, the approximations of geometrical optics are applied to high frequency seismic waves. These waves then follow raypaths and the most useful observable is a travel time along the ray: T = \int ds / v(r). In a typical interpretation, \mathcal O (10^6) data with a signal-to-noise ratio of order 1 are inverted for \mathcal O (10^4-10^5) parameters. The mathematical challenge is mostly that of an adequate regularization of the problem that minimizes artifacts. More accurate travel time measurements can be obtained using cross-correlation on digital seismograms with sensitivity to lower frequency. For such waves a first order perturbation theory is needed to include the effects of wave diffraction around small anomalies. The travel time becomes then frequency dependent, and T is given by a volume integral, with an increase by several orders of magnitude in the numerical effort. Finally, for the lowest frequency waves we use the whole waveform as data. These waveforms can be modeled by summation of normal modes, but the problem is inherently nonlinear and again a ray approximation is needed to render the inverse problem feasible. The challenge is to relax this constraint and take effects of diffraction into account. We shall speculate about the possible role of wavelets in meeting these challenges. |
Special Topology Seminar *** Note special date | |
Topic: | TBA |
Presenter: | Ilya Kapovich, University of Illinois (Urbana/Champaign) |
Date: | Tuesday, November 22, 2005, Time: 4:30 p.m., Location: Fine Hall 314 |
Discrete Mathematics Seminar | |
Topic: | TBA |
Presenter: | Jozsef Beck, Rutgers University |
Date: | Wednesday, November 23, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
NOVEMBER 28 - DECEMBER 2, 2005 |
|
PACM Colloquium | |
Topic: | TBA |
Presenter: | Maria Reznikoff, Mathematics, Princeton University |
Date: | Monday, November 28, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Operations Research and Financial Engineering Seminar | |
Topic: | TBA |
Presenter: | Tom Salisbury, York University |
Date: | Tuesday, November 29, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
Discrete Mathematics Seminar | |
Topic: | TBA |
Presenter: | Ben Green, Clay Institute, University of Bristol and MIT |
Date: | Wednesday, November 30, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
Department Colloquium | |
Topic: | TBA |
Presenter: | Yum-Tong Siu, Harvard University |
Date: | Wednesday, November 30, 2005, Time: 4:30 p.m., Location: Fine Hall 314 |
DECEMBER 5 - 9, 2005 |
|
PACM Colloquium | |
Topic: | The Boosting Approach to Machine Learning |
Presenter: | Robert Schapire, Computer Science, Princeton University |
Date: | Monday, December 5, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Abstract: | Machine learning studies the design of computer algorithms that automatically make predictions about the unknown based on past observations. Often, the goal is to learn to categorize objects into one of a relatively small set of classes. Boosting, one method for solving such learning problems, is a general technique for producing a very accurate classification rule by combining rough and moderately inaccurate "rules of thumb." While rooted in a theoretical framework of machine learning, boosting has been found to perform quite well empirically. After introducing the boosting algorithm AdaBoost, I will explain the underlying theory of boosting, including our explanation of why boosting often does not suffer from overfitting. I also will touch on some of the other theoretical perspectives on boosting, and describe some recent applications and extensions. |
Operations Research and Financial Engineering Seminar | |
Topic: | TBA |
Presenter: | Paolo Guasoni, Boston University |
Date: | Tuesday, December 6, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
Discrete Mathematics Seminar | |
Topic: | TBA |
Presenter: | Mario Szegedy, Rutgers University |
Date: | Wednesday, December 7, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |
Geometric Analysis Seminar | |
Topic: | TBA |
Presenter: | Pierre Albin, MIT |
Date: | Friday, December 9, 2005, Time: 3:00 p.m., Location: Fine Hall 314 |
DECEMBER 12 - DECEMBER 16, 2005 |
|
PACM Colloquium | |
Topic: | Turbulence and Large-scale Geophysical Circulations |
Presenter: | Geoff Vallis, Geosciences/Atmospheric & Oceanic Sciences, Princeton University |
Date: | Monday, December 12, 2005, Time: 4:00 p.m., Location: Fine Hall 214 |
Operations Research and Financial Engineering Seminar | |
Topic: | TBA |
Presenter: | Pierre-Louis Lions |
Date: | Tuesday, December 13, 2005, Time: 4:30 p.m., Location: Room E-219, Engineering Quad |
Discrete Mathematics Seminar | |
Topic: | TBA |
Presenter: | Prasad Tetali, Georgia Tech |
Date: | Wednesday, December 14, 2005, Time: 2:15 p.m., Location: Fine Hall 224 |