English
Related papers

Related papers: The immersion poset on partitions

200 papers

Let $K$ be an infinite field of characteristic $p>0$ and let $\lambda, \mu$ be partitions of $n$, where $\lambda=(\lambda_1,...,\lambda_n)$ and $\mu=(\mu_1,..,\mu_n)$. By $S^{\lambda}$ we denote the Specht module corresponding to $\lambda$…

Representation Theory · Mathematics 2024-05-10 Mihalis Maliakas , Dimitra-Dionysia Stergiopoulou

Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…

Combinatorics · Mathematics 2007-05-23 Peter Clifford

A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…

Combinatorics · Mathematics 2022-07-27 Balázs Keszegh , Nathan Lemons , Ryan R. Martin , Dömötör Pálvölgyi , Balázs Patkós

We study the $t$-Schur measure on partitions, defined by $ \mathbb{P}(\lambda)=Z^{-1}S_\lambda(x;t)s_\lambda(y) $, where $S_\lambda(x;t)$ denotes the $t$-Schur symmetric functions and $s_\lambda(y)$ the ordinary Schur functions, and $Z$ is…

Mathematical Physics · Physics 2026-02-17 Gary Greaves , Naihuan Jing , Haoran Zhu

We use crystals of tableaux and descent compositions to understand the decomposition of Schur functions $s_\lambda$ into Gessel's fundamental quasisymmetric functions $F_\alpha$. The connected crystal of tableaux $B(\lambda)$, associated to…

Combinatorics · Mathematics 2023-02-16 Florence Maas-Gariépy

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

Combinatorics · Mathematics 2017-08-29 Jonathan A. Noel , Alex Scott , Benny Sudakov

Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…

Combinatorics · Mathematics 2024-10-23 Avichai Cohen , Shaul Zemel

In this article, we provide an infinite family of examples to disprove a recent conjecture due to Ballantine and her collaborators on the injectivity of a class of maps, namely pre_k, defined on integer partitions. These maps arise from…

Combinatorics · Mathematics 2026-04-21 Aman Devnani , Pramod Eyyunni

For $l,n \in \mathbb{N}$ we define tonal partition algebra $P^l_n$ over $\mathbb{Z}[\delta]$. We construct modules $\{ \Delta_{\underline{\mu}} \}_{\underline{\mu}}$ for $P^l_n$ over $\mathbb{Z}[\delta]$, and hence over any integral domain…

Representation Theory · Mathematics 2019-12-05 Chwas Ahmed , Paul Martin , Volodymyr Mazorchuk

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

The central object of study is a formal power series that we call the content series, a symmetric function involving an arbitrary underlying formal power series $f$ in the contents of the cells in a partition. In previous work we have shown…

Combinatorics · Mathematics 2016-08-08 S. R. Carrell , I. P. Goulden

The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…

Combinatorics · Mathematics 2026-02-17 Nimisha Pahuja

Given a finite poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is induced-$\mathcal{P}$-saturated if $\mathcal{F}$ contains no copy of $\mathcal{P}$ as an induced subposet but every proper superset of…

Combinatorics · Mathematics 2019-08-06 Ryan R. Martin , Heather C. Smith , Shanise Walker

We investigate the rank-generating function $F_{\lambda}$ of the poset of partitions contained inside a given shifted Ferrers shape $\lambda$. When $\lambda $ has four parts, we show that $F_{\lambda}$ is unimodal when $\lambda =\langle…

Combinatorics · Mathematics 2015-11-10 Richard P. Stanley , Fabrizio Zanello

We construct the independent particle representation for the Semistandard Young Tableaux (SsYT) of skew shape $\lambda/\mu.$ The partition function of this particle system gives the generating function of the SsYT of skew shape…

Combinatorics · Mathematics 2025-06-25 Oleg Ogievetsky , Senya Shlosman

Given a finite poset $\mathcal P$, the hypercube-height, denoted by $h^*(\mathcal P)$, is defined to be the largest $h$ such that, for any natural number $n$, the subsets of $[n]$ of size less than $h$ do not contain an induced copy of…

Combinatorics · Mathematics 2025-10-01 Tomáš Flídr , Maria-Romina Ivan , Sean Jaffe

For any two partitions $\lambda$ and $\mu$ of a positive integer $N$, let $\chi_{\lambda}(\mu)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $\lambda$, evaluated at the conjugacy class of elements…

Number Theory · Mathematics 2026-04-01 Jayanta Barman , Kamalakshya Mahatab

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

Combinatorics · Mathematics 2026-05-26 Maria-Romina Ivan , Sean Jaffe

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…

Combinatorics · Mathematics 2017-09-21 Joshua P. Swanson