Related papers: A branching rule for partition complexes

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…

Else from the quotient algebra partition considered in the preceding episodes, two kinds of partitions on unitary Lie algebras are created by nonabelian bi-subalgebras. It is of interest that there exists a partition duality between the two…

Subgroups of the symmetric group $S_n$ act on powers of chains $C^n$ by permuting coordinates, and induce automorphisms of the ordered sets $C^n$. The quotients defined are candidates for symmetric chain decompositions. We establish this…

Let \pi be a partition. In [2] we defined BG-rank(\pi) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a…

We consider indecomposable representations of the Klein four group over a field of characteristic $2$ and of a cyclic group of order $pm$ with $p,m$ coprime over a field of characteristic $p$. For each representation we explicitly describe…

Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is…

We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…

In this paper we give smoothness criterions for a good quotient Y of a smooth variety X by a reductive group G. Our results partially answer a question raised by J. Fogarty in the case where G is a finite group. They also give a converse to…

We introduce a new partial order on the set of all antichains of a fixed size in any poset. When applied to minuscule posets, these partial orders give rise to distributive lattices that appear in the branching rules for minuscule…

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…

We give a new formula for the values of an irreducible character of the symmetric group S_n indexed by a partition of rectangular shape. Some observations and a conjecture are given concerning a generalization to arbitrary shapes.

Let $G_n=\mathrm{GL}_n(F)$ be the general linear group over a non-Archimedean local field $F$. We formulate and prove a necessary and sufficient condition on determining when \[ \mathrm{Hom}_{G_n}(\pi, \pi') \neq 0 \] for irreducible smooth…

The decomposition of representations of compact classical Lie groups into representations of finite subgroups is discussed. A Mathematica package is presented that can be used to compute these branching rules using the Weyl character…

Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…

We show that the string representation of the QCD$_2$ partition function satisfies, by virtue of a Young-tableau-transposition symmetry, the topological constraint that any branched covering of an orientable or nonorientable surface without…

Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. Many algorithms exist to generate all descending compositions, yet none have previously been published to generate…

Let $A_{t,k}(n)$ denote the number of partition $k$-tuples of $n$ where each partition is $t$-core. In this paper, we establish formulas of $A_{t,k}(n)$ for some values of $t$ and $k$ by employing the method of modular forms, which extends…

The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…