相关论文: A combinatorial proof of the supper symmetric prop…

This paper proves a generalization of a conjecture of Guoniu Han, inspired originally by an identity of Nekrasov and Okounkov. The main result states that certain sums over partitions p of n, involving symmetric functions of the squares of…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

We determine the multiplicities of irreducible summands in the symmetric and the exterior squares of hook representations of symmetric groups over an algebraically closed field of characteristic zero.

We study the Young graph with edge multiplicities arising in a Pieri-type formula for Jack symmetric polynomials $P_\mu(x;a)$ with a parameter $a$. Starting with the empty diagram, we define recurrently the `dimensions' $\dim_a$ in the same…

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…

We give an elementary proof of the recent hook inequality given in [MPP3]: $\prod_{u\in \lambda} h(u) \, \le \, \prod_{u\in \lambda} h^\ast(u),$ where $h(u)$ is the usual hook in Young diagram $\lambda$, and $h^\ast(i,j)=i+j-1$. We then…

Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…

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…

Hyperbolic polynomials have been of recent interest due to applications in a wide variety of fields. We seek to better understand these polynomials in the case when they are symmetric, i.e. invariant under all permutations of variables. We…

Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length $2$,…

The monomial basis for polynomials in N variables is labeled by compositions. To each composition there is associated a hook-length product, which is a product of linear functions of a parameter. The zeroes of this product are related to…

We consider a superalgebra with a superinvolution or graded involution $\#$ over a field $F$ of characteristic zero and assume that it is a $PI$-algebra. In this paper, we present the proof of a version of the celebrated hook theorem…

In this paper, we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the…

We present a simple combinatorial proof of Postnikov's hook length formula for binary trees.

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

A combinatorial Hopf algebra is a graded connected Hopf algebra over a field $F$ equipped with a character (multiplicative linear functional) $\zeta:H\to F$. We show that the terminal object in the category of combinatorial Hopf algebras is…

We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…

Using only a symmetric p-core partition and p-quotient, we give an explicit formula for the set of diagonal hook lengths of the associated symmetric partition.