In this paper, we give a simple criterion to verify that functions of the form $e^g$ are in the Hayman class when $g$ is a power series with nonnegative coefficients. Thus, using the Hayman and Báez-Duarte formulas, we obtain asymptotics for the coefficients of generating functions that arise in many examples of set construction in analytic combinatorics. This new criterion greatly simplifies that obtained previously by the authors.
We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and verify several claims that are posted on the On-Line Encyclopedia of Integer Sequences. We perform the asymptotic analysis by systematically applying the Mellin transform, residue analysis, and the saddle point method. The combinatorial descriptions of these families of generalized partition functions involve colorings of Young tableaux, along with their ``divis…
In this paper we introduce a construction of directed strongly regular graphs from smaller ones using equitable partitions. Each equitable partition of a single DSRG satisfying several conditions leads to an infinite family of directed strongly regular graphs. We construct in this way dozens of infinite families. For order at most 110, we confirm the existence of DSRGs for 30 previously open parameter sets.
Strongly refining results by Regev, Regev and Zeilberger, we prove surprising coincidences between characters to 2-part partitions of size n and characters to hooks of size n+2 on two related families obtained by extending 2-regular conjugacy classes.
We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of partitions of $n$ is equal to the number of partitions of $2n+d{n \choose 2}$ with $n$ $d$-distant parts. We also provide a direct proof for this identity. This work is the result of our aim at finding a bijective proof for Rogers-Ramanujan identities.
Let $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\choose m+1}+\ldots +{n\choose 2m+1}$ if $n=3m+1$. Confirming the conjecture of Kleitman, we establish the same equality for the cases $n=3m$ and $n=3m+2$, and also determine all extremal families. Unlike the case $n=3m+1$, the extremal families are not unique. This is a plausible reason behind the relative difficulty of our proofs. We completely settle the case of several families as well.
We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two combinatorial objects. This study includes the connection between plane partitions and these three families of reduced Kronecker coefficients, providing us their combinatorial interpretation. As an application, we verify that the saturation hypothesis holds for our three families of reduced Kronecker coefficients. The study also includes other interpretation in terms…
Recently, using modular forms and Smoot's {\tt Mathematica} implementation of Radu's algorithm for proving partition congruences, Merca proved the following two congruences: For all $n\geq 0,$ \begin{align*} A(9n+5) & \equiv 0 \pmod{3}, \\ A(27n+26) & \equiv 0 \pmod{3}. \end{align*} Here $A(n)$ is closely related to the function which counts the number of {\it cubic partitions}, partitions wherein the even parts are allowed to appear in two different colors. Indeed, $A(n)$ is defined as the difference between the number of cubic partitions of $n$ into an even numbers of parts and the number of…
Classical Gončarov polynomials arose in numerical analysis as a basis for the solutions of the Gončarov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. By replacing the differentiation operator with a delta operator and using the theory of finite operator calculus, Lorentz, Tringali and Yan introduced the sequence of generalized Gončarov polynomials associated to a pair $(Δ, Z)$ of a delta operator $Δ$ and an interpolation grid $Z$. Generalized Gončarov polynomials share many nice algebraic properties and have a connecti…
We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts not congruent to $\pm 2$ modulo $6$, $Q_2(n)$, and investigate connections between $b_6(n)$ and $Q_2(n)$ providing new combinatorial interpretations for these partition functions. In this context, we discover new infinite families of linear inequalities involving Euler's partition function $p(n)$. Infinite families of linear inequalities involving the $6$-reg…
If $D$ is a $(4u^2,2u^2-u,u^2-u)$ Hadamard difference set (HDS) in $G$, then $\{G,G\setminus D\}$ is clearly a $(4u^2,[2u^2-u,2u^2+u],2u^2)$ partitioned difference family (PDF). Any $(v,K,λ)$-PDF will be said of Hadamard-type if $v=2λ$ as the one above. We present a doubling construction which, starting from any such PDF, leads to an infinite class of PDFs. As a special consequence, we get a PDF in a group of order $4u^2(2n+1)$ and three block-sizes $4u^2-2u$, $4u^2$ and $4u^2+2u$, whenever we have a $(4u^2,2u^2-u,u^2-u)$-HDS and the maximal prime power divisors of $2n+1$ are all greater than …
Families of quasimodular forms arise naturally in many situations such as curve counting on Abelian surfaces and counting ramified covers of orbifolds. In many cases the family of quasimodular forms naturally arises as the coefficients of a Taylor expansion of a Jacobi form. In this note we give examples of such expansions that arise in the study of partition statistics. The crank partition statistic has gathered much interest recently. For instance, Atkin and Garvan showed that the generating functions for the moments of the crank statistic are quasimodular forms. The two variable generating …
We study families of partitions with gap conditions that were introduced by Schur and Andrews, and describe their fundamental connections to combinatorial q-series and automorphic forms. In particular, we show that the generating functions for these families naturally lead to deep identities for theta functions and Hickerson's universal mock theta function, which provides a very general answer to Andrews' Conjecture on the modularity of the Schur-type generating function. Furthermore, we also complete the second part of Andrews' speculation by determining the asymptotic behavior of these funct…
In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a single square partition or with several partitions with only one part. The cardinalities of those families of partitions are the Catalan and ballot numbers, respectively. In this paper we present a closed description for those families. We also present bijections between those sets of partitions and sets of trees and forests enumerated by the Catalan an ballot nu…
An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number of occurrences of several infinite families of subword patterns each containing repeated letters. As a consequence of our results, we obtain explicit generating function formulas counting the members of NC_n for n >= 0 according to all subword patterns of length three containing a repeated letter. Further, simple expressions are deduced for the total number…
P.L. Erdos and L.A. Szekely [Adv. Appl. Math. 10(1989), 488-496] gave a bijection between rooted semilabeled trees and set partitions. L.H. Harper's results [Ann. Math. Stat. 38(1967), 410-414] on the asymptotic normality of the Stirling numbers of the second kind translates into asymptotic normality of rooted semilabeled trees with given number of vertices, when the number of internal vertices varies. The Erdos-Szekely bijection specializes to a bijection between phylogenetic trees and set partitions with classes of size \geq 2. We consider modified Stirling numbers of the second kind that en…
In $1944$, Freeman Dyson defined the concept of rank of an integer partition and introduced without definition the term of crank of an integer partition. A definition for the crank satisfying the properties hypothesized for it by Dyson was discovered in 1988 by G. E. Andrews and F. G. Garvan. In this paper, we introduce truncated forms for two theta identities involving the generating functions for partitions with non-negative rank and non-negative crank. As corollaries we derive new infinite families of linear inequalities for the partition function $p(n)$. The number of Garden of Eden partit…
Let $p_{-k}(n)$ enumerate the number of $k$-colored partitions of $n$. In this paper, we establish some infinite families of congruences modulo 25 for $k$-colored partitions. Furthermore, we prove some infinite families of Ramanujan-type congruences modulo powers of 5 for $p_{-k}(n)$ with $k=2, 6$, and $7$. For example, for all integers $n\geq0$ and $α\geq1$, we prove that \begin{align*} p_{-2}\left(5^{2α-1}n+\dfrac{7\times5^{2α-1}+1}{12}\right) &\equiv0\pmod{5^α} \end{align*} and \begin{align*} p_{-2}\left(5^{2α}n+\dfrac{11\times5^{2α}+1}{12}\right) &\equiv0\pmod{5^{α+1}}. \end{align*}
In studying the enumerative theory of super characters' of the group of upper triangular matrices over a finite field we found that the moments (mean, variance and higher moments) of novel statistics on set partitions have simple closed expressions as linear combinations of shifted bell numbers. It is shown here that families of other statistics have similar moments. The coefficients in the linear combinations are polynomials in $n$. This allows exact enumeration of the moments for small $n$ to determine exact formulae for all $n$.
We study two families of probability measures on integer partitions, which are Schur measures with parameters tuned in such a way that the edge fluctuations are characterized by a critical exponent different from the generic $1/3$. We find that the first part asymptotically follows a "higher-order analogue" of the Tracy-Widom GUE distribution, previously encountered by Le Doussal, Majumdar and Schehr in quantum statistical physics. We also compute limit shapes, and discuss an exact mapping between one of our families and the multicritical unitary matrix models introduced by Periwal and Shevitz…
Some best possible inequalities are established for k-partition-free families (cf. Definition 1) and they are applied to prove a sharpening of a classical result of Kleitman concerning families without k pairwise disjoint members.
Let $b_\ell(n)$ be the number of $\ell$-regular partitions of $n$. Recently, Hou et al established several infinite families of congruences for $b_\ell(n)$ modulo $m$, where $(\ell,m)=(3,3),(6,3),(5,5),(10,5)$ and $(7,7)$. In this paper, by the vanishing property given by Hou et al, we show an infinite family of congruence for $b_{11}(n)$ modulo $11$. Moreover, for $\ell= 3, 13$ and $25$, we obtain three infinite families of congruences for $b_{\ell}(n)$ modulo $3, 5$ and $13$ by the theory of Hecke eigenforms.
Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of partitions split into 5, 7, or 11 equally sized sets, one may ask how to make the resulting bijections between partitions organized by rank or crank combinatorially explicit. Stanton recently made conjectures which aim to uncover a deeper combinatorial structure along these lines, where it turns out that minor modifications of the rank and crank are required…
In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi=1, and Milliken's theorem to xi a finite ordinal), (b) a countable ordinal form of the block Nash-Williams partition theorem, and (c) a countable ordinal block partition theorem for sets closed in the infinite block analogue of Ellentuck's topolo…
We study $k$-divisible partition structures, which are families of random set partitions whose block sizes are divisible by an integer $k=1,2,\ldots$. In this setting, exchangeability corresponds to the usual invariance under relabeling by arbitrary permutations; however, for $k>1$, the ordinary deletion maps on partitions no longer preserve divisibility, and so a random deletion procedure is needed to obtain a partition structure. We describe explicit Chinese restaurant-type seating rules for generating families of exchangeable $k$-divisible partitions that are consistent under random deletio…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same equivalence class if one can be reached from the other through a series of pattern-replacements using patterns whose order permutations are in the same part of a predetermined partition of $S_c$. In particular, we are interested in the number of classes created in $S_n$ by each relation and in characterizing these classes. Imposing the condition that the partition o…
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a row shape, and only visit partitions of bounded height are in bijection with a new type of arc diagram -- open diagrams. Remarkably two subclasses of open diagrams are equinumerous with well known objects: standard Young tableaux of bounded height, and Baxter permutations. We give an explicit combinatorial bijection in the former case.
Linear inequalities involving Euler's partition function $p(n)$ have been the subject of recent studies. In this article, we consider the partition function $Q(n)$ counting the partitions of $n$ into distinct parts. Using truncated theta series, we provide four infinite families of linear inequalities for $Q(n)$ and partition theoretic interpretations for these results.
In 1991, Shalaby conjectured that any $\mathbb{Z}_{n}$, where $n\equiv 1$ or $3\pmod{8},\ n\ge 11$, admits a strong Skolem starter. In 2018, the authors explicitly constructed some infinite "cardioidal" families of strong Skolem starters. No other infinite families of these combinatorial designs were known to date. Statements regarding the products of starters, proven in this paper give a new way of generating strong or skew Skolem starters of composite orders. This approach extends our previous result by generating new infinite families that are not cardioidal. The products that we introduce …
In this paper, we focus on families of bipartitions, i.e. set partitions consisting of at most two components. We say that a family of bipartitions is a separating family for a set $S$ if every two elements in $S$ can be separated by some bipartition. Furthermore, we call a separating family minimal if no proper subfamily is a separating family. We characterize the set of all minimal separating families of maximum size for arbitrary set $S$ as the set of all spanning trees on $S$ and enumerate minimal separating families of maximum size. Furthermore, we enumerate separating families of arbitra…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of permutations and the (well-known) representation of descending plane partitions as families of non--intersecting lattice paths. (Taking a short detour, we will also exhibit how the (well--known) enumeration of descending plane partitions follows easily from the evaluation of Andrew's determinant.)
We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of stabilization, discuss variants on the phenomenon, and give the limiting sequence in many cases as the coefficients of a single-variable generating function. Examples include many statistics that have an Euler product form, partitions with prescribed subsums, and plane overpartitions.
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an algorithm to compute the numerators in their partial fraction decomposition "formally," i.e., as a formal expression in the parameter. We also analyze the type of generalized rational functions that appear during the execution of an algorithm based on iterated partial fraction decomposition and explain how to handle these objects.
We identify a class of "semi-modular" forms invariant on special subgroups of $GL_2(\mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an Eisenstein-like series summed over integer partitions, and use it to construct families of semi-modular forms.
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label irreducible characters appearing as summands of the characters of Foulkes modules. The homomorphisms are defined using certain families of subsets of the natural numbers. These families are of independent interest; we prove a number of combinatorial results concerning them.
We construct multiple $qt$-binomial coefficients and related multiple analogues of several celebrated families of special numbers in this paper. These multidimensional generalizations include the first and the second kind of $qt$-Stirling numbers, $qt$-Bell numbers, $qt$-Bernoulli numbers, $qt$-Catalan numbers and the $qt$--Fibonacci numbers. In the course of developing main properties of these extensions, we prove results that are significant in their own rights such as certain probability measures on the set of integer partitions.
In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For this new combinatorial sequence we derive its exponential generating function, some recurrence relations, and combinatorial identities. We prove and present results using combinatorial arguments, generating functions, the symbolic method and Riordan arrays. For some specific cases we provide a combinatorial interpretation for the inverse matrix of the generaliz…
The partition function $pod(n)$ enumerates the partitions of $n$ wherein odd parts are distinct and even parts are unrestricted. Recently, a number of properties for $pod(n)$ have been established. In this paper, for $k\in\{0,2\}$ we consider the partitions of $n$ into distinct parts not congruent to $k$ modulo $4$ and the $4$-regular partitions of $n$ in order to obtain new properties for $pod(n)$. In this context, we derive two new infinite families of linear inequalities involving the function $pod(n)$ and obtain new identities of Watson type.
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free Rota-Baxter algebras to give a broad class of algebraic structures in which generalizations of generating functions can be studied. We generalize the product formula and composition formula for exponential power series. We also give generating functions both for known number families such as Stirling numbers of the second kind and partition numbers, and for…
A labeled set partition is a partition of a set of integers whose arcs are labeled by nonzero elements of an abelian group $A$. Inspired by the action of the linear characters of the unitriangular group on its supercharacters, we define a group action of $A^n$ on the set of $A$-labeled partitions of an $(n+1)$-set. By investigating the orbit decomposition of various families of set partitions under this action, we derive new combinatorial proofs of Coker's identity for the Narayana polynomial and its type B analogue, and establish a number of other related identities. In return, we also prove …
We study partition functions and thermodynamic limits for the Ising model on three families of finite graphs converging to infinite self-similar graphs. They are provided by three well-known groups realized as automorphism groups of regular rooted trees: the first Grigorchuk's group of intermediate growth; the iterated monodromy group of the complex polynomial $z^2-1$ known as the Basilica group; and the Hanoi Towers group $H^{(3)}$ closely related to the Sierpinsky gasket.
We study the weighted partition function for lozenge tilings, with weights given by multivariate rational functions originally defined by Morales, Pak and Panova (2019) in the context of the factorial Schur functions. We prove that this partition function is symmetric for large families of regions. We employ both combinatorial and algebraic proofs.
In the interest of finding the minimum additive generating set for the set of $\boldsymbol{s}$-lecture hall partitions, we compute the Hilbert bases for the $\boldsymbol{s}$-lecture hall cones in certain cases. In particular, we compute the Hilbert bases for two well-studied families of sequences, namely the $1\mod k$ sequences and the $\ell$-sequences. Additionally, we provide a characterization of the Hilbert bases for $\boldsymbol{u}$-generated Gorenstein $\boldsymbol{s}$-lecture hall cones in low dimensions.
