Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Monday, October 24, 2022 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Guillermo Nunez Ponasso

Title: Hadamard’s Maximal Determinant Problem and Generalisations

Speaker: Guillermo Nunez Ponasso
Affiliation: Worcester Polytechnic Institute
Location: Please contact Sabrina Lato for Zoom link

Abstract:  Any matrix $M$ of order $n$ with entries taken from the complex unit disk satisfies Hadamard’s determinantal inequality $|\det M|\leq n^{n/2}$. Matrices meeting this bound with equality have pairwise orthogonal rows and columns. Such matrices are known as Hadamard matrices, and character tables of finite abelian groups give examples at every order.

Thursday, October 27, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Anna Pun

Title: A raising operator formula for Macdonald polynomials

Speaker: Anna Pun
Affiliation: CUNY- Baruch College
Location: MC 5479 or contact Olya Mandelshtam for Zoom

Abstract: In this talk, I will give a brief introduction on Catalanimal, a tool that helps us to prove the shuffle theorem under any line, the extended delta conjecture and the Loehr- Warrington conjecture. I will then focus on its variant "Macanimal" which gives us an explicit raising operator formula for the modified Macdonald polynomials. Our method just as easily yields a formula for an infinite series of $GL_l$ characters which truncates to the modified Macdonald polynomials.

Friday, October 28, 2022 9:00 am - Saturday, October 29, 2022 5:00 pm EDT (GMT -04:00)

Workshop on Large Scale Optimization and Applications

Optimization is an important area of applied mathematics that bridges mathematical theory with applications in diverse fields. This Twenty Fourth Annual Midwest Optimization Meeting provides opportunities for researchers in this region with different backgrounds to come together to share their research and teaching experiences, forge collaborations with colleagues from different institutions, and to expose students to applications of mathematical theory. This workshop will focus on bringing together several of the diverse communities working on large scale optimization models that arise from variational problems.

Registration information, schedule, and abstracts click here

Friday, October 28, 2022 12:00 pm - 12:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - Sharat Ibrahimpur

Title: Stochastic Minimum Norm Combinatorial Optimization

Speaker: Sharat Ibrahimpur
Affiliation:  
Location: MC 6029 or contact Rian Neogi for Zoom link

Abstract: In this work, we introduce and study stochastic minimum-norm optimization. We have an underlying combinatorial optimization problem where the costs involved are random variables with given distributions; each feasible solution induces a random multidimensional cost vector. The goal is to find a solution that minimizes the expected norm of the induced cost vector, for a given monotone, symmetric norm.

Friday, October 28, 2022 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Jonathan Eckstein

Title: The ADMM:  Past, Present, and Future

Speaker: Jonathan Eckstein
Affiliation: Rutgers University
Location: MC 5501 or contact Melissa Cambrdige for Zoom link

Abstract: Over the past 15 years, the alternating direction method of multipliers (ADMM) has become a standard optimization method.  This talk will cover the origins of the ADMM, its subsequent development, and what to expect in the future.

Monday, October 31, 2022 11:30 pm - 11:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Ingemar Bengtsson

Title: Equiangular lines and algebraic number theory

Speaker: Ingemar Bengtsson
Affiliation: Stockholm University
Location: contact Sabrina Lato for Zoom link

Abstract: It is believed that SICs, that is maximal equiangular tight frames, exist in all complex vector spaces. To construct them we use the Weyl-Heisenberg groups, and hence the cyclotomic numbers (roots of unity).

Thursday, November 3, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Jeremy Chizewer

Title: The Hat Guessing Number of Graphs

Speaker: Jeremy Chizewer
Affiliation: University of Waterloo
Location: MC 5479 in person

Abstract:  The hat guessing number HG(G) of a graph G on n vertices is defined in terms of the following game: n players are placed on the n vertices of G, each wearing a hat whose color is arbitrarily chosen from a set of q possible colors. Each player can see the hat colors of his neighbors, but not his own hat color. All of the players are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed.

Friday, November 4, 2022 12:00 pm - 12:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - David Aleman

Title: Approximation Algorithms for Stochastic Knapsack 

Speaker: David Aleman
Affiliation: University of Waterloo
Location: MC 6029 or contact Rian Ne

Abstract: The classical Knapsack problem takes as input a set of items with some fixed nonnegative values and weights. The goal is to compute a subset of items of maximum total value, subject to the constraint that the total weight of these elements is at most a given limit. In this talk we review a paper by Gupta, Krishnaswamy, Molinaro and Ravi, in which the following stochastic variation of this problem is considered: the value and weight of each item are correlated random variables with known, arbitrary distributions.

Friday, November 4, 2022 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Jim Geelen

Title: Sylvester, Gallai, and their complex relatives

Speaker: Jim Geelen
Affiliation: University of Waterloo
Location: MC 5501 or contact Melissa Cambridge for Zoom link

Abstract: Given any finite set of points in the real plane, not all collinear, there is a line in the plane that contains exactly two of them. This pretty result was conjectured by Sylvester in 1893 and proved by Gallai in 1944. We will present an extension of the result to higher dimensional complex spaces and discuss some related conjectures. This is joint work with Matthew Kroeker.