CMD_11

Welcome to the Department of Mathematics

file
file

Event: 56th annual meeting of the Canadian Operational Research Society (CORS) in Ottawa.

As in the past two years, we encouraged the undergraduates in Math 402W Operations Research Clinic to submit their projects to the CORS undergraduate student paper competition.  And, once again, they won both prizes.  This year, all 3 projects submitted were chosen as finalists, and presented their work at the meeting. (The fourth finalist was from the University of Alberta; nine entries were received.)  Congratulations go to:

Winners:
Kishley Bhalla, Craig Mathews, W. Brett Robinson and Katie Sclater "Selecting Optimal Tolling Levels: A Case Study for the Fraser River in the Greater Vancouver Area"

Honourable Mention:
Nicole Mo, Alborz Namazi, Joyce Tai and Eric Yuen "Optimal Locations of Telecommunication Equipment: A Case Study for the City of Richmond, British Columbia, Canada"

Finalists:
Kingsley Cheang, Feiqi He, Sarah Lin and Ashlie Neufelt "The Community Mailbox Location-Routing Problem"

Additionally, Second Prize in the CORS Practice Competition went to Daniel Karapetyan (SFU Math postdoc 2011-13) and Abraham Punnen, for their paper "Operational Research Models and Algorithms for Fleet Size Planning and Schedule Optimisation for the British Columbia Ferry Services Inc."  Finalists for the practice competition included teams from the University of Toronto and IBM, first prize went to UOIT.

file
file

Daily News

Upcoming Events

  • Math Success Seminar
    4:30 PM - 5:30 PM
    September 22, 2014
    Math Success Seminar Monday, September 22, 2014 IRMACS Theatre/ 4:30pm-5:20pm
  • Brad Jones, M.Sc. Thesis Defence, Mathematics Room: PIMS 8500 TASC II
    10:30 AM - 12:30 PM
    September 25, 2014
    Sr. Supervisor: Karen Yeats Title: On tree hook length formulae, Feynman rules and B-series Abstract: This thesis relates similar ideas from enumerative combinatorics, Hopf algebraic quantum field theory and differential analysis. Hook length formulae, from enumerative combinatorics, are equations that can lead to bijections between tree classes and other combinatorial classes. Feynman rules are maps used in quantum field theory to generate integrals from particle interaction diagrams. Here we consider Feynman rules from the Hopf aslgebra perspective. $B$-series are powers series that sum over trees and are used in differential analysis to analyze Runge-Kutta method. The aim of this thesis is to bring together the ideas of the three communities. We show how to use differential equations to obtain new hook length formulae. Some of these new hook length formulae result in new combinatorial bijections. We use hook length formulae to express differential equations combinatorially. We also provide a generalization to hook length. Finally we include a catalogue of known hook length formulae.
  • IRMACS Retreat
    October 6-7, 2014
    No Description
  • Download .ics