ABSTRACTS Gil KALAI — Designs exist! [after Peter Keevash] One of the central and oldest problems in combinatorics is: Can you find a collection S of q-subsets from an n-element set X so that every r-subset of X is in

Source URL: www.bourbaki.ens.fr

Japanese-Swiss Workshop on Combinatorics and Computational Geometry June 4-6, 2014 Venue: Sanjo Conference Hall, The University of Tokyo (unless otherwise specified) Program

Source URL: qci.is.s.u-tokyo.ac.jp

c Birkh¨auser Verlag, Basel, 2008 Annals of Combinatorics132 Annals of Combinatorics

Source URL: www.maths.otago.ac.nz

c Birkh¨auser Verlag, Basel, 2004 Annals of Combinatorics-• • • Annals of Combinatorics

Source URL: www.maths.otago.ac.nz

ADDITIVE COMBINATORICS (WINTERAndrew Granville Introduction For A, B subsets of an additive group Z, we define A + B to be the sumset {a +

Source URL: www.dms.umontreal.ca

Optimization over Polynomials: Selected Topics Monique Laurent Abstract. Minimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometr

Source URL: homepages.cwi.nl

Thomas W. Roby Department of Mathematics University of Connecticut 196 Auditorium Road–Unit 3009 Storrs, CT

Source URL: www.math.uconn.edu

• Algebraic combinatorics
• Combinatorics
• Mathematics
• Discrete mathematics
• Jim Propp
• Outline of combinatorics
• Combinatorics and physics

Probabilistic and Extremal Combinatorics Contents 1 Set 1 2

Source URL: dl.dropboxusercontent.com

Combinatorics Meets Ergodic Theory Nikos Frantzikinakis (University of Crete), Bryna Kra (Northwestern University), Julia Wolf (University of Bristol) July, 2015

Source URL: www.birs.ca

multiplex: Analysis of multiple social networks with algebra · Doing combinatorics in R · Antonio Rivero Ostoic ,

Source URL: user2015.math.aau.dk