Left regular bands with symmetry

Patricia Commins; Benjamin Steinberg

Home/Archive/arXiv

arXiv · 2512.07070

Left regular bands with symmetry

Patricia Commins·Benjamin Steinberg

View original source ↗Read source document ↗Export metadata ↓

Abstract

The representation theory of left regular band semigroup algebras is well-studied and known to have close connections with combinatorial topology, as established in the work of Margolis--Saliola--Steinberg ('15, '21). In this paper, we investigate the representation theory of the invariant subalgebras of left regular band semigroup algebras carrying the action of a finite group through the lens of group-equivariant combinatorial topology. We characterize when the invariant subalgebra is semisimple or commutative and examine the equivariant structure of the Peirce components of the semigroup algebra. For CW left regular bands, we interpret these Peirce components in terms of the equivariant topology of intervals in the support semilattice, yielding the Cartan invariants of the invariant subalgebras of left regular bands associated to CAT(0)-cube complexes. We also give a topological formula for the Peirce components for left regular bands with hereditary algebras. Finally, in specializing to left regular bands associated to geometric lattices, we explore generalizations of the Desarménién--Wachs derangement representation and their connections to Markov chains.

Explore related subjects

math.CO math.GR math.RT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Patricia Commins, Benjamin Steinberg. 2025-12-08. Left regular bands with symmetry. https://arxiv.org/abs/2512.07070

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗

arXiv2026

Enumeration of regular multipartite hypergraphs

We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.

math.CO↗

arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗