Related papers: Labeled Partitions and the q-Derangement Numbers
While the theory of labelled well-quasi-order has received significant attention in the graph setting, it has not yet been considered in the context of permutation patterns. We initiate this study here, and show how labelled well quasi…
Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…
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…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
We define a class of partially labeled trees and use them to find simple proofs for two recent enumeration results of Colin Defant concerning stack-sorting preimages of permutation classes.
We state and prove a quantum-generalization of MacMahon's celebrated Master Theorem, and relate it to a quantum-generalization of the boson-fermion correspondence of Physics.
We introduce the theory of $(\mathcal{P},\rho)$-partitions, depending on a poset $\mathcal{P}$ and a map $\rho$ from $\mathcal{P}$ to positive integers. The generating function $\mathfrak{F}_{\mathcal{P},\rho}$ of…
Given an integer partition $\la=(\la_1, ..., \la_\ell)$ and an integer k, denote by $\la^{(k)}$ the sequence of length $\ell$ obtained by reordering the values $|\la_i-k|$ in non-increasing order. If $\la$ dominates $\mu$ and has the same…
Recently, Blecher and Knopfmacher applied the notion of fixed points to integer partitions. This has already been generalized and refined in various ways such as $h$-fixed points for an integer parameter $h$ by Hopkins and Sellers. Here, we…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
We study $q$-analogues of $k$-Fibonacci numbers that arise from weighted tilings of an $n\times1$ board with tiles of length at most $k$. The weights on our tilings arise naturally out of distributions of permutations statistics and set…
The Borel-Weil-Bott theorem can be used to decompose the cohomology of twisted sheaves of holomorphic forms on the complex Grassmannian into irreducible representations of the general linear group. By analyzing this decomposition, we…
Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…
Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition…
The number of standard Young tableaux possible of shape corresponding to a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
Based on work of Atkin and Swinnerton-Dyer on partition rank difference functions, and more recent work of Lovejoy and Osburn, Mao has proved several inequalities between partition ranks modulo $10$, and additional results modulo $6$ and…
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
We introduce the Major MacMahon map and show how this map interacts with the pyramid and bipyramid operators. When the Major MacMahon map is applied to the ab-index of a simplicial poset, it yields the q-analogue of n! times the…
We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.