Day 1--Thursday 21 March -- Place: CNN
A-211
8:00 Registration
8:30 Coffee & Cookies
9:00 Welcome & Introduction (M. R. Emamy-K)
9:30 INVITED PRESENTATION
Victor Klee, Some Unsolved Problems on Hypercubes and
their Relatives
10:30 Coffee Break
11:00 INVITED PRESENTATION
Zoltán Füredi, On the Maximum Size of (p, q)-Free
Families
12:00 Lunch
Break
02:00 LECTURE
Warren Adams, Computing Polyhedral Relaxations of Discrete Sets: a Special Case Yielding the Convex Hull
02:30 LECTURE
Martin Ziegler, Algorithmic Approaches to the Cut Number Problem
03:00 LECTURE
Puhua Guan, List of the Cut Complexes According to their Maximum False Points 3:30 Coffee Break
04:00 LECTURE
Andre Kundgen, Minimum Average Distance Subsets In
the Hypercube
Day 2--Friday 22 March -- Place: CNN
A-211
8:30 Coffee & Cookies
9:00 INVITED PRESENTATION
Kevin Phelps,Coding Theory and Hypercubes
10:00 Coffee Break
10:30 INVITED PRESENTATION
Joseph Rifà, Propelinear Codes, 1-Perfect Propelinear
Codes and 1-Perfect Partitions
11:30 Lunch Break
01:30 LECTURE
Italo Dejter, STS Graphs of Vasilev Codes Mod Kernel
02:00 LECTURE
Cristina, Fernandez, Every Z2k-Code Accepts a Representation as Binary Propelinear Code
02:30 LECTURE
Ghidewon Abay-Asmerom, Imbeddings of Graph Products Where the Second Factor is an n-Cube.
3:00 Coffee Break
03:30 LECTURE
Heeralal Janwa, The Projective Hypercube and its Properties and Applications
04:00 LECTURE
Miklos Ruszinko, Regular Superimposed Codes
Day 3--Friday 23 March -- Place: CNN
A-211
8:30 Coffee &Cookies
09:00 LECTURE
Lida, Uribe, The Cut Number of the 5-Cube and a Geometric
Approach
10:30 Coffee Break
11:00 PROBLEM SESSIONS
12:00 Lunch Break
01:00 Trip To Old San Juan