Related papers: Generalized hook lengths in symbols and partitions
We discuss Sekiguchi-type differential operators, their eigenvalues, and a generalization of Andrews-Goulden-Jackson formula. These will be applied to extract explicit formulae involving shifted partitions and hook lengths.
We consider ensembles of planar maps with two marked vertices at distance k from each other and look at the closed line separating these vertices and lying at distance d from the first one (d<k). This line divides the map into two…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…
We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of…
Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new…
A Golomb ruler is a sequence of integers whose pairwise differences, or equivalently pairwise sums, are all distinct. This definition has been generalized in various ways to allow for sums of h integers, or to allow up to g repetitions of a…
Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance…
A class of good integers has been introduced by P. Moree in $1997$ together with the characterization of good odd integers. Such integers have shown to have nice number theoretical properties and wide applications. In this paper, a complete…
Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets on a distributed storage system in such a way that only parties with access to a large part of the system can obtain information while still allowing for local…
The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…
The $r$-th generalized Hamming metric and the $b$-symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of the reading…
Dedekind sums are well-studied arithmetic sums, with values uniformly distributed on the unit interval. Based on their relation to certain modular forms, Dedekind sums may be defined as functions on the cusp set of $SL(2,\mathbb{Z})$. We…
In this paper, we first introduce certain forms of extended incomplete Pochhammer symbols which are then used to define families of extended incomplete generalized hypergeometric functions. For these functions, we investigate various…
A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…
For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical semigroup generated by $A$. We show that with high…
A complete characterisation is given of all the linear isometries of the Fr\'echet space of all holomorphic functions on the unit disc, when it is given one of the two standard metrics: these turn out to be weighted composition operators of…
Let k be an algebraically closed field of characteristic p>0 and let G be a symplectic or general linear group over k. We consider induced modules for G under the assumption that p is bigger than the greatest hook length in the partitions…
We discuss properties of certain generalization of Power Means proposed in 1971 by Carlson, Meany and Nelson. For any fixed parameter (k,s,q) and vector (v_1,...,v_n) they take the q-th power means of all possible k-tuples…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…