Search arXivSearch

arXiv · 2507.14313

Partition algebras as monoid algebras

Abstract

Wilcox has considered a twisted semigroup algebra structure on the partition algebra $\mathbb{C}A_k(n)$, but it appears that there has not previously been any known basis that gives $\mathbb{C}A_k(n)$ the structure of a "non-twisted" semigroup algebra or a monoid algebra. This motivates the following problem, for the non-degenerate case whereby $n \in \mathbb{C} \setminus \{ 0, 1, \ldots, 2 k - 2 \}$ so that $ \mathbb{C}A_k(n)$ is semisimple. How could a basis $M_{k} = M$ of $ \mathbb{C}A_k(n)$ be constructed so that $M$ is closed under the multiplicative operation on $\mathbb{C}A_k(n)$, in such a way so that $M$ is a monoid under this operation, and how could a product rule for elements in $M$ be defined in an explicit and combinatorial way in terms of partition diagrams? We construct a basis $M$ of the desired form using Halverson and Ram's matrix unit construction for partition algebras, Benkart and Halverson's bijection between vacillating tableaux and set-partition tableaux, an analogue given by Colmenarejo et al. for partition diagrams of the RSK correspondence, and a variant of a result due to Hewitt and Zuckerman characterizing finite-dimensional semisimple algebras that are isomorphic to semigroup algebras.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2025-07-18. Partition algebras as monoid algebras. https://arxiv.org/abs/2507.14313

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