Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0110077

Frobenius-Schur functions

Grigori Olshanski·Amitai Regev·Anatoly Vershik
View original source ↗Read source document ↗Export metadata ↓

Abstract

The present paper is a detailed version of math/0003031. We introduce and study a new basis in the algebra of symmetric functions. The elements of this basis are called the Frobenius-Schur functions (FS-functions, for short). Our main motivation for studying the FS-functions is the fact that they enter a formula expressing the combinatorial dimension of a skew Young diagram in terms of the Frobenius coordinates. This formula plays a key role in the asymptotic character theory of the symmetric groups. The FS-functions are inhomogeneous, and their top homogeneous components coincide with the conventional Schur functions. The FS-functions are best described in the super realization of the algebra of symmetric functions. As supersymmetric functions, the FS-functions can be characterized as a solution to an interpolation problem. Our main result is a simple determinantal formula for the transition coefficients between the FS-functions and the Schur functions. We also establish the FS analogs for a number of basic facts concerning the Schur functions: Jacobi-Trudi formula together with its dual form; combinatorial formula (expression in terms of tableaux); Giambelli formula and the Sergeev-Pragacz formula. All these results hold for a large family of bases interpolating between the FS-functions and the ordinary Schur functions.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grigori Olshanski, Amitai Regev, Anatoly Vershik. 2001-10-07. Frobenius-Schur functions. https://arxiv.org/abs/math/0110077

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗