Related papers: The weighted hook length formula III: Shifted tabl…
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…
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…
We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…
Let $b_{t,i}(n)$ denote the total number of $i$-hooks in $t$-regular partitions of $n$. Singh and Barman conjectured that $b_{t+1,2}(n) \geq b_{t,2}(n)$ holds for all $t\ge 3$ and $n\ge 0$. This conjecture was known to hold for $t=3$ due to…
We introduce balanced shifted tableaux, as an analogue of balanced tableaux of Edelman and Greene, from the perspective of root systems of type B and C. We show that they are equinumerous to standard Young tableaux of the corresponding…
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 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,…
This is a technical introduction to the paper "Extension of twisted Hodge metrics for Kahler morphisms" by the authors.
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…
Valid hook configurations are combinatorial objects used to understand West's stack-sorting map. We extend existing bijections corresponding valid hook configurations to intervals in partial orders on Motzkin paths. To enumerate valid hook…
In this article, we prove a weighted version of Saitoh's conjecture. As an application, we prove a weighted version of Saitoh's conjecture for higher derivatives.
In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…
While analyzing the persistence length of DNA atomistic simulations Wu et al. [J. Chem. Phys. 142, 125103 (2015)] introduced an empirical formula to account for the observed length-dependence. In particular they found that the persistence…
In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.
The main result of this paper is a rigorous computation of Wilson loop expectations in strongly coupled $SO(N)$ lattice gauge theory in the large $N$ limit, in any dimension. The formula appears as an absolutely convergent sum over…
A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…
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 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…
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…