Amanda Redlich

Assistant Professor of Mathematics

Amanda sitting of the steps of Searles

Contact Information

aredlich@bowdoin.edu
207-725-3566
Mathematics

Searles Science Building - 102


Teaching this semester

MATH 1800. Multivariate Calculus

Amanda Redlich
Multivariate calculus in two and three dimensions. Vectors and curves in two and three dimensions; partial and directional derivatives; the gradient; the chain rule in higher dimensions; double and triple integration; polar, cylindrical, and spherical coordinates; line integration; conservative vector fields; and Green’s theorem. An average of four to five hours of class meetings and computer laboratory sessions per week.

MATH 2601. Combinatorics and Graph Theory

Amanda Redlich
An introduction to combinatorics and graph theory. Topics to be covered may include enumeration, matching theory, generating functions, partially ordered sets, Latin squares, designs, and graph algorithms.

Education

  • B.A. University of Chicago
  • Ph.D. MIT

Research Interests

  • Probabilistic combinatorics, graph theory, randomized algorithms, network science

Publications

  • Amanda Redlich: A power-of-two-choices unbalanced allocation process, SIAM J. Discrete Math, to appear.
  • Robert DeMarco, Amanda Redlich: Graph decomposition and parity, J. Graph Theory 82 (4): 374–386 (2016).
  • J. Augustine, W. K. Moses Jr., A. Redlich, E. Upfal: Ballanced allocation: Patience is not a virtue, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, (2016) 655-671.
  • Robert DeMarco, Jeffry Kahn, Amanda Redlich: Modular statistics for subgraph counts in sparse random graphs, Electronic J. of Combinatorics 22(1): P1.37 (2015).
  • Shabnam Beheshti, Amanda Redlich: Remarks on combinatorial aspects of the KP Equation, Proceedings of the Second International Conference on Nonlinear and Modern Mathematical Physics, AIP Conf. Proc. 1562, 5 (2013).
  • S. Patil, S. Roy, J. Augustine, A. Redlich, A. Deshpande, M. Gharote, S. Lodha, A. Mehrotra, H. Vin: Minimizing Testing Overheads in Database Migration Lifecycle. Proceedings of 16th International Conference on Management of Data (COMAD), 2010. 
  • Igor Pak, Amanda Redlich: Long cycles in abc-permutations.  Functional Analysis and Other Mathematics 2(1): 87-92 (2008).
  • David Eisenstat, Gary Gordon, Amanda Redlich: Combinatorial properties of a rooted graph polynomial. SIAM J. Discrete Math. 22(2): 776-785 (2008)D. Eisenstat, J. Feder, G. Francos, G. Gordon, A. Redlich: Expected rank and randomness in rooted graphs. Discrete Applied Mathematics 156(5): 746-756 (2008)
  • Complete CV (PDFPDF)

Selected Awards

  • Institute for Computation and Experimental Research in Mathematics research fellowship - Spring 2014
  • National Science Foundation Mathematical Sciences Postdoctoral Research Fellowship - Fall 2010- Spring 2013
  • Akamai Presidential Fellowship (MIT) - Fall 2005-Spring 2006

Recent Talks

  • Topology et al. Seminar, Wesleyan University, Nov. 2016 - Graph counting and combinatorial games: A logical connection
  • Special Session on Extremal and Probabilistic Combinatorics, AMS Fall Central Sectional Meeting, University of St. Thomas, Oct. 2016 - The waiting game: Balanced allocation via random choices
  • MSCS Seminar, Macalester College, Oct. 2016 - The best random choice
  • Special Session on New Developments in Graphs and Hypergraphs, AMS Fall Eastern Sectional Meeting, Bowdoin College, Sept. 2016 - Strategic graph decompositions
  • SIAM Workshop on Network Science, Boston MA, July 2016 - Designing exit frequency distance measures for biological networks
  • Randomized Structures and Algorithms, Carnegie Mellon University, July 2015 - Power laws and the power of two choices
  • Colby-Bowdoin-Bates Math Colloquium, April 2015 - There is method in madness: Increasing randomness to decrease randomness
  • ICERM, Providence RI, March 2014 - Subgraphs in random graphs
  • Discrete Mathematics Days in the Northeast, Middletown CT, October 2013 - Parity, first-order logic, and gluing and cutting graphs
  • IAS WAM Research Seminar, Princeton NJ, May 2013 - Gluing graphs, ungluing graphs, and first-order logic with parity
  • DIMACS/CCICADA Interdisciplinary Seminar, Piscataway NJ, April 2013 - Unbalanced allocations and cost minimization
  • Applied Communication Sciences, Basking Ridge NJ, April 2013 - Logic, parity, and counting subgraphs in random graphs
  • Princeton Discrete Mathematics Seminar, Princeton NJ, March 2013 - Graph constructions, graph decompositions, and random graphs