Seminar

Friday, July 11, 2025 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte colloquium-Stephen Melczer

Title:Automated Sequence Asymptotics

Speaker: Stephen Melczer
Affiliation: University of À¶Ý®ÊÓÆµ
Location: MC 5501

Abstract:Computing with any sort of object requires a way of encoding it on a computer, which poses a problem in enumerative combinatorics where the objects of interest are (infinite) combinatorial sequences. Thankfully, the generating function of a combinatorial sequence often satisfies natural algebraic/differential/functional equations, which can then be viewed as data structures for the sequence. In this talk we survey methods to take a sequence encoded by such data structures and automatically determine asymptotic behaviour using techniques from the field of analytic combinatorics. We also discuss methods to automatically characterize the asymptotic behaviour of multivariate sequences using analytic combinatorics in several variables (ACSV). The focus of each topic will be rigorous algorithms that have already been implemented in computer algebra systems and can be easily used by anyone.

Ìý

Thursday, July 10, 2025 2:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic and enumerative combinatorics seminar-Karen Yeats

Title:Sizes of witnesses in covtree

Speaker Karen Yeats
Affiliation University of À¶Ý®ÊÓÆµ
Location MC 5479

Abstract:ÌýHere is a purely combinatorial problem that arose in causal set theory.Ìý Let {P_1, ... , P_k} be distinct unlabelled posets all with n elements.Ìý Suppose there is a poset Q such that {P_1, ... , P_k} is exactly the set of downsets of Q of size n up to isomorphism. Given n and k can we give a tight upper bound on the minimum size of such a Q? As with newspaper headlines, the answer to the question is no, at least for the moment, but I'll explain what we do know.Ìý Joint work with Jette Gutzeit, Kimia Shaban, and Stav Zalel.

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm,

Thursday, July 3, 2025 2:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic and enumerative combinatorics seminar-Farhad Soltani

Title:Quasisymmetric Harmonics in Superspace

Speaker Farhad Soltani
Affiliation YorkÌýUniversity
Location MC 5479

Abstract:ÌýThe harmonics of quasisymmetric polynomials in superspace are theÌýÌýorthogonal complement of the ideal generated by quasisymmetric polynomials without constant term. In this talk, I will discuss the harmonics and present the first basis of this space, which is indexed by a specific family of nested forests.

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm,

Friday, July 4, 2025 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte colloquium-Henry Wolkowicz

Title:The omega-Condition Number: Applications to Preconditioning and Low Rank Generalized Jacobian Updating

Speaker: Henry Wolkowicz
Affiliation: University of À¶Ý®ÊÓÆµ
Location: MC 5501

Abstract:ÌýPreconditioning is essential in iterative methods for solving linear systems. It is also the implicit objective in updating approximations of Jacobians in optimization methods, e.g.,~in quasi-Newton methods. We study a nonclassic matrix condition number, the omega-condition number}, omega for short. omega is the ratio of: the arithmetic and geometric means of the singular values, rather than the largest and smallest for the classical kappa-condition number. The simple functions in omega allow one to exploitÌý first order optimality conditions. We use this fact to derive explicit formulae for (i) omega-optimal low rank updating of generalized Jacobians arising in the context of nonsmooth Newton methods; and (ii) omega-optimal preconditioners of special structure for Ìýiterative methods for linear systems. In the latter context, we analyze the benefits of omega for (a) improving the clustering of eigenvalues; (b) reducing the number of iterations; and (c) estimating the actual condition of a linear system. Moreover we show strong theoretical connections between the omega-optimal preconditioners and incomplete Cholesky factorizations, and highlight the misleading effects arising from the inverse invariance of kappa. Our results confirm the efficacy of using the omega-condition number compared to the kappa-condition number.

(Joint work with: Woosuk L. Jung, David Torregrosa-Belen.)

Ìý

Thursday, June 26, 2025 2:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic and enumerative combinatorics seminar-Leo Jiang

Title:Oriented graded Möbius algebras

Speaker Leo Jiang
Affiliation University of Toronto
Location MC 5479

Abstract:The graded Möbius algebra B(M) of a matroid M contains much combinatorial information about the flats of M. Its algebraic properties were instrumental in the proof of the Dowling—Wilson top-heavy conjecture. We will introduce a skew-commutative analogue OB(M) associated to every oriented matroid M, and discuss its algebraic structure. This is part of ongoing work joint with Yu Li.

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm,

Friday, June 27, 2025 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte colloquium-Gary Au

Title:Worst-case instances of the stable set problem of graphs for the Lovász–Schrijver SDP hierarchy

Speaker: Gary Au
Affiliation: University of Saskatchewan
Location: MC 5501

Abstract:(Based on joint work with Levent Tunçel.)

In this talk, we discuss semidefinite relaxations of the stable set problem of graphs generated by the lift-and-project operator LS_+ (due to Lovász and Schrijver), and present some of our recent progress on this front. In particular, we show that for every positive integer k, the smallest graph with LS_+-rank k contains exactly 3k vertices. This result is sharp and settles a conjecture posed by Lipták and Tunçel from 2003.

The talk will be accessible to a general audience, and does not assume any prior knowledge of lift-and-project methods.

Ìý

Monday, June 16, 2025 11:30 am - 12:30 pm EDT (GMT -04:00)

Algebraic Graph Theory-Eric Culver

Title:ÌýTwo Distinct Eigenvalues from a New Graph Product

Speaker:

Eric Culver

Affiliation: Brigham Young University
Location: Please contactÌýSabrina LatoÌýfor Zoom link.

Abstract:The parameter q(G) of a graph G is the minimum number of distinct eigenvalues of a symmetric matrix whose pattern is given by G.Ìý We introduce a novel graph product by which we construct new infinite families of graphs that achieve q(G)=2.Ìý Several graph families for which it is already known that q(G)=2 can also be thought of as arising from this new product.

Friday, June 20, 2025 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte colloquium-Sepehr Hajebi

Title:Complete bipartite induced minors (and treewidth)

Speaker: Sepehr Hajebi
Affiliation: University of À¶Ý®ÊÓÆµ
Location: MC 5501

Abstract:I will present a result that describes the unavoidable induced subgraphs of graphs with a large complete bipartite induced minor, and will discuss the connections and applications to bounding the treewidth in hereditary classes of graphs. If time permits, I will also sketch some proofs.

ÌýJoint work with Maria Chudnovsky and Sophie Spirkl.

Ìý

Thursday, June 19, 2025 2:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic and enumerative combinatorics seminar-Elana Kalashnikov

Title:The Abelian/non-Abelian correspondence and Littlewood-Richardson

Speaker Elana Kalashnikov
Affiliation University of À¶Ý®ÊÓÆµ
Location MC 5479

Abstract:The Abelian/non-Abelian correspondence gives rise to a natural basis for the cohomology of flag varieties, which - except for Grassmannians - is distinct from the Schubert basis. I will describe this basis and its multiplication rules, and explain how to relate it to the Schubert basis for two-step flag varieties. I will then explain how this leads to new tableaux Littlewood--Richardson rules for many products of Schubert classes. This is joint work (separately) with Wei Gu and Linda Chen.

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm,

Monday, June 9, 2025 11:30 am - 12:30 pm EDT (GMT -04:00)

Algebraic Graph Theory-Blas Fernandez

Title:Ìý2-Y-homogeneousÌýdistance-biregularÌýgraphs

Speaker:

Blas Fernandez

Affiliation: IMFM, Ljubljana; UP FAMNIT, Koper, Slovenia
Location: Please contactÌýSabrina LatoÌýfor Zoom link.

Abstract:ÌýDistance-biregular graphs (DBRGs) generalize distance-regular graphs by admitting a bipartition of the vertex set, where each part satisfies local distance-regularity Ìýunder distinct intersection arrays. In recent years, a particular subclass of these graphs, those satisfying the so-calledÌý2-Y-homogeneous condition, has garnered increasing attention due to its rich connections with combinatorial design theory and the representation theory of Terwilliger algebras. In this talk, we will examine the key structural conditions that characterizeÌý2-Y-homogeneous DBRGs. We will survey recent progress in their classification under various combinatorial constraints, highlighting both known results and open problems.