Mathematics and Statistics

University of Calgary

Submitted by ccunning on Mon, 11/01/2010 - 10:07am.

The **PIMS Voyageur Colloquium** provides a forum for researchers to give a colloquium-style talk in Calgary while traveling home from the Banff International Research Station (BIRS). An honorarium and one night at the Hotel Alma are provided by the PIMS Calgary Office. To organize a speaker please contact the PIMS Calgary Site Director. To look for potential speakers follow the link to the BIRS Events Calendar and browse the upcoming events. Confirmed participants are listed on each event web page.

Submitted by ppaterso on Tue, 03/12/2013 - 1:02pm.

Mar 15 2013 - 4:00pm

Mar 15 2013 - 5:00pm

Speaker:

Dr. Peter Pivovarov, University of Missouri

Location:

MS431Given a sample of random vectors drawn from the standard Gaussian distribution, there is a variety of associated random convex sets. For instance, taking the convex hull of the vectors gives rise to a Gaussian random polytope

Submitted by ccameron on Tue, 05/29/2012 - 10:05am.

Jun 5 2012 - 3:00pm

Speaker:

Karl Dilcher, Dalhousie University

Location:

MS 431We derive new identities for a polynomial analogue of the Stern sequence and define two subsequences of these polynomials. We obtain various properties for these two interrelated subsequences which have 0-1 coefficients and can be seen as extensions or analogues of the Fibonacci numbers. We also define two analytic functions as limits of these sequences.

As an application we obtain evaluations of certain finite and infinite continued fractions whose partial quotients are doubly exponential.

In a case of particular interest, the set of convergents has exactly two limit points. (Joint work with K.B. Stolarsky).

We derive new identities for a polynomial analogue of the Stern sequence and define two subsequences of these polynomials. We obtain various properties for these two interrelated subsequences which have 0-1 coefficients and can be seen as extensions or analogues of the Fibonacci numbers. We also define two analytic functions as limits of these sequences.

As an application we obtain evaluations of certain finite and infinite continued fractions whose partial quotients are doubly exponential. In a case of particular interest, the set of convergents has exactly two limit points. (Joint work with K.B. Stolarsky).

Submitted by ccameron on Thu, 05/24/2012 - 3:48pm.

May 25 2012 - 11:00am

Speaker:

**Dr. Stefan Wild, **Argonne National Laboratory

Location:

MS 325Computational noise in deterministic simulations is as ill-defined a concept as can be found in scientific computing. Roundoff errors, discretizations, numerical solutions to systems of equations, and adaptive techniques can destroy the smoothness of the processes underlying a simulation. Such noise complicates optimization, sensitivity analysis, and other applications that depend on the simulation output.

Submitted by ccameron on Wed, 05/23/2012 - 3:33pm.

May 28 2012 - 10:00am

May 28 2012 - 11:00am

Speaker:

**Dr. ****Dimitris Bertsimas**

Location:

MS 325Modern probability theory, whose foundation is based on the axioms set forth by Kolmogorov, is currently the major tool for performance analysis in stochastic systems. While it offers insights in understanding such systems, probability theory is really not a computationally tractable theory. Correspondingly, some of its major areas of application remain unsolved when the underlying systems become multidimensional: Queueing networks, network information theory, pricing multi-dimensional financial contracts, auction design in multi-item, multi-bidder auctions among others.

Submitted by ccunning on Mon, 04/02/2012 - 11:22am.

May 28 2012 - 2:00pm

May 28 2012 - 3:00pm

Speaker:

Henry Wolkowicz, University of Waterloo

Location:

MS 431**Taking advantage of Degeneracy in Cone Optimization; Applications to Euclidean Distance Completion Problems including: Sensor Network Localization and Molecular Conformation. **

The elegant theoretical results for strong duality and strict complementarity for linear programming, LP, lie behind the success of current algorithms. However, the theory and preprocessing techniques that are successful for LP can fail for cone programming over nonpolyhedral cones.