Search arXivSearch

arXiv · 2412.18368

Schur-hooks and Bernoulli number recurrences

Abstract

Given an identity relating families of Schur and power sum symmetric functions, this may be thought of as encoding representation-theoretic properties according to how the $p$-to-$s$ transition matrices provide the irreducible character tables for symmetric groups. The case of the Murnaghan-Nakayama rule for cycles provides that $p_{n} = \sum_{i = 0}^{n-1} (-1)^i s_{(n-i, 1^{i})}$, and, since the power sum generator $p_{n}$ reduces to $ζ(2n)$ for the Riemann zeta function $ζ$ and for specialized values of the indeterminates involved in the inverse limit construction of the algebra of symmetric functions, this motivates both combinatorial and number-theoretic applications related to the given case of the Murnaghan-Nakayama rule. In this direction, since every Schur-hook admits an expansion in terms of twofold products of elementary and complete homogeneous generators, we exploit this property for the same specialization that allows us to express $p_{n}$ with the Bernoulli number $B_{2n}$, using remarkable results due to Hoffman on multiple harmonic series. This motivates our bijective approach, through the use of sign-reversing involutions, toward the determination of identities that relate Schur-hooks and power sum symmetric functions and that we apply to obtain a new recurrence for Bernoulli numbers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2025-01-08. Schur-hooks and Bernoulli number recurrences. https://arxiv.org/abs/2412.18368

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO