Skip to content
Texas A&M University
Mathematics

Events for 02/02/2018 from all calendars

Brown Bag Lunch Series on Teaching

iCal  iCal

Time: 12:30PM - 1:30PM

Location: Blocker 220

Speaker: Kathryn Bollinger, Texas A&M

Title: Enforcing the Aggie Code of Honor and Preventing Cheating

Abstract: It is university policy for all Aggies to abide by the Aggie Code of Honor. Not all Aggies, however, have followed this policy and have found themselves with an Aggie Honor Code violation. As instructors, how are we to handle Honor Code violations? What can we do to prevent cheating in our courses? What types of things should we be looking for when giving exams and other assignments? This seminar will help answer these questions and any others you might have regarding academic dishonesty.


Newton-Okounkov Bodies

iCal  iCal

Time: 1:00PM - 2:30PM

Location: 624 BLOC

Speaker: Frank Sottile, TAMU

Title: Mixed volumes and an extension of intersection theory of divisors


Algebra and Combinatorics Seminar

iCal  iCal

Time: 3:00PM - 4:00PM

Location: BLOC 628

Speaker: Daniel Creamer, Texas A&M University

Title: A Computational Approach to Classifying Modular Categories by Rank

Abstract: Modular categories are of interest in a variety of disciplines stretching from abstract algebra to theoretical physics. It was recently proved by Bruillard, Ng, Rowell, and Wang, that there are a finite number of modular categories given a fixed rank. I present a computer assisted approach to classifying modular categories by their rank.


Hiring Candidate - Dr. Adam Marcus

iCal  iCal

Time: 4:00PM - 5:00PM

Location: BLOC 220

Speaker: Dr. Adam Marcus

Description:

Title: Polynomial Techniques in Quantitative Linear Algebra

Abstract:

I will discuss a recent line of research that uses properties of real rooted polynomials to get quantitative estimates in combinatorial linear algebra problems. I will start by discussing the main result that bridges the two areas (the "method of interlacing polynomials") and show some examples of where it has been used successfully (e.g. Ramanujan families and the Kadison-Singer problem). I will then discuss some more recent work that attempts to make the method more accessible by providing generic tools and also attempts to explain the accuracy of the method by linking it to random matrix theory and (in particular) free probability. I will end by mentioning some current research initiatives as well as possible future directions.