Related papers: Hook Length Biases in $t$-Core Partitions
Given a link or a tangle diagram, we define algorithmic Morse theoretic simplifications on their Khovanov homology. In contrast to Bar-Natan's scanning algorithm, the cancellations are postponed until the end and performed in one go.…
This paper is the Part II of a serious work about T product tensors focusing at establishing new probability bounds for sums of random, independent, T product tensors. These probability bounds characterize large deviation behavior of the…
Introduction: there is an ongoing debate about directional inference of two-sided hypothesis tests for which some authors argue that rejecting $\theta = \theta_0$ does not allow to conclude that $\theta > \theta_0$ or $\theta < \theta_0$…
In this paper we study binary trees with choosable edge lengths, in particular rooted binary trees with the property that the two edges leading from every non-leaf to its two children are assigned integral lengths $l_1$ and $l_2$ with…
We study generating functions which count the sizes of $t$-cores of partitions, and, more generally, the sizes of higher rows in $t$-core towers. We then use these results to derive an asymptotic for the average size of the $t$-defect of…
A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…
Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
Despite the no-hair theorem, several notable hairy black hole (BH) solutions exist in both General Relativity and modified gravity theories. For such hairs to be detectable, they must extend sufficiently beyond the event horizon. This idea…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
A partition is a $t$-core partition if $t$ is not one of its hook lengths. Let $c_t(N)$ be the number of $t$-core partitions of $N$. In 1999, Stanton conjectured $c_t(N) \le c_{t+1}(N)$ if $4 \le t \ne N-1$. This was proved for $t$ fixed…
The partition function of an N=2 gauge theory in the Omega-background satisfies, for generic value of the parameter beta=-eps_1/eps_2, the, in general extended, but otherwise beta-independent, holomorphic anomaly equation of special…
We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…
Armstrong, Hanusa and Jones conjectured that if $s,t$ are coprime integers, then the average size of an $(s,t)$-core partition and the average size of a self-conjugate $(s,t)$-core partition are both equal to $\frac{(s+t+1)(s-1)(t-1)}{24}$.…
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…
Han recently discovered new hook length identities for binary trees. In this paper, we extend Han's identities to binomial families of trees. Moreover, we present a bijective proof of one of the identities for the family of ordered trees.
We investigate polarization-induced interference and off-shell effects in predictions for high-energy, multi-leg processes with intermediate weak bosons carrying fixed helicities. Building on the ``truncated propagator'' paradigm, we carry…
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…
In 2011, Han and Ji proved addition-multiplication theorems for integer partitions, from which they derived modular analogues of many classical identities involving hook-length. In the present paper, we prove addition-multiplication…
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…