Related papers: A generalization of conjugation of integer partiti…
We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…
We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…
Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
Gibbs-type exchangeable random partitions, which is a class of multiplicative measures on the set of positive integer partitions, appear in various contexts, including Bayesian statistics, random combinatorial structures, and stochastic…
The Moran model with recombination is considered, which describes the evolution of the genetic composition of a population under recombination and resampling. There are $n$ sites (or loci), a finite number of letters (or alleles) at every…
We give a short proof for a formula for the number of divisions of a convex (sn+2)-gon along non-crossing diagonals into (sj+2)-gons, where 1<=j<=n-1. In other words, we consider dissections of an (sn+2)-gon into pieces which can be further…
For integers m, n $\ge$ 1, we describe a bijection sending dissections of the (mn + 2)-regular polygon into (m + 2)-sided polygons to a new basis of the quotient of the polynomial algebra in mn variables by an ideal generated by some kind…
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…
For $S$ a very general polarized K3 surface of degree $8n-6$, we describe in geometrical terms a birational involution of the Hilbert scheme $S^{[n]}$ of $n$ points on the surface, whose existence was established from lattice theoretical…
An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…
In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…
Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.
E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…
We derive the canonical ensemble partition functions for gauged permutation invariant tensor quantum harmonic oscillator thermodynamics, finding surprisingly simple expressions with number-theoretic characteristics. These systems have a…
In this paper we provide a bijective proof of a theorem of Garsia and Gessel describing the generating function of the major index over the set of all permutations of [n]={1,...,n} which are shuffles of given disjoint ordered sequences…
We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…
An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…