Stephanie Van Willigenburg

Professor

Research Classification

Combinatorial
Algebra

Research Interests

algebraic combinatorics
Coxeter group
quasisymmetric function
Schur functions and generalizations
chromatic symmetric function

Relevant Degree Programs

 

Recruitment

Complete these steps before you reach out to a faculty member!

Check requirements
  • Familiarize yourself with program requirements. You want to learn as much as possible from the information available to you before you reach out to a faculty member. Be sure to visit the graduate degree program listing and program-specific websites.
  • Check whether the program requires you to seek commitment from a supervisor prior to submitting an application. For some programs this is an essential step while others match successful applicants with faculty members within the first year of study. This is either indicated in the program profile under "Requirements" or on the program website.
Focus your search
  • Identify specific faculty members who are conducting research in your specific area of interest.
  • Establish that your research interests align with the faculty member’s research interests.
    • Read up on the faculty members in the program and the research being conducted in the department.
    • Familiarize yourself with their work, read their recent publications and past theses/dissertations that they supervised. Be certain that their research is indeed what you are hoping to study.
Make a good impression
  • Compose an error-free and grammatically correct email addressed to your specifically targeted faculty member, and remember to use their correct titles.
    • Do not send non-specific, mass emails to everyone in the department hoping for a match.
    • Address the faculty members by name. Your contact should be genuine rather than generic.
  • Include a brief outline of your academic background, why you are interested in working with the faculty member, and what experience you could bring to the department. The supervision enquiry form guides you with targeted questions. Ensure to craft compelling answers to these questions.
  • Highlight your achievements and why you are a top student. Faculty members receive dozens of requests from prospective students and you may have less than 30 seconds to pique someone’s interest.
  • Demonstrate that you are familiar with their research:
    • Convey the specific ways you are a good fit for the program.
    • Convey the specific ways the program/lab/faculty member is a good fit for the research you are interested in/already conducting.
  • Be enthusiastic, but don’t overdo it.
Attend an information session

G+PS regularly provides virtual sessions that focus on admission requirements and procedures and tips how to improve your application.

 

Master's students
Doctoral students
Postdoctoral Fellows
2020

Graduate Student Supervision

Doctoral Student Supervision (Jan 2008 - May 2019)
Operators on compositions and noncommutative Schur functions (2015)

In this thesis, we study a natural noncommutative lift of the ubiquitous Schur functions, called noncommutative Schur functions. These functions were introduced by Bessenrodt, Luoto and van Willigenburg and resemble Schur functions in many regards. We prove some new results for noncommutative Schur functions that are analogues of classical results, and demonstrate that the resulting combinatorics in this setting is equally rich. First we prove a Murnaghan-Nakayama rule for noncommutative Schur functions. In other words, we give an explicit combinatorial formula for expanding the product of a noncommutative power sum symmetric function and a noncommutative Schur function in terms of noncommutative Schur functions. In direct analogy to the classical Murnaghan-Nakayama rule, the summands are computed using a noncommutative analogue of border strips, and have coefficients ±1 determined by the height of these border strips. The rule is proved by interpreting the noncommutative Pieri rules for noncommutative Schur functions in terms of box adding operators on compositions. We proceed to give a backward jeu de taquin slide analogue on semistandard reverse composition tableaux. These tableaux were first studied by Haglund, Luoto, Mason and van Willigenburg when defining quasisymmetric Schur functions. Our algorithm for performing backward jeu de taquin slides on semistandard reverse composition tableaux results in a natural operator on compositions that we call the jdt operator. This operator in turn gives rise to a new poset structure on compositions whose maximal chains we enumerate. As an application, we also give new right Pieri rules for noncommutative Schur functions that use the jdt operators, in contrast to the left Pieri rules given by Bessenrodt, Luoto and van Willigenburg.

View record

Schur-positivity of differences of augmented staircase diagrams (2010)

The Schur functions {s_lambda} and ubiquitous Littlewood-Richardson coefficients are instrumental in describing representation theory, symmetric functions,and even certain areas of algebraic geometry. Determining when two skewdiagrams D₁, D₂ have the same skew Schur function or determining when the difference of two such skew Schur functions SD₁ - SD₂ is Schur-positivereveals information about the structures corresponding to these functions.By defining a set of staircase diagrams that we can augment with other (skew) diagrams, we discover collections of skew diagrams for which the question of Schur-positivity among each difference can be resolved. Furthermore, for certain Schur-positive differences we give explicit formulas for computing the coefficients of the Schur functions in the difference.We extend from simple staircases to fat staircases, and carry on to diagrams called sums of fat staircases. These sums of fat staircases can also be augmented with other (skew) diagrams to obtain many instances of Schur positivity.We note that several of our Schur-positive differences become equalities of skew Schur functions when the number of variables is reduced. Finally, we give a factoring identity which allows one to obtain many of the non-trivial finite-variable equalities of skew Schur functions.

View record

Master's Student Supervision (2010 - 2018)
Classifying the near-equality of ribbon Schur functions (2018)

We consider the problem of when the difference of two ribbon Schur functions is a single Schur function. We prove that this near-equality phenomenon occurs in fourteen infinite families and we conjecture that these are the only possible cases. Towards this converse, we prove that under certain additional assumptions the only instances of near-equality are among our fourteen families. In particular, we prove that our first ten families are a complete classification of all cases where the difference of two ribbon Schur functions is a single Schur function whose corresponding partition has at most two parts at least 2. We also provide a framework for interpreting the remaining four families and we explore some ideas towards resolving our conjecture in general. We also determine some necessary conditions for the difference of two ribbon Schur functions to be Schur-positive.

View record

Towards a classification of descent multiplicity-free compositions (2012)

This work studies combinatorics related to expansions of a quasisymmetric refinementof Schur functions into Gessel’s fundamental basis, with almost all resultsconcerning whether an expansion is multiplicity-free. The combinatorial sideof this problem concerns a certain composition poset, and whether there are twostandard fillings of the same composition diagram with a given descent set. Thisthesis uses entirely combinatorial arguments, extending results by Bessenrodt andvanWilligenburg to work towards a classification of such descent multiplicity-freecompositions.The main tools used regard the situation of appending or prepending parts tocompositions. Compositions with multiplicity retain multiplicity when parts areappended or prepended, while multiplicity-free compositions stay multiplicity-freewhen a class of shapes called staircase-like are appended. A classification of compositionswhich are partitions or reverse partitions is achieved, leading up to aclassification of compositions not containing a part of length one. This is used asthe basis for a conjectured classification of multiplicity-free compositions withouta trailing staircase. The conjecture would in turn imply a complete classificationof multiplicity-free compositions.

View record

On the computation of Kronecker coefficients (2011)

A major open problem in algebraic combinatorics is to find a combinatorial rule to compute the Kronecker product of two Schur functions. This is the same as decomposing the inner tensor product of two irreducible characters of the symmetric group as a sum of irreducible characters. Given that there is a combinatorial rule, namely the Littlewood-Richardson rule, which describes a way to compute the outer tensor product of two irreducible characters of the symmetric group, one would expect an algorithm which achieves the same purpose in the case of the inner tensor product. Jeffrey Remmel and Tamsen Whitehead first came up with a description of the Kronecker coefficients occurring in the Kronecker product of two Schur functions, both indexed by partitions of length at most 2. Mercedes Rosas later arrived at the same result using a different approach. The solution of the general problem would have implications in Complexity Theory and Quantum Information Theory.Our goal in this thesis is to derive formulae for computing the Kronecker product in certain cases where the Schur functions are indexed by partitions which are nearly rectangular. In particular, we study s{(n,n-1,1)}*s{(n,n)}, s{(n-1,n-1,1)}*s{(n,n-1)}, s{(n-1,n-1,2)}*s{(n,n)}, s{(n-1,n-1,1,1)}*s{(n,n)} and s{(n,n,1)}*s{(n,n,1)}. Our approach relies mainly on the fruitful interplay between manipulation of symmetric functions and the representation theory of the symmetric group. As a consequence of these formulae, we also derive an expression enumerating certain standard Young tableaux of bounded height.

View record

Current Students & Alumni

This is a small sample of students and/or alumni that have been supervised by this researcher. It is not meant as a comprehensive list.
 
 

If this is your researcher profile you can log in to the Faculty & Staff portal to update your details and provide recruitment preferences.