most citedUpper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula

18 citations · 20 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2009

Enumeration of non-crossing pairings on bit strings

Todd Kemp, Karl Mahlburg, Amarpreet Rattan +1

A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1}…

math.CO2006★ 2 cited

Stanley's character polynomials and coloured factorizations in the symmetric group

Amarpreet Rattan

Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectur…