We describe a few applications of semide nite programming in combinatorial optimization Mathematics Subject Classi cation C C C C C R

We provide an introduction to the analysis of random combinatorial structures and some of the associated computational problems. Mathematics Subject Classification (2010). Primary 05C80; Secondary 68Q87.

We summarize some of the recent developments which link certain problems in combinatorial theory related to random growth to random matrix theory. 2000 Mathematics Subject Classification: 60C05.

Doctoral School: Mathematics Director: Miklós Laczkovich, Member of the Hungarian Academy of Sciences Doctoral Program: Applied Mathematics Director: György Michaletzky, Doctor of Sciences Advisor: András Frank, Doctor of Sciences, Professor Co-advisor: Tamás Király, Ph.D. Affiliation: Department of Operations Research, Eötvös Loránd University and Egerváry Research Group on Combinatorial Optim...

We describe some combinatorial problems in finite projective planes and indicate how Rédei’s theory of lacunary polynomials can be applied to them. 2000 Mathematics Subject Classification: 05.

My research interests lie in discrete mathematics and complexity theory (MSC 05, 52, 60, 68) and my research falls mostly into one or more of the following topics: combinatorial probability, computational complexity, combinatorial geometry, random structures, and extremal problems. After a brief overview of my completed research, I will give a more detailed summary of some of its aspects and fu...

In the last decade many important applications of eigenvalues and eigenvectors of graphs in combinatorial optimization were discovered. The number and importance of these results is so fascinating that it makes sense to present this survey. ∗This article appeared in Combinatorial and Graph-Theoretical Problems in Linear Algebra, R. A. Brualdi, S. Friedland, V. Klee, Eds., IMA Volumes in Mathema...

Algebraic combinatorics for computational biology by Nicholas Karl Eriksson Doctor of Philosophy in Mathematics University of California, Berkeley Professor Bernd Sturmfels, Chair Algebraic statistics is the study of the algebraic varieties that correspond to discrete statistical models. Such statistical models are used throughout computational biology, for example to describe the evolution of ...

I am a combinatorialist with diverse interests. The power of combinatorics derives from the wide applicability of its methods. Discrete structures arise throughout mathematics and science, yet all too often combinatorics is unnecessarily done in isolation. I aim to bridge the gap between combinatorics and other fields through collaborations with mathematicians and scientists from varied discipl...