Combinatorics in OR

M.S. in Mathematics, December 2001 1997 – 2000 Indian Statistical Institute, Kolkata, India B.Stat. (Hons.), June 2000: Graduated First Class with Distinction Employment 2009 – present Yale University Lecturer in Mathematics 2006 – 2009 University of California at Riverside, Riverside, CA Visiting Assistant Professor in Mathematics 2002 – 2006 University of Chicago Lecturer in Mathematics (Graduate Student) in the College Awards and Scholarships 2000-2002 McCormick Fellowship, from the University of Chicago 1998-1999 Awards from the National Board of Higher Mathematics, India 1998 Award from the Indian Statistical Institute, Kolkata, for academic excellence 1997-2000 Student Fellowship, from the Indian Statistical Institute, Kolkata 1996 Indian National Mathematical Olympiad (INMO) Scholarship 1995-1997 National Talent Search (NTSE) Scholarship, from the NCERT, India 1995, 1996 Awards from the Orissa Mathematical Society, for securing the first rank in the Regional Mathematics Olympiads Synergistic activities 2010 Reviewer, Discrete Mathematics. 2010 Designed a Math course in Quantitative Reasoning, approved by Yale College; it teaches students how to “Solve real-life problems without using calculus”. 2009 Organized the Lie Theory Seminar at UC Riverside. 2008 Designed and taught a mini-course on Quivers, with a view toward Gabriel’s theorem in the Lie Theory Seminar, November and December 2008.

[1]  P. Komarek.  Some new good characterizations for directed graphs , 1984 .

[2]  P. Erdös,et al.  Combinatorial Theorems on Classifications of Subsets of a Given Set , 1952 .

[3]  Paul Erdös,et al.  On Ramsey—Turán type theorems for hypergraphs , 1982, Comb..

[4]  Imre Z. Ruzsa,et al.  Arithmetic progressions in sumsets , 1991 .

[5]  Walter Feit,et al.  The nonexistence of certain generalized polygons , 1964 .

[6]  S. Banach,et al.  Sur la décomposition des ensembles de points en parties respectivement congruentes , 1924 .

[7]  András Sárközy,et al.  Finite addition theorems, I , 1989 .

[8]  W. Mader.  Homomorphieeigenschaften und mittlere Kantendichte von Graphen , 1967 .

[9]  Miklós Simonovits,et al.  Compactness results in extremal graph theory , 1982, Comb..

[10]  J. Folkman.  On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence , 1966, Canadian Journal of Mathematics.

[11]  Frank Harary,et al.  Graph Theory , 2016 .

[12]  C. Schensted.  Longest Increasing and Decreasing Subsequences , 1961, Canadian Journal of Mathematics.

[13]  Paul Erdös,et al.  On the connection between chromatic number, maximal clique and minimal degree of a graph , 1974, Discret. Math..

[14]  O. Ore.  Note on Hamilton Circuits , 1960 .

[15]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[16]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[17]  Peter Frankl.  Asymptotic solution of a turán-type problem , 1990, Graphs Comb..

[18]  P. Erdös.  On the structure of linear graphs , 1946 .

[19]  J. Hammersley.  A few seedlings of research , 1972 .

[20]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[21]  Paul Erdös,et al.  On the combinatorial problems which I would most like to see solved , 1981, Comb..

[22]  Joel Friedman,et al.  On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..

[23]  Jacques Tits,et al.  Théorème de Bruhat et sous-groupes paraboliques , 1962 .

[24]  Vojtech Rödl,et al.  The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..

[25]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[26]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[27]  A. R. D. Mathias,et al.  On sequences generic in the sense of Prikry , 1973, Journal of the Australian Mathematical Society.

[28]  Fan Chung Graham,et al.  Regularity Lemmas for Hypergraphs and Quasi-randomness , 1991, Random Struct. Algorithms.

[29]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[30]  H. Jung.  Eine Verallgemeinerung desn-fachen Zusammenhangs für Graphen , 1970 .

[31]  H. Prömel,et al.  Excluding Induced Subgraphs III: A General Asymptotic , 1992 .

[32]  Fred Galvin,et al.  On the Singular Cardinals Problem , 1981 .

[33]  Christian Berg,et al.  A remark on the multidimensional moment problem , 1979 .

[34]  P. Erdos,et al.  A LIMIT THEOREM IN GRAPH THEORY , 1966 .

[35]  E. Szemerédi.  On sets of integers containing k elements in arithmetic progression , 1975 .

[36]  G. Freiman,et al.  Integer Sum Sets Containing Long Arithmetic Progressions , 1992 .

[37]  Bill Broyles.  Notes , 1907, The Classical Review.

[38]  William B. Easton,et al.  Powers of regular cardinals , 1970 .

[39]  B. Logan,et al.  A Variational Problem for Random Young Tableaux , 1977 .