Related papers: Polynomiality of some hook-length statistics

We connect two important conjectures in the theory of knot polynomials. The first one is the property Al_R(q) = Al_{[1]}(q^{|R|}) for all single hook Young diagrams R, which is known to hold for all knots. The second conjecture claims that…

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

We present a $q$-analog of the super Catalan number $(2m)!(2n)!/2m!n!(m+n)!$, which also generalizes the $q$-Catalan numbers $c_n(\lambda)$, due to F\"urlinger and Hofbauer, for $\lambda=0$ and $\lambda=1$. We give a combinatorial…

The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…

The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…

We study the correlators of irregular vertex operators in two-dimensional conformal field theory (CFT) in order to propose an exact analytic formula for calculating numbers of partitions, that is: 1) for given $N,k$, finding the total…

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

The paper is devoted to the derivation of the expansion formula for the powers of the Euler Product in terms of partition hook lengths, discovered by Nekrasov and Okounkov in their study of the Seiberg-Witten Theory. We provide a refinement…

We present a bijective proof of the hook-length formula for shifted standard tableaux of a fixed shape based on a modified jeu de taquin and the ideas of the bijective proof of the hook-length formula for ordinary standard tableaux by…

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

To any Schur polynomial $s_{\lambda}$ one can associated its derived polynomials $s_{\lambda}{(i)}$ $i=0,\ldots,|\lambda|$ by the rule $$s_{\lambda}(x_1+t,\ldots,x_n+t) = \sum_i s_{\lambda}^{(i)}(x_1,\ldots,x_n) t^i.$$ We conjecture that…

We study the polynomial approximation problem in $L^2(\mu_1)$ where $\mu_1(dx) = e^{-|x|}/2 dx$. We show that for any absolutely continuous function $f$, $$ \sum_{k=1}^{\infty} \log^2(e+k) \langle f, P_k \rangle^2 \ \leq C \left(…

There is a growing body of work on proving hardness results for average-case estimation problems by bounding the low-degree advantage (LDA) - a quantitative estimate of the closeness of low-degree moments - between a null distribution and a…

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…

The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…

We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length $h_v$ appears as an exponent. As an application, we derive another simple hook…

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this…

The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of…

Partitions, the partition function $p(n)$, and the hook lengths of their Ferrers-Young diagrams are important objects in combinatorics, number theory and representation theory. For positive integers $n$ and $t$, we study $p_t^e(n)$ (resp.…

Let $\lambda (n)$ denote the Liouville function. Complementary to the prime number theorem, Chowla conjectured that \vspace{1mm} \noindent {\bf Conjecture (Chowla).} {\em \begin{equation} \label{a.1} \sum_{n\le x} \lambda (f(n)) =o(x)…