1 of 85

An Introduction to

Polysymmetric Functions

and the combinatorics of their transition matrices

2 of 85

An Introduction to

Polysymmetric Functions

A presentation by

Aditya Khanna

(based on joint work with Nicholas Loehr)

AMS Southeastern Sectional, Tulane University

October 4, 2025

3 of 85

Outline

4 of 85

Outline

Symmetric Functions and Polysymmetric Functions

Origins and appearances in Geometry and Representation Theory

Transition matrix combinatorics for polysymmetric functions

5 of 85

Fair warning

I might skip over some technical details in favor of the polysymmetric propaganda.

But feel free to ask me after the talk!

6 of 85

Part 1

Symmetric functions

and polysymmetric functions

7 of 85

Partitions

 

Definition

We will visualize partitions using Ferrer’s diagrams (English notation).

 

8 of 85

Symmetric Functions

9 of 85

Symmetric Functions

10 of 85

This function is invariant under swapping of its variables.

 

Symmetric Functions

11 of 85

 

 

Definition

Symmetric Functions

12 of 85

 

 

 

 

Some special bases

 

13 of 85

 

Some special bases

 

 

 

 

14 of 85

 

Some special bases

 

 

 

 

 

15 of 85

 

Some special bases

 

 

 

 

 

 

16 of 85

 

Some special bases

 

 

 

 

 

 

17 of 85

Now on to polysymmetric functions!

18 of 85

 

Remember the diagrams from before? Let us fill them with numbers.

 

19 of 85

We call this a semi-standard Young tableau (SSYT)

 

 

 

20 of 85

 

 

As it turns out, it will be sufficient to use a partition for content as permuting the entries doesn’t change the Kostka number.

 

21 of 85

Transition Matrices

With all this talk of bases and vector spaces, it only makes sense to talk about matrices between those bases.

We fix some ordering on the partitions. This indexes our vectors and the matrix rows and columns.

 

22 of 85

h in s using horizontal strips

 

“Adding a horizontal strip” means adding boxes to a partition diagram such that no two boxes are in the same column.

SSYTs can be made by successively adding horizontal strips.

23 of 85

h in s using horizontal strips

SSYTs can be made by successively adding horizontal strips.

 

 

24 of 85

Interlude

Get ready for some generalized déjà vu.

25 of 85

(Splitting) Types

26 of 85

(Splitting) Types

In their paper, Asvin G and Andrew O’Desky introduce the idea of splitting types. This object has appeared a few times in literature before.

27 of 85

degrees

(Splitting) Types

In their paper, Asvin G and Andrew O’Desky introduce the idea of splitting types. This object has appeared a few times in literature before.

 

multiplicities

 

 

 

28 of 85

 

 

What do we see in the exponents?

Partitions!

So, we can associate a tensor diagram as follows:

 

 

 

 

 

 

(Splitting) Types

29 of 85

Polysymmetric Functions

In symmetric functions (and polynomials), these all have degree 1

 

 

 

 

 

 

This set of doubly indexed variables has degree given by the first index.

deg = 1

deg = 3

deg = 12

 

30 of 85

 

 

Polysymmetric Functions

31 of 85

 

 

 

This can be thought of as making an SSYT in each factor and tensoring them together.

 

Pure-tensor bases

32 of 85

 

 

 

Plethystic bases

33 of 85

 

 

 

 

Plethystic bases

34 of 85

 

 

 

 

 

Plethystic bases

35 of 85

 

 

 

 

 

Plethystic bases

36 of 85

 

 

 

 

 

 

Plethystic bases

37 of 85

 

 

 

 

 

 

 

Plethystic bases

38 of 85

So…

We talked about polysymmetric functions, but we haven’t covered anything in the title of this special session.

39 of 85

Part 2

Origins and appearances in Geometry and Representation Theory

40 of 85

The universal expansion of the plethystic exponential is given by

The plethystic exponential

 

What if we plug in a formal power series here?

41 of 85

The universal expansion of the plethystic exponential is given by

The plethystic exponential

 

 

42 of 85

Geometry

43 of 85

Geometry

 

44 of 85

Geometry

 

45 of 85

G. and O’Desky mention Specht’s construction.

 

 

 

 

Representation Theory

46 of 85

G. and O’Desky mention Specht’s construction.

 

 

 

 

Representation Theory

47 of 85

There is a relation to the representation theory of the Uniform Block Permutation algebra [OSSZ].

Permutations can be represented using such diagrams

1 2 3 4 5 6 7 8

2 5 7 3 1 6 8 4

Representation Theory

48 of 85

We can map subsets of the same size to each other – uniform blocks.

{13} {248} {57} {6}

{28} {137} {45} {6}

Representation Theory

There is a relation to the representation theory of the Uniform Block Permutation algebra [OSSZ].

49 of 85

 

Here’s the crashiest of all courses on the representation theory of UBP algebras.

Representation Theory

There is a relation to the representation theory of the Uniform Block Permutation algebra [OSSZ].

50 of 85

 

 

 

 

Representation Theory

51 of 85

A wonderful coincidence

 

If you want to know the details

You know the drill by now…

52 of 85

 

If you want to know the details

You know the drill by now…

A wonderful coincidence

53 of 85

enough talking about things i don’t know

54 of 85

Part 3

Combinatorics of transition matrices of polysymmetric functions

55 of 85

 

 

 

What do they look like combinatorially?

56 of 85

Ribbons

 

 

 

 

 

57 of 85

 

Ribbons

 

 

 

 

 

 

 

 

58 of 85

Horizontal Strips

 

The colored boxes form a horizontal strip which goes weakly upwards.

59 of 85

 

Horizontal Strips

60 of 85

 

 

This is called the SXP rule [Wildon][Shimozono, Remmel]

61 of 85

 

 

This is called the SXP rule [Wildon][Shimozono, Remmel]

62 of 85

 

This is called the SXP rule [Wildon][Shimozono, Remmel]

 

 

63 of 85

 

 

 

64 of 85

 

 

 

65 of 85

 

 

 

 

66 of 85

 

 

 

 

 

67 of 85

 

 

 

 

 

Published

Preprint

(sneak peek)

Preliminary results

No direct results

Progress Table

68 of 85

Transition Matrices between Plethystic Bases

Preprint coming out soon!

Contains 10+ sign-reversing involutions!

69 of 85

Thank you! (btw I am on the job market)

Our paper

The SXP rule

  • A simple proof of the Littlewood–Richardson rule and applications (Remmel and Shimozono)
  • A combinatorial proof of a plethystic Murnaghan–Nakayama rule (Mark Wildon)

Polysymmetric Functions

  • Configuration spaces, graded spaces, and polysymmetric functions (Asvin G and Andrew O’Desky)

Uniform Block Permutation algebra

  • Plethysm and the algebra of uniform block permutations (Rosa Orellana, Franco Saliola, Anne Schilling, Mike Zabrocki)

70 of 85

 

Contains 17 sign-reversing involutions!

 

 

71 of 85

 

Contains 17 sign-reversing involutions!

 

 

72 of 85

 

Contains 17 sign-reversing involutions!

 

 

73 of 85

 

Contains 17 sign-reversing involutions!

 

 

74 of 85

 

Contains 17 sign-reversing involutions!

 

75 of 85

 

Contains 17 sign-reversing involutions!

 

76 of 85

 

Contains 17 sign-reversing involutions!

 

 

 

77 of 85

 

Contains 17 sign-reversing involutions!

 

78 of 85

Ribbons

 

 

 

 

 

79 of 85

 

 

 

 

Ribbons

80 of 85

 

 

 

81 of 85

 

 

 

 

82 of 85

 

 

 

 

83 of 85

 

 

 

 

But uhhh what is this?

84 of 85

BONUS: transpose!

 

 

85 of 85

BONUS: inner product