• Discrete compressed sensing: lattices and frames (Josiah Park, Georgia Tech)

    Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

    Lattice valued vector systems have taken an important role in packing, coding, cryptography, and signal processing problems.  In compressed sensing, improvements in sparse recovery methods can be reached with an additional  assumption that the signal of  interest is lattice  valued, as demonstrated by A.  Flinth  and G. Kutyniok. Equiangular  tight  frames are  particular systems  of […]

  • The Roger-Yang Arc Algebra (Helen Wong, CMC)

    Roberts North 104, CMC 320 E. 9th St., Claremont, CA, United States

      Based on geometric considerations, J. Roger and T. Yang in 2014 defined a version of the Kauffman bracket skein algebra for punctured surfaces that includes arcs going from puncture to puncture. We'll provide a brief survey of known results about this arc algebra. In particular, I'd like to mention a recent algebraic result whose […]

  • Lattices from group frames and vertex transitive graphs (Lenny Fukshansky, CMC)

    Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

    Tight frames in Euclidean spaces are widely used convenient generalizations of orthonormal bases. A particularly nice class of such frames is generated as orbits under irreducible actions of finite groups of orthogonal matrices: these are called irreducible group frames. Integer spans of rational irreducible group frames form Euclidean lattices with some very nice geometric properties, […]

  • Subgraph statistics (Benny Sudakov, ETH Zurich)

    Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

    Given integers $k,l$  and a graph $G$, how large can be the fraction of $k$-vertex subsets of $G$ which span exactly $l$ edges?  The systematic study of this very natural  question  was recently initiated by Alon, Hefetz, Krivelevich and Tyomkyn who also proposed several interesting conjectures on this topic. In this talk we discuss a theorem […]

  • Job Talk – Nicole Fider, UC Irvine

    Candidate for Assistant Professor in Mathematics, Scripps College A surprising application of mathematics:  How to name a color Your brain likes patterns and categories; by grouping related ideas together, it can store and recall information quickly.  Real-life continuous domains (like time and taste) are inherently composed of infinitely many points of information, which your brain […]

  • Knowledge, strategies, and know-how (Pavel Naumov, CMC)

    Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

    An agent comes to a fork in a road. There is a sign that says that one of the two roads leads to prosperity and another to death. The agent must take the fork, but she does not know which road leads where. Does the agent have a strategy to get to prosperity? On one […]