Arun Sharma

Arun Sharma is a Lecturer in the Department of Mathematics at the University of California, Berkeley. He has been teaching at Berkeley since 2010 and is known for his work in combinatorics, Ramsey theory, error-correcting codes, and graph colorings. His research explores structural problems in discrete mathematics.

• Education: Ph.D. in Mathematics (2009) from UC Berkeley, B.A. in Mathematics (2001) from Washington University in St. Louis.

Sharma’s research focuses on combinatorial structures, particularly permutations and sequences avoiding arithmetic progressions. His work intersects with Ramsey theory and applications in error-correcting codes, addressing foundational problems in discrete mathematics.

His publications primarily investigate patterns in permutations and integer sequences, emphasizing avoidance of arithmetic progressions. These studies contribute to broader combinatorial theory and its applications.

• Scientific Awards:
  • Outstanding Instructor Award, UC Berkeley (2017)
  • Outstanding GSI Award, UC Berkeley (2009)
  • Putnam Prize, Washington University (2001)
  • VIGRE Fellowship (2001)
  • Compton Fellow, Washington University (1997)

Sharma has served as a referee for Discrete Mathematics and the American Mathematical Monthly. His own thesis, The Structure of 3-Free Permutations (2009), was advised by Ronald Graham and Mark Haiman.

Contact: asharma18@berkeley.edu | Personal Website