Related papers: The weighted hook-length formula II: Complementary…
The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of…
The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux.…
The accuracy of the Heller's derivative rule to calculate the numerical weights associated with discretized energy spectrum is enhanced by Broad's extension which adds (N-1) more interpolating points to the original N points. The extension…
This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of couplings of their corresponding generic branching vectors.…
Extended welded links are a generalization of Fenn, Rim\'{a}nyi, and Rourke's welded links. Their braided counterpart are extended welded braids, which are closely related to ribbon braids and loop braids. In this paper we prove versions of…
Bjoerner and Wachs provided two q-generalizations of Knuth's hook formula counting linear extensions of forests: one involving the major index statistic, and one involving the inversion number statistic. We prove a multivariate…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…
We study the symplectic Howe duality using two new and independent combinatorial methods: via determinantal formulae on the one hand, and via (bi)crystals on the other hand. The first approach allows us to establish a generalised version…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…
We study the situations when the solution to a weighted stochastic recursion has a power law tail. To this end, we develop two complementary approaches, the first one extends Goldie's (1991) implicit renewal theorem to cover recursions on…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
A multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov-Okounkov, the third one by Iqbal, Nazir,…
We provide an alternating proof of sharp inequalities related with Burnside's formula for $n!$
The power of multiple testing procedures can be increased by using weighted p-values (Genovese, Roeder and Wasserman 2005). We derive the optimal weights and we show that the power is remarkably robust to misspecification of these weights.…
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…
We present a new proof of the extended arc-sine law related to Walsh's Brownian motion, known also as Brownian spider. The main argument mimics the scaling property used previously, in particular by D. Williams in the 1-dimensional Brownian…
A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…
Two-side estimates for two-weighted discrete Hardy-type operators on a tree are obtained. For general weights we prove the discrete analogue of Evans - Harris - Pick theorem (it is a quite simple consequence from their result). It gives the…