Related papers: On bar lengths in partitions

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…

By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…

The irreducible representations of symmetric groups can be realized as certain graded pieces of invariant rings, equivalently as global sections of line bundles on partial flag varieties. There are various ways to choose useful bases of…

Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

We identify the complex plane C with the open unit disc D={z:|z|<1} by the homeomorphism z --> z/(1+|z|). This leads to a compactification $\bar{C}$ of C, homeomorphic to the closed unit disc. The Euclidean metric on the closed unit disc…

The spectrum of the d-bar-Neumann Laplacian on a polydisc in several complex variables is explicitly computed. The calculation exhibits that the spectrum consists of eigenvalues, some of which, in particular the smallest ones, are of…

A cascade of dihedral symmetries is hidden in Young's lattice of integer partitions. In fact, for each integer N>2 the Hasse graph of the subposet consisting of the partitions with maximal hook length strictly less than N has the dihedral…

The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

A $p$-divisible group over a field $K$ admits a slope decomposition; associated to each slope $\lambda$ is an integer $m$ and a representation $\gal(K) \ra \gl_m(D_\lambda)$, where $D_\lambda$ is the $\rat_p$-division algebra with Brauer…

We develop general techniques for computing the fundamental group of the configuration space of $n$ identical particles, possessing a generic internal structure, moving on a manifold $M$. This group generalizes the $n$-string braid group of…

Let $B(2d-1, d)$ be the subgraph of the hypercube $\mathcal{Q}_{2d-1}$ induced by its two largest layers. Duffus, Frankl and R\"odl proposed the problem of finding the asymptotics for the logarithm of the number of maximal independent sets…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

In 1952, J.H.Braun claimed to have established a formula giving a lower bound for certain partitions of sets of integers into weakly sum-free classes. However, no proof or supporting construction was published at that time. In today's…

A closed form formula of the partition weight enumerator of maximum distance separable (MDS) codes is derived for an arbitrary number of partitions. Using this result, some properties of MDS codes are discussed. The results are extended for…

We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…