Mathematics Department

Upcoming Talks

This is a list of all upcoming talks for the next two weeks. Talks are from 3:45-4:45 p.m. in the Colloquium or Seminar Room, unless otherwise specified.

  • Feb
    22
  • Active Learning Lunch
    Group Discussion
    Location: Second conference room
    Time: 12:00 PM
    Teaching Seminar

    View Abstract

    Note that we meet in the 2nd conference room (not our usual location).
  • Feb
    23
  • Matroid Kazhdan-Lusztig Polynomials
    Time: 12:00 PM
    Combinatorics, Algebra, & Topology Seminar

    View Abstract

    Abstract: The classical Kazhdan-Lusztig polynomials associated to a Coxeter group have been studied continuously for nearly 40 years with results relating intersection cohomology groups of Schubert varieties to certain bases of the Hecke algebra and to certain combinatorial objects. The relatively new matroid Kazhdan-Lusztig polynomials have striking similarities to the classical case and have potential for developing new connections. We will review the classical case as well as summarize the main results known for the matroid case. If time permits we will discuss a formula for the matroid Kazhdan-Lusztig polynomials in terms of flag Whitney numbers.
  • Feb
    27
  • Trivial Centralizers of High Complexity Toeplitz Systems
    MIDN 1/C James Talisse
    USNA
    Time: 03:45 PM
    Operator Algebras and Dynamics Seminars

    View Abstract

    Given a dynamical system $(X,G)$, the centralizer consists of all homeomorphisms of $X$ which commute with the action of the group $G$. In this talk we present a construction of Toeplitz systems over $\mathbb{Z}^d$ which have a trivial centralizer. Historically, trivial centralizers arise from zero entropy systems. However this construction can lead to examples of systems with positive entropy and trivial centralizers.
  • Mar
    01
  • Lagrangian Relaxation of the Defender-Attacker-Defender Constrained Shortest Path Problem
    CDR Gary Lazzaro
    USNA
    Time: 03:45 PM
    Colloquium Series

    View Abstract

    Tri-level Defender Attacker-Defender (DAD) optimization models have never been applied to the constrained shortest path problem before. The particular challenge associated the DAD constrained shortest path problem is that an additional side constraint breaks the network structure of a shortest path problem into a more complicated tri-level integer program. We create new solution procedures for the DAD constrained shortest path problem. We merge the attacker model with Lagrangian relaxation of the operator model into a single formulation that can obtain fast heuristic solutions. We combine our heuristic algorithm with traditional methods to obtain provably optimal or near-optimal solutions. We test our algorithms on medium and large networks, and our results show that our innovations can significantly outperform traditional nested decomposition.
  • Mar
    02
  • Alexander Polynomials of Rational Links, I
    Mark Kidwell
    Time: 12:00 PM
    Combinatorics, Algebra, & Topology Seminar
  • Mar
    08
  • Writing Across the Curriculum
    Group Discussion with English Department
    Location: English Department Library
    Time: 12:00 PM
    Teaching Seminar

    View Abstract

    General discussion of topics related to mathematics and writing. This meeting may be especially interesting to instructors of SM291 (Fundamentals of Math) and capstone and honors students.
go to Top