Related papers: Generalized hook lengths in symbols and partitions

We develop a unified strategy to obtain the geometric logarithmic Hardy inequality on any open set M of a stratified group, provided the validity of the Hardy inequality in this setting, where the so-called "weight" is regarded to be any…

Motivated by the Nekrasov-Okounkov formula on hook lengths, the first author conjectured that the Plancherel average of the $2k$-th power sum of hook lengths of partitions with size $n$ is always a polynomial of $n$ for any $k\in…

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

We show how infinite series of a certain type involving generalized harmonic numbers can be computed using a knowledge of symmetric functions and multiple zeta values. In particular, we prove and generalize some identities recently…

The general $d$-position number ${\rm gp}_d(G)$ of a graph $G$ is the cardinality of a largest set $S$ for which no three distinct vertices from $S$ lie on a common geodesic of length at most $d$. This new graph parameter generalizes the…

In 2009, the first author proved the Nekrasov-Okounkov formula on hook lengths for integer partitions by using an identity of Macdonald in the framework of type $\widetilde A$ affine root systems, and conjectured that some summations over…

It is known that for the Young diagram of any partition of an integer $n$, the sum of squares of the hook lengths of its cells is exactly $n^2$ more than that of the contents of its cells. That is, for any partition $\lambda$ of an integer…

Symmetric cohomology of groups, defined by M. Staic in [2], is similar to the way one defines the cyclic cohomology for algebras. We show that there is a well-defined restriction, conjugation and transfer map in symmetric cohomology, which…

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…

In math.CO/0109093 the author obtained a formula for the value of an irreducible symmetric group character indexed by a partition of rectangular shape. In the present paper this formula is (conjecturally) generalized to arbitrary shapes.

We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…

We prove that $(\mathbb{Z}_k \wr \mathcal{S}_n \times \mathbb{Z}_k \wr \mathcal{S}_{n-1}, \text{diag} (\mathbb{Z}_k \wr \mathcal{S}_{n-1}) )$ is a symmetric Gelfand pair, where $\mathbb{Z}_k \wr \mathcal{S}_n$ is the wreath product of the…

For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole for generalized Reed-Solomon codes is proved to be…

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23]…

Let $P$ be the set of integer partitions and $D$ the subset of those with distinct parts. We extend a correspondence of Burge between partitions and binary words to give encodings of both $D$ and $D$ as words over a $k$-ary alphabet, for…

It is shown how some of the recent results of de Souza et al. [1] can be generalized to describe Hamiltonians whose eigenvalues are given as k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases considered by de…

In this paper, we consider some generalized commutator equations in a finite group and show that the number of solutions of such equations are characters of that group. We also obtain explicit formula for this character, considering the…

We confirm the speculation that the distribution of $t$-hooks among unrestricted integer partitions essentially descends to self-conjugate partitions. Namely, we prove that the number of hooks of length $t$ among the size $n$ self-conjugate…

Fix $t \geq 2$. We first give an asymptotic formula for certain sums of the number of $t$-cores. We then use this result to compute the distribution of the size of the $t$-core of a uniformly random partition of an integer $n$. We show that…