Related papers: Generalized hook lengths in symbols and partitions

We study the generalized Galois numbers which count flags of length r in N-dimensional vector spaces over finite fields. We prove that the coefficients of those polynomials are asymptotically Gaussian normally distributed as N becomes…

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…

The notion of the holomorph of a generalized Bol loop and generalized flexible-Bol loop are characterized. With the aid of two self-mappings on the holomorph of a loop, it is shown that: the loop is a generalized Bol loop if and only if its…

Let $\chi_\lambda$ be an irreducible character of the symmetric group $S_n$. For an $n \times n$ matrix $M = (m_{ij})$, define the immanant of $M$ corresponding to $\chi_\lambda$ by \begin{eqnarray*} d_\lambda(M) = \sum_{\sigma \in S_n}…

We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

For fixed $t = 2$ or $3$, we investigate the statistical properties of $\{Y_t(n)\}$, the sequence of random variables corresponding to the number of hook lengths divisible by $t$ among the partitions of $n$. We characterize the support of…

In a recent article (arXiv:1507.03499) (joint with Alon Regev) we studied sums of squares of characters Chi(L,M) of the Symmetric Group over shapes L that are two-rowed, and shapes L that are hook shapes, and M is an arbitrary shape that…

Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…

Using a 0/1 encoding of Young diagrams and its consequences for rim hook tableaux, we prove a reduction formula of Littlewood for arbitrary characters of the symmetric group, evaluated at elements with all cycle lengths divisible by a given…

Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…

In this article we study the vertices of simple modules for the symmetric groups in prime characteristic $p$. In particular, we complete the classification of the vertices of simple $S_n$-modules labelled by hook partitions.

In this article we consider hook removal operators on odd partitions, i.e., partitions labelling odd-degree irreducible characters of finite symmetric groups. In particular we complete the discussion, started by Isaacs, Navarro, Olsson and…

The fusion procedure provides a way to construct new solutions to the Yang-Baxter equation. In the case of the symmetric group the fusion procedure has been used to construct diagonal matrix elements using a decomposition of the Young…

In this paper, we present a direct bijective proof of the hook-length formula for standard immaculate tableaux, which arose in the study of non-commutative symmetric functions. Our proof is along the spirit of Novelli, Pak and…

In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of…

Nakada's colored hook formula is a vast generalization of many important formulae in combinatorics, such as the classical hook length formula and the Peterson's formula for the number of reduced expressions of minuscule Weyl group elements.…

The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…