Events

Title: Taking limits in Go-diagrams

Title: Rectangle covers and bounding the extension complexity of the correlation polytope

Title: Steiner Cut Dominants

Abstract: For a subset of terminals T of the nodes of a graph G a cut in G is called a T-Steiner cut if it subdivides T into two non-empty sets. The Steiner cut dominant of G is the Minkowski sum of the convex hull of the incidence vectors of T-Steiner cuts in G and the nonnegative orthant.

Title : A Closure Lemma for tough graphs and Hamiltonian degree conditions

Abstract: A graph G is hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, ,for all subsets of vertices S, the number of connected components in G − S is at most |S| / t.

Title: Quasisymmetric varieties, excedances, and bases for the Temperley--Lieb algebra

Abstract:  This talk is about finding a quasisymmetric variety (QSV): a subset of permutations which (i) is a basis for the Temperley--Lieb algebra TL_n(2), and (ii) has a vanishing ideal (as points in n-space) that behaves similarly to the ideal generated by quasisymmetric polynomials.   While this problem is primarily motivated by classical (co-)invariant theory and generalizations thereof, the course of our investigation uncovered a number of remarkable combinatorial properties related to our QSV, and I will survey these as well. 

Title: On the complexity of quantum partition functions

Abstract: Quantum complexity theory has been intertwined with the study of quantum many-body systems ever since Kitaev's insight that computing their ground energies is an intractable quantum constraint satisfaction problem that is complete for a quantum generalization of NP.

Title: Inverse eigenvalue problem of a graph

Abstract:  We often encounter matrices whose pattern (zero-nonzero, or sign) is known while the precise value of each entry is not clear. Thus, a natural question is what we can say about the spectral property of matrices of a given pattern. When the matrix is real and symmetric, one may use a simple graph to describe its off-diagonal nonzero support.

Title: Distance-Regular and Distance-Biregular Graphs

Abstract: For a given diameter d and valency k, what is the maximum number of vertices a k-regular graph of diameter d can have, and what graphs meet that bound? Although there is a straightforward counting argument to bound the number of vertices using the structural information, the problem of characterizing the graphs that meet the bound turns out to be a problem in algebraic graph theory, and helps gives rise to the notion of distance-regular graphs.

Title: Arrangements of Pseudolines, Tropical Grassmannians, and Generalized Scattering Amplitudes

Abstract: For each arrangement of (pseudo)lines on the projective plane, it is possible to construct a differential form that captures its combinatorial structure. The forms have simple poles whenever triangles shrink to a point in the arrangement, and share the same residue when two arrangements are connected via a "triangle flip".

Title: Four types of integrality on mixed Cayley graphs over abelian groups

Abstract: A mixed graph is called H-integral (resp. HS-integral) if the eigenvalues of its Hermitian-adjacency matrix (resp. Hermitian-adjacency matrix of second kind) are integers.