Related papers: Euler-Mahonian Statistics On Ordered Set Partition…
In the probabilistic construction of K\"ahler-Einstein metrics on a complex projective algebraic manifold X - involving random point processes on X - a key role is played by the partition function. In this work a new quantitative bound on…
A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…
We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…
We propose a simple pedagogical way of introducing the Euler-MacLaurin summation formula in an undergraduate course on statistical mechanics. We put forward two alternative routes: the first one is the simplest and yields the first two…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
Foata and Zeilberger defined the graphical major index, $\mathrm{maj}'_U$, and the graphical inversion index, $\mathrm{inv}'_U$, for words. These statistics are a generalization of the classical permutation statistics $\mathrm{maj}$ and…
Quasi-set theory provides us a mathematical background for dealing with collections of indistinguishable elementary particles. In this paper, we show how to obtain the usual statistics (Maxwell-Boltzmann, Bose-Einstein, and Fermi-Dirac)…
Closed-form expressions for the distributions of the order statistics on the spacings between order statistics for the uniform distribution are obtained. This generalizes a result by Fisher concerning tests of significance in the harmonic…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
Stein's method compares probability distributions through the study of a class of linear operators called Stein operators. While mainly studied in probability and used to underpin theoretical statistics, Stein's method has led to…
A general formula for the canonical partition function for a system obeying any statistics based on the permutation group is derived. The formula expresses the canonical partition function in terms of sums of Schur functions. The only…
We recall the physical features of the parton distributions in the quantum statistical approach of the nucleon. Some predictions from a next-to-leading order QCD analysis are compared to recent experimental results. We also consider their…
MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and inequalities. This paper aims to develop a fundamental…
We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…
We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…
We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
A procedure to derive the partition function of non-interacting particles with exotic or intermediate statistics is presented. The partition function is directly related to the associated creation and annihilation operators that obey some…
For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…