Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Factorization theorems for classical group characters, with applications to alternating sign matrices and plane partitions (1804.04514v2)

Published 12 Apr 2018 in math.CO and math.RT

Abstract: We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related factorizations involving sums of two Schur polynomials, and certain odd-sized sets of variables. Our results generalize the factorization identities proved by Ciucu and Krattenthaler (Advances in combinatorial mathematics, 39-59, 2009) for partitions of rectangular shape. We observe that if, in some of the results, the partitions are taken to have rectangular or double-staircase shapes and all of the variables are set to 1, then factorization identities for numbers of certain plane partitions, alternating sign matrices and related combinatorial objects are obtained.

Summary

We haven't generated a summary for this paper yet.