SearcharxivSearch

arXiv · 2509.05918

Minimal elements in the skew extended 0-Hecke poset

Abstract

The row-strict 0-Hecke action on standard immaculate skew tableaux was studied by the present authors, who showed that it gives rise to a bounded poset, called the \emph{skew immaculate Hecke poset}, and consequently to a cyclic 0-Hecke module. It was further shown that the subposet of skew standard extended immaculate tableaux always has a unique maximal element, but may have multiple minimal elements. In this paper we focus on these minimal elements, completely classifying them for a family of skew shapes that we call \emph{lobsters}. Moreover, we prove that when the skew shape is connected, the skew extended Hecke poset does have a unique minimal element, thereby showing that the associated 0-Hecke module is cyclic for both the row-strict and the dual immaculate actions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nadia Lafrenière, Rosa Orellana, Anna Pun, Sheila Sundaram, Stephanie van Willigenburg, Tamsen Whitehead McGinley. 2025-09-09. Minimal elements in the skew extended 0-Hecke poset. https://arxiv.org/abs/2509.05918

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

KEEP EXPLORING

Related papers

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO