We announce a new four parameter partition theorem from which the (big) theorem of Gollnitz follows by setting any one of the parameters equal to 0. This settles a problem of Andrews who asked whether there exists a result that goes beyond the partition theorem of Gollnitz. We state a four parameter q-series identity (key identity) which is the generating function form of this theorem. In a subsequent paper, the proof of the new four parameter key identity will be given.
In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of Göllnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this pair of papers, we took a first step in this direction by giving a bijective proof of a reformulation of their result. We introduced forbidden patterns, bijectively proved a ten-colored partition identity, and then related, by another bijection, our identity to the Alladi-Andrews-Berkovich identity. In this second paper, we state and bijectively prove an $\fra…
In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go beyond a classical theorem of Göllnitz, which uses three primary and three secondary colors. Their main tool was a deep and difficult four parameter $q$-series identity. In this paper we take a different approach. Instead of adding an eleventh quaternary color, we introduce forbidden patterns and give a bijective proof of a ten-colored partition identity lying be…
We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed here are the set of Rogers--Ramanujan, Göllnitz--Gordon, and little Göllnitz partitions. This work also includes finding the finite analogs of the related generating functions and the discussion of some related series and polynomial identities. Additionally, we present a different construction and a double sum representation for the products similar to the …
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 certain difference conditions. Bressoud's conjecture specializes to a wide variety of well-known theorems in the theory of partitions. Special cases of his conjecture have been subsequently proved by Bressoud, Andrews, Kim and Yee. Recently, Kim resolved Bressoud's conjecture for the case $j=1$. In this paper, we introduce a new partition function $\bar{B}_j$ whi…
This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of Göllnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at least two. Consequences of this include Jacobi's celebrated triple product identity for theta functions, Sylvester's famous refinement of Euler's theorem, as well as certain weighted partition identities. Next, by studying partitions with prescribed bounds on successive ranks and replacing these with weighted Rogers-Ramanujan partitions, we obtain two new sets …
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon identities. Generalizations of each of these theorems are given where a single part is "marked" or weighted. This allows a single part to be replaced by a new larger part, "shifting" a part, and analogous combinatorial results are given in each case. Versions are also given for marking a sum of parts.
Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur's partition identity. Together with Andrews, they later used it to refine Capparelli's and Göllnitz' identities too. In this paper, we present a new variant of this method, which can be used to study more complicated partition identities, and apply it to prove refinements and generalisations of three partition identities. The first one, Siladić's theorem (2002), comes from vertex operator algebras. The second one, a conjectural identity of Primc (1999), comes from crystal base th…
We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results, including Schur's theorem, Bressoud's generalization of a theorem of Göllnitz, two of Andrews' generalizations of Schur's theorem, and the Andrews-Olsson identities.
Resorting to the recursions satisfied by the polynomials which converge to the right hand sides of the Rogers-Ramanujan type identities given by Sills and a determinant method presented in a paper by Ismail-Prodinger-Stanton, we obtain many new one-parameter generalizations of the Rogers-Ramanujan type identities, such as a generalization of the analytic versions of the first and second Göllnitz-Gordon partition identities, and generalizations of the first, second, and third Rogers-Selberg identities.
Given integers i,j,k,L,M, we establish a new double bounded q-series identity from which the three parameter (i,j,k) key identity of Alladi-Andrews-Gordon for Goellnitz's (big) theorem follows if L, M tend to infinity. When L = M, the identity yields a strong refinement of Goellnitz's theorem with a bound on the parts given by L. This is the first time a bounded version of Goellnitz's (big) theorem has been proved. This leads to new bounded versions of Jacobi's triple product identity for theta functions and other fundamental identities.
Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of congruences: for any integers $α\ge 1$ and $n \ge 0$, \[\mathrm{pod}_{-4}\Big({{3}^{α+1}}n+\frac{5\cdot {{3}^{α}}+1}{2}\Big)\equiv 0 \pmod{9}.\] We also establish some internal congruences and some congruences modulo 2, 5 and 8 satisfied by $\mathrm{pod}_{-4}(n)$.
It is proved that the vertex set of any simple graph $G$ can be equitably partitioned into $k$ subsets for any integer $k\geq\max\{\big\lceil\frac{Δ(G)+1}{2}\big\rceil,\big\lceil\frac{|G|}{4}\big\rceil\}$ so that each of them induces a linear forest.
Let $\mathrm{pod}_{-3}(n)$ denote the number of partition triples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-3}(n)$ involving the following infinite family of congruences: for any integers $α\ge 1$ and $n\ge 0$, \[\mathrm{pod}_{-3}\Big({{3}^{2α+2}}n+\frac{23\times {{3}^{2α+1}}+3}{8}\Big)\equiv 0 \pmod{9}.\] We also establish some arithmetic relations between $\mathrm{pod}(n)$ and $\mathrm{pod}_{-3}(n)$, as well as some congruences for $\mathrm{pod}_{-3}(n)$ modulo 7 and 11.
By considering a limiting form of the q-Dixon_4ϕ_3 summation, we prove a weighted partition theorem involving odd parts differing by >= 4. A two parameter refinement of this theorem is then deduced from a quartic reformulation of Goellnitz's (Big) theorem due to Alladi, and this leads to a two parameter extension of Jacobi's triple product identity for theta functions. Finally, refinements of certain modular identities of Alladi connected to the Goellnitz-Gordon series are shown to follow from a limiting form of the q-Dixon_4ϕ_3 summation.
Let $cϕ_{k}(n)$ be the number of $k$-colored generalized Frobenius partitions of $n$. We establish some infinite families of congruences for $cϕ_{3}(n)$ and $cϕ_{9}(n)$ modulo arbitrary powers of 3, which refine the results of Kolitsch. For example, for $k\ge 3$ and $n\ge 0$, we prove that \[cϕ_{3}\Big(3^{2k}n+\frac{7\cdot 3^{2k}+1}{8}\Big) \equiv 0 \pmod{3^{4k+5}}.\] We give two different proofs to the congruences satisfied by $cϕ_{9}(n)$. One of the proofs uses an relation between $cϕ_{9}(n)$ and $cϕ_{3}(n)$ due to Kolitsch, for which we provide a new proof in this paper.
Let $G_1, \dots, G_k$ be vector spaces over a finite field $\mathbb{F} = \mathbb{F}_q$ with a non-trivial additive character $χ$. The analytic rank of a multilinear form $α\colon G_1 \times \dots \times G_k \to \mathbb{F}$ is defined as $\operatorname{arank}(α) = -\log_q \mathbb{E}_{x_1 \in G_1, \dots, x_k\in G_k} χ\big(α(x_1,\dots, x_k)\big)$. The partition rank $\operatorname{prank}(α)$ of $α$ is the smallest number of maps of partition rank 1 that add up to $α$, where a map is of partition rank 1 if it can be written as a product of two multilinear forms, depending on different coordinates.…
In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq F\subseteq {1,2,...,k\} \big}$ for some $k$-term sequence of natural numbers $x_1<x_2 < ... < x_k$. We say $A \subseteq \nats$ is finite FS-big if $A$ is $k$-summable for each positive integer $k$. We say is $A \subseteq \nats$ is infinite FS-big if for each positive integer $k,$ $A$ contains ${\sum_{n\in F}x_n | \emp\neq F\subseteq \nats and #F\leq k}$ for some in…
In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra $U_q \big( \widehat{\mathfrak{sl}} (1 | n) \big)$. We establish various combinatorial results for these vertex models and symmetric functions, which include the following. (1) We apply the fusion procedure to the fundamental $R$-matrix for $U_q \big( \widehat{\mathfrak{sl}} (1 | n) \big)$ to obtain an explicit family of vertex weights satisfying the Yang-Baxter equation. (2) We define families of symmetric…
We show a general scheme of Ramsey-type results for partitions of countable sets of finite functions, where "one piece is big" is interpreted in the language originating in creature forcing. The heart of our proofs follows Glazer's proof of the Hindman Theorem, so we prove the existence of idempotent ultrafilters with respect to suitable operation. Then we deduce partition theorems related to creature forcings.
For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for bounded-degree graphs. We present new algorithmic results for approximating the partition function and sampling from the Gibbs distribution for spin systems in the non-uniqueness region on random regular bipartite graphs. We give an $\mathsf{FPRAS}$ for counting $q$-colorings for even $q=O\big(\tfracΔ{\logΔ}\big)$ on almost every $Δ$-regular bipartite graph. Th…
It is known that the Kronecker coefficient of three partitions is a bounded and weakly increasing sequence if one increases the first part of all three partitions. Furthermore if the first parts of partitions λ,μare big enough then the coefficients of the Kronecker product [λ][μ]=\sum_\n g(ł,\m,\n)[ν] do not depend on the first part but only on the other parts. The reduced Kronecker product [λ]_\bullet \star[μ]_\bullet can be viewed (roughly) as the Kronecker product [(n-|λ|,λ)][(n-|μ|,\m)] for n big enough. In this paper we classify the reduced Kronecker products which are multiplicity free a…
We consider the space $[0,n]^3$, imagined as a three dimensional, axis-aligned grid world partitioned into $n^3$ $1\times 1 \times 1$ unit cubes. Each cube is either considered to be empty, in which case a line of sight can pass through it, or obstructing, in which case no line of sight can pass through it. From a given position, some of these obstructing cubes block one's view of other obstructing cubes, leading to the following extremal problem: What is the largest number of obstructing cubes that can be simultaneously visible from the surface of an observer cube, over all possible choices o…
