AdvOL Student Seminars and Defences
Asma Paracha, December 12, 2017, 15:30-16:00, ITB 201
Speaker:   Asma Paracha

Title:  Lyndon factors and periodicities in strings
 
AdvOL Optimization Seminars
Alexander Rosa, December 12, 2017, 16:30-17:30, ITB 201
Speaker:   Alexander Rosa
Department of Mathematics & Statistics
McMaster University

Title:  Reaction graphs of combinatorial configurations
Read more...
 
Fields Institute Industrial Optimization Seminar, November 14, 2017
Speakers:   Christopher Swartz (McMaster University)
Jesus Flores-Carrillo (Praxair)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home arrow Seminars arrow Invited seminars arrow Adam Van Tuyl, September 29, 2015, 16:30-17:30, ITB 201
Friday, 24 November 2017
 
 
Main Menu
Home
People
Publications
Software
Events
Awards
Photogallery
Internal pages
Latest Theses
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
Latest Reports
Visitors by region
Totals Top 20
 60 % Unknown
 14 % Commercial
 9 % networks
 6 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Educational
 < 1.0 % Brazil
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5234501
Adam Van Tuyl, September 29, 2015, 16:30-17:30, ITB 201
Speaker:   Adam Van Tuyl
Department of Mathematics and Statistics
McMaster University

Title:   The Waldschmidt constant of squarefree monomial ideals

In this talk, I will introduce the Waldschmidt constant of an ideal in a polynomial ring, and explain why one may be interested in this invariant. Although it is very hard to compute this value, I will show that in the case of squarefree monomial ideals, one can show that the Waldschmidt constant is a solution of a suitable linear program that is constructed from the primary decomposition of the ideal. This leads to a nice combinatorial interpretation of this value in terms of the fractional chromatic number of an associated hypergraph.
 
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>


Latest Publications
Publication Downloads
Error cannot find GD extension
 
Top!
Top!