Hello, my name is Adam Marcus and I am a Gibbs Assistant Professor in Applied Mathematics at Yale University. I received my B.A./M.A. in Mathematics from Washington University in St. Louis in 2003 and my Ph.D. in Algorithms, Combinatorics, and Optimization under the supervision of Prasad Tetali from Georgia Tech in 2008.

I can be reached at:
Department of Computer Science
Yale University
PO Box 208285
New Haven, CT 06520-8285

Office: AKW 207a
Email: FIRSTNAME (dot) LASTNAME (at) yale (dot) edu

Teaching:

For Gil's Combinatorics class, a Walkthrough of Szemerédi Regularity Lemma (comments and corrections welcome).

Fall 2008: AMTH 110 Intro to Quantitative Reasoning.

You may turn in HW's during class, in my mailbox, or in my office. To get to my mailbox, as soon as you enter the two front doors of AKW, do a U-turn to your left. My box is near the very bottom left (and has my name on it).

Here are some guidelines that you should look at should you find you want to meet with me.

Research Interests:

My main interests are in Extremal Combinatorics. Specifically, I tend to like Turán-type problems, pattern avoidance, and set intersection properties. And some sort of ordering usually pops up somewhere.

I am also intrigued by the overlaps in various areas in mathematics. In particular, two areas that fascinate me are the interplay between Algebraic Topology, Combinatorics, and LP duality, and the interplay between Information Theory, Regularity, Pseudorandomness, and Spectral Analysis.

People I work/worked/will work with:

Before Georgia Tech, I spent a year in Budapest working with Gábor Tardos at the Rényi Institute. While there, I took a minor detour to work with Martin Klazar at Charles University in Prague. I also spent Summer 2006 visiting the Theory Group at Microsoft Research to work with Laci Lovász and Fall 2006 visiting Tel Aviv University to work with Noga Alon.

As a side project, I had the pleasure of working on a problem known as the Hexagramma Mysticum (specifically, the combinatorial aspects of it) with Steve Sigur.

As another side project, I am helping to write the search algorithms for www.8coupons.com, a website that offers coupons for small local businesses (currently just in New York City).

Papers:

(in reverse chronological order)
  1. M. Madiman, A. Marcus, P. Tetali, On the entropy of sums and cardinalities of compound sets, in preparation. PDF
  2. A. Marcus, P. Tetali, A Note on Sumsets Using Entropy, preprint, 2008. PDF PS BibTeX entry
  3. M. Klazar, A. Marcus, Extensions of the linear bound in the Füredi-Hajnal conjecture, Adv. in Appl. Math. 38 (2006), no. 2, 258-266. PDF PS BibTeX entry
  4. A. Marcus, G. Tardos, Intersection reverse sequences and geometric applications, J. Combin. Theory Ser. A 113 (2006), no. 4, 675-691. PDF PS BibTeX entry
    (Preliminary version appeared in GD 2004 (J. Pach, ed.), LNCS, no. 3383, 2004, 349-359)
  5. A. Marcus, G. Tardos, Excluded permutation matrices and the Stanley-Wilf conjecture, J. Combin. Theory Ser. A 107 (2004), no. 1, 153-160. PDF PS BibTeX entry
  6. R. Kawai, A. Marcus, Negative Conductance in Two Finite-size Coupled Brownian Motor Models, manuscript (2000). PDF PS BibTeX entry
  7. J. Goodwin, D. Johnston, A. Marcus, Radio Channel Assignments, UMAP Journal 21.3 (Fall 2000), 369-378. Preprint version: PS PDF BibTeX entry **DISCLAIMER**: This paper was written as a contest entry to the MCM 2000 competition, which took place over a span of 4 days (not much time). It is here because it has some mathematical value, but there are some mistakes so please read at your own risk!!

Links related to my research:

Other (still mostly math) links:

THIS PAGE IS NOT A PUBLICATION OF YALE UNIVERSITY AND YALE UNIVERSITY HAS NOT EDITED OR EXAMINED THE CONTENT. THE AUTHOR(S) OF THE PAGE ARE SOLELY RESPONSIBLE FOR THE CONTENT.