Related papers: A branching rule for partition complexes
We realize the integral Specht modules for the symmetric group $S_n$ as induced modules from the subalgebra of the group algebra generated by the Jucys-Murphy elements. We deduce from this that the simple modules for $FS_n$ are generated by…
We evaluate the twisted partition function of four-dimensional $\mathcal{N} = 1$ supersymmetric Yang--Mills theory reduced to a point for all simple gauge groups. The partition function is expressed as a sum of residues. The types of…
In this paper we construct a generalization of the classical Steinberg section for the quotient map of a semisimple group with respect to the conjugation action. We then give various applications of our construction including the…
In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
This is the sequel exposition following [1]. The framework quotient algebra partition is rephrased in the language of the s-representation. Thanks to this language, a quotient algebra partition of the simplest form is established under a…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
For a subfamily of multiplicative measures on integer partitions we give conditions for properly rescaled associated Young diagrams to converge in probability to a certain deterministic curve named the limit shape of partitions. We provide…
An open partition \pi{} [Cod09a, Cod09b] of a tree T is a partition of the vertices of T with the property that, for each block B of \pi, the upset of B is a union of blocks of \pi. This paper deals with the number, NP(n), of open…
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…
Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…
One of the most useful tools for calculating the decomposition numbers of the symmetric group is Schaper's sum formula. The utility of this formula for a given Specht module can be improved by knowing the Schaper Number of the corresponding…
The method of multidimensional SUSY Quantum Mechanics is applied to the investigation of supersymmetrical N-particle systems on a line for the case of separable center-of-mass motion. New decompositions of the superhamiltonian into…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…
A classic theorem of Uchimura states that the difference between the sum of the smallest parts of the partitions of $n$ into an odd number of distinct parts and the corresponding sum for an even number of distinct parts is equal to the…