AdvOL Student Seminars and Defences
Joe Guan, January 23, 2018, 15:30-16:00, ITB 201
Speaker:   Joe Guan

Title:  Geometric Aspects of Combinatorial Optimization
 
AdvOL Optimization Seminars
Antoine Deza, January 23, 2018, 16:30-17:30, ITB 201
Speaker:   Antoine Deza
Department of Computing and Software
McMaster University

Title:  On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs
Read more...
 
Fields Institute Industrial Optimization Seminar, January 16, 2018
Speakers:   Paul Ayers (McMaster University)
Jeffrey Kelly (Industrial Algorithms)

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 Tamon Stephen, June 24, 2013, 13:30-14:30, ITB 201
Tuesday, 23 January 2018
 
 
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 % Brazil
 < 1.0 % Educational
 < 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: 5306089
Tamon Stephen, June 24, 2013, 13:30-14:30, ITB 201
Speaker:   Tamon Stephen
Department of Mathematics
Simon Fraser University

Title:  Counting Inequivalent Monotone Boolean Functions

The nth Dedekind number is the numbers of Boolean functions on n variables that are monotone in the sense that when x<=y, then f(x)<=f(y); values are only known only up to n=8. We consider the problem of counting these functions up to equivalence via permutations of the variables, where values were known only up to n=6. We propose a strategy to count inequivalent MBF's by breaking the calculation into parts based on the profiles of these functions. As a result we are able to compute the number of inequivalent MBFs in 7 variables. The number obtained is 490013148.

This is joint work with Timothy Yusun.

 
< 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!