User Tools

Site Tools


seminars:comb:start

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

seminars:comb:start [2026/02/25 13:27]
zaslav [SPRING 2026]
seminars:comb:start [2026/03/25 15:18] (current)
zaslav [SPRING 2026]
Line 92: Line 92:
 **Tuesday, 3/10**\\ **Tuesday, 3/10**\\
 Speaker: Aida Abiad (Amsterdam)\\ Speaker: Aida Abiad (Amsterdam)\\
-Title: \\+Title: ​On weight-equitable partitions and their application to graph theory\\
 Time: 1:30-2:30\\ Time: 1:30-2:30\\
 Location: ​ WH 100E and Zoom  https://​binghamton.zoom.us/​j/​94050971055?​pwd=nmry51RPN2IUT4N2FfK9UxSljuJtqX.1 Location: ​ WH 100E and Zoom  https://​binghamton.zoom.us/​j/​94050971055?​pwd=nmry51RPN2IUT4N2FfK9UxSljuJtqX.1
 +
 +Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several classic eigenvalue bounds. Weight-equitable partitions assign to each vertex a weight that equals the corresponding entry of the Perron eigenvector. ​ In this talk, I will present several applications of such partitions to graph theory problems.
  
 <​HTML><​li></​HTML>​ <​HTML><​li></​HTML>​
 **Tuesday, 3/17**\\ **Tuesday, 3/17**\\
 Speaker: Thomas Galvin (Binghamton)\\ Speaker: Thomas Galvin (Binghamton)\\
-Title: \\+Title: ​Edge Ideals & Graph Matching\\
 Time: 1:30-2:30\\ Time: 1:30-2:30\\
 Location: ​ WH 100E Location: ​ WH 100E
 +
 +For a simple graph G, the edge ideal I(G) over a field K is a monomial ideal generated by the edges of G. The associated primes of powers of such ideals form an ascending chain. In this talk, I prove a key ingredient of this result, concerning maximum matchings of graphs derived from G. The talk is based on a paper by Martínez-Bernal,​ Morey, and Villarreal (2012).
 +
  
 <​HTML><​li></​HTML>​ <​HTML><​li></​HTML>​
 **Tuesday, 3/24**\\ **Tuesday, 3/24**\\
 Speaker: Thomas Martinez (UCLA and Cornell) \\ Speaker: Thomas Martinez (UCLA and Cornell) \\
-Title: \\+Title: ​The Combinatorics of Affine Deodhar Diagrams\\
 Time: 1:30-2:30\\ Time: 1:30-2:30\\
 Location: ​ WH 100E Location: ​ WH 100E
 +
 +Deodhar diagrams (also known as Go diagrams) have been studied due to their relation to the totally non-negative Grassmannian and positroid varieties. In this talk, we introduce affine Deodhar diagrams and study combinatorial moves of these diagrams. We provide geometric analogues of our combinatorial moves, discussing the relationship to (affine patches of) positroid varieties and their cluster structure.
 +
  
 <​HTML><​li></​HTML>​ <​HTML><​li></​HTML>​
Line 127: Line 135:
 Time: 1:30-2:30\\ Time: 1:30-2:30\\
 Location: ​ WH 100E Location: ​ WH 100E
 +
 +This is Mr. Yan's candidacy exam.  The examining committee consists of Laura Anderson, Michael Dobbins, and Thomas Zaslavsky (chair). ​ The talks are open to all.
  
 <​HTML><​li></​HTML>​ <​HTML><​li></​HTML>​
 **Tuesday, 4/28**\\ **Tuesday, 4/28**\\
-Speaker: \\ +Speaker: ​Alireza Salahshoori (Binghamton)\\ 
-Title: Candidacy exam?\\+Title: ​(Candidacy exam)\\
 Time: 1:30-2:30\\ Time: 1:30-2:30\\
 Location: ​ WH 100E Location: ​ WH 100E
 +
 +This is Mr. Salahshoori'​s candidacy exam.  The examining committee consists of Laura Anderson, Michael Dobbins, and Thomas Zaslavsky (chair). ​ The talks are open to all.
  
 <​HTML><​li></​HTML>​ <​HTML><​li></​HTML>​
 **Tuesday, 5/5**\\ **Tuesday, 5/5**\\
-Speaker: \\+Speaker: ​Danika Van Niel (Binghamton) ​\\
 Title: \\ Title: \\
 Time: 1:30-2:30\\ Time: 1:30-2:30\\
 +Location: ​ WH 100E
 +
 +<​HTML><​li></​HTML>​
 +**Thursday, 5/7 (Colloquium)**\\
 +Speaker: Isabella Novik (Washington) \\
 +Title: \\
 +Time: \\
 Location: ​ WH 100E Location: ​ WH 100E
  
seminars/comb/start.1772044041.txt · Last modified: 2026/02/25 13:27 by zaslav