相关论文: A generalization of conjugation of integer partiti…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…

In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…

An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every…

One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…

Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

We show that many theorems which assert that two kinds of partitions of the same integer $n$ are equinumerous are actually special cases of a much stronger form of equality. We show that in fact there correspond partition statistics $X$ and…

In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…

Pitman(2003)(and subsequently Gnedin and Pitman (2006) showed that a large class of random partitions of the integers derived from a stable subordinator of index $\alpha\in(0,1)$ have infinite Gibbs (product) structure as a characterizing…

We introduce $n(n-1)/2$ natural involutions ("toggles") on the set $S$ of noncrossing partitions $\pi$ of size $n$, along with certain composite operations obtained by composing these involutions. We show that for many operations $T$ of…

A binary partition of a positive integer $n$ is a partition of $n$ in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary partitions of $n$. This is an ordering of the set of binary…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the…

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…

An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…

A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…