Averaging method in combinatorics of symmetric polynomials

We elaborate on the recent suggestion to consider averaging of Cauchy identities for the Schur functions over power sum variables. This procedure has apparent parallels with the Borel transform, only it changes the number of combinatorial factors like $d_R$ in the sums over Young diagrams instead of just factorials in ordinary sums over numbers. It provides a universal view on a number of previously known, but seemingly random identities.