English
Related papers

Related papers: An orthosymplectic Pieri rule

200 papers

There exist a number of well known multiplicative generating functions for series of Schur functions. Amongst these are some related to the dual Cauchy identity whose expansion coefficients are rather simple, and in some cases periodic in…

Combinatorics · Mathematics 2023-03-02 Ronald C. King

We introduce affine Stanley symmetric functions for the special orthogonal groups, a class of symmetric functions that model the cohomology of the affine Grassmannian, continuing the work of Lam and Lam, Schilling, and Shimozono on the…

Combinatorics · Mathematics 2011-11-15 Steven Pon

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

Classical Analysis and ODEs · Mathematics 2010-10-27 Neil Lyall , Akos Magyar

An expression is given for the plethysm $p_{2}\circ S_{\square}$, where $p_{2}$ is the power sum of degree two and $S_{\square}$ is the Schur function indexed by a rectangular partition. The formula can be well understood from the viewpoint…

Combinatorics · Mathematics 2007-05-23 Hiroshi Mizukawa , Hiro-Fumi Yamada

Composing two representations of the general linear groups gives rise to Littlewood's (outer) plethysm. On the level of characters, this poses the question of finding the Schur expansion of the plethysm of two Schur functions. A…

Combinatorics · Mathematics 2025-03-20 Laura Colmenarejo , Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…

Group Theory · Mathematics 2025-07-18 Michael Larsen , Pham Huu Tiep

The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…

Combinatorics · Mathematics 2008-03-04 V. Kreiman

Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

Representation Theory · Mathematics 2009-06-10 A. N. Sergeev , A. P. Veselov

Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…

Combinatorics · Mathematics 2013-10-11 Cristina Ballantine , Rosa Orellana

We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…

Representation Theory · Mathematics 2011-08-30 J. F. van Diejen , E. Emsiz

We prove that a plethysm product of two Schur functions can be factorised uniquely and classify homogeneous and indecomposable plethysm products.

Representation Theory · Mathematics 2019-04-02 Chris Bowman , Rowena Paget

Let $1\leq k \leq n$ and let $X_n = (x_1, \dots, x_n)$ be a list of $n$ variables. The {\em Boolean product polynomial} $B_{n,k}(X_n)$ is the product of the linear forms $\sum_{i \in S} x_i$ where $S$ ranges over all $k$-element subsets of…

Combinatorics · Mathematics 2019-03-01 Sara C. Billey , Brendon Rhoades , Vasu Tewari

The purpose of this paper is to prove a Pieri-type multiplication formula for quantum Grothendieck polynomials, which was conjectured by Lenart-Maeno. This formula would enable us to compute explicitly the quantum product of two arbitrary…

Quantum Algebra · Mathematics 2024-06-26 Satoshi Naito , Daisuke Sagaki

The Hermitian decomposition of a linear operator is generalized to the case of two or more operations. An additive expansion of the product of three octonions into three parts is constructed, wherein each part either preserve or change the…

Rings and Algebras · Mathematics 2018-06-15 Mikhail Kharinov

Chern plethysm (introduced by Billey, Rhoades, and Tewari) is a geometric way to produce Schur positive symmetric polynomials. We present combinatorial interpretations for the Schur expansions of special cases of Chern plethysm. We also…

Combinatorics · Mathematics 2023-10-04 Nathaniel Libman , Gidon Orelowitz

We revisit factorizations of classical characters under various specializations, some old and some new. We first show that all characters of classical families of groups twisted by odd powers of an even primitive root of unity factorize…

Combinatorics · Mathematics 2026-03-31 Arvind Ayyer , Nishu Kumari

Normal crystals (also known as Stembridge crystals) are commonly used to establish the Schur positivity of symmetric functions, as their characters are sums of Schur polynomials. In this paper, we develop a combinatorial framework for a…

Combinatorics · Mathematics 2025-01-29 Eric Marberg , Kam Hung Tong , Tianyi Yu

In this paper, we introduce a family of symmetric polynomials by specializing the factorial Schur polynomials. These polynomials represent the weighted Schubert classes of the cohomology of the weighted Grassmannian introduced by…

Combinatorics · Mathematics 2015-02-02 Hiraku Abe , Tomoo Matsumura

The Schur multiple zeta function was defined as a multivariable function by Nakasuji-Phuksuwan-Yamasaki. Inspired by the product formula of Schur functions, the products of Schur multiple zeta functions have been studied. While the product…

Combinatorics · Mathematics 2026-02-13 Hikari Hanaki

The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…

Combinatorics · Mathematics 2009-09-03 Robin Langer