Related papers: Colored partitions and the hooklength formula: par…
We find exact and asymptotic formulas for the average values of several statistics on set partitions: of Carlitz's $q$-Stirling distributions, of the numbers of crossings in linear and circular representations of set partitions, of the…
In this work we prove a new combinatorial identity and applying it we establish many finite harmonic sum identities. Among many others, we prove that \begin{equation*}…
A linearly ordered (LO) $k$-colouring of a hypergraph assigns to each vertex a colour from the set $\{0,1,\ldots,k-1\}$ in such a way that each hyperedge has a unique maximum element. Barto, Batistelli, and Berg conjectured that it is…
Hooks are prominent in representation theory (of symmetric groups) and they play a role in number theory (via cranks associated to Ramanujan's congruences). A partition of a positive integer $n$ has a Young diagram representation. To each…
Soft pp interactions are considered in the framework of the phenomenological model with color strings formation. Under the assumption, that the elementary collision is realized as interaction of two color dipoles, the total inelastic cross…
In this paper, we determine the distribution of the length partition of a random multicurve of fixed topological type on a closed hyperbolic surface using the methods of Margulis' thesis and Mirzakhani's equidistribution theorem for…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
Berkovich-Uncu have recently proved a companion of the well-known Capparelli's identities as well as refinements of Savage-Sills' new little G\"ollnitz identities. Noticing the connection between their results and Boulet's earlier…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo--Pak, proved that the partition function $p(n)$ is eventually log-concave. Inspired by this and…
There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove that the total size of a random partition of this kind…
We prove new formulas for $\operatorname{DD}_k(n)$, the number of plane partition diamonds of length $k$ of $n$, and, also, for its polynomial part.
A partition $(V_1,\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL…
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.
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…
We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block…
Motivated by Alladi's recent multi-dimensional generalization of Sylvester's classical identity, we provide a simple combinatorial proof of an overpartition analogue, which contains extra parameters tracking the numbers of overlined parts…
We find Stieltjes-type and Jacobi-type continued fractions for some "master polynomials" that enumerate permutations, set partitions or perfect matchings with a large (sometimes infinite) number of simultaneous statistics. Our results…