Mohamed Omar
Bio/Contact

Teaching

Outreach

Talks



Welcome to my website! I am an Assistant Professor in the Department of Mathematics at Harvey Mudd College.

I am interested in seeing algebra come alive in discrete mathematics, primarily in combinatorics, graph theory and discrete/convex geometry. I am also interested in enumerative and geometric combinatorics. My articles are below.


  1. Neural Ideal Preserving Homomorphisms
    in preparation
    w/ R. Amzi Jeffs, Nora Youngs
  2. A Proof of the Peak Polynomial Positivity Conjecture
    submitted, 7 pp
    w/ Alex Diaz-Lopez, Pamela E. Harris, Erik Insko
  3. Sparse Neural Codes
    submitted, 12 pp
    w/ R. Amzi Jeffs, Natchanon Suaysom, Aleina Wachtel, Nora Youngs
  4. The q-analog of Kostant's partition function and the highest root of the classical Lie algebras
    submitted, 21 pp
    w/ Pamela E. Harris, Erik Insko
  5. What makes a neural code convex?
    submitted, 28 pp
    w/ Carina Curto, Elizabeth Gross, Jack Jeffries, Katherine Morrison, Zvi Rosen, Anne Shiu, Nora Youngs
  6. Low Degree Nullstellensatz Certificates for 3-Colorability
    Electronic Journal of Combinatorics, 23(1), P1.6, 2016.
    w/ Bo Li, Benjamin Lowenstein
  7. Chromatic Bounds on Orbital Chromatic Roots
    Electronic Journal of Combinatorics, 21(4), P4.17, 2014.
    w/ Dae Hyun Kim, Alexander H. Mun
  8. Strong Nonnegatvity and Sums of Squares on Real Varieties
    Journal of Pure and Applied Algebra 217 (5), pp. 843-850, 2013.
    w/ Brian Osserman
  9. On Volumes of Permutation Polytopes
    Fields Institute Communications Vol. 69, Discrete Geometry and Optimization, pp. 55-77, 2013.
    w/ Katherine Burggraf, Jesus De Loera
  10. On The Hardness of Counting and Sampling Center Strings
    IEEE/ACM Transactions on Computational Biology and Bioinformatics Vol. 9 Issue 6, pp. 1843-1846, 2012.
    w/ Christina Boucher
  11. Recognizing Graph Theoretic Properties with Polynomial Ideals
    Electronic Journal of Combinatorics, 17(1), R114, 2010.
    w/ Jesus De Loera, Peter N. Malkin
  12. On The Hardness of Counting and Sampling Center Strings
    Proceedings of the 17th Annual Symposium on String Processing and Information Retrieval, pages 128-135, 2010.
    w/ Christina Boucher
  13. This is the conference version of the journal paper listed above.

  14. Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers
    Discrete Mathematics and Theoretical Computer Science, Fifth Colloquium on Math and Computer Science, pp. 195-206, 2008.
    w/ Christopher Eagle, Zhicheng Gao, Daniel Panario, Bruce Richmond
  15. Asymptotics of Largest Components in Combinatorial Structures
    Algorithmica 46 (3-4), pp. 493-503, 2006.
    w/ Daniel Panario, Bruce Richmond, Jacki Whitely