Related papers: The M\"obius function of partitions with restricte…
A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma. This defines a partial order on the set of all permutations,…
A partition $\alpha$ is said to contain another partition (or pattern) $\mu$ if the Ferrers board for $\mu$ is attainable from $\alpha$ under removal of rows and columns. We say $\alpha$ avoids $\mu$ if it does not contain $\mu$. In this…
We present a novel approach to Bayesian inference and general Bayesian computation that is defined through a sequential decision loop. Our method defines a recursive partitioning of the sample space. It neither relies on gradients nor…
The equivalence postulate approach to quantum mechanics aims to formulate quantum mechanics from a fundamental geometrical principle. Underlying the formulation there exists a basic cocycle condition which is invariant under…
We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…
In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…
Using previous work by Merca, we show the partition function involving parts of k different magnitudes, shifted by the triangular numbers, equals the self convolution of the unrestricted partition function. We also provide a combinatorial…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
A long and narrow channel confines disks of two sizes. The disks are randomly agitated in a widened channel under moderate pressure, then jammed according to a tunable protocol. We present exact results that characterize jammed macrostates…
We establish a Crapo complementation formula for the M\"obius function $\mu^X$ in a general decomposition space $X$ in terms of a convex subspace $K$ and its complement: $\mu^X \simeq \mu^{X\setminus K} + \mu^X*\zeta^K*\mu^X$. We work at…
For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…
Consider the noncrossing set partitions of an $n$-element set which either do not contain the block $\{n-1,n\}$, or which do not contain the singleton block $\{n\}$ whenever $1$ and $n-1$ are in the same block. In this article we study the…
By using exclusively real analysis, we give explicit estimates of some classical summatory functions involving the M\"obius function.
A natural first step in the classification of all `physical' modular invariant partition functions $\sum N_{LR}\,\c_L\,\C_R$ lies in understanding the commutant of the modular matrices $S$ and $T$. We begin this paper extending the work of…
We considered the thermodynamics in spaces with deformed commutation relation leading to existence of the minimal length. We developed a classical method of the partition function evaluation. We calculated the partition function and heat…