Related papers: A Franklin Type Involution for Squares
Andrews and Keith recently produced a general Schmidt type partition theorem using a novel interpretation of Stockhofe's bijection, which they used to find new $q$-series identities. This includes an identity for a trivariate 2-colored…
Andrews and Merca introduced and proved a $q$-series expansion for the partial sums of the $q$-series in Euler's pentagonal number theorem. Kolitsch, in 2022, introduced a generalization of the Andrews-Merca identity via a finite sum…
An {\em orthomorphism} over a finite field $\mathbb{F}$ is a permutation $\theta:\mathbb{F}\mapsto\mathbb{F}$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}$. The orthomorphism $\theta$ is {\em cyclotomic of…
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…
Oberdieck and Pandharipande conjectured that the curve counting invariants of $S\times E$, the product of a $K3$ surface and an elliptic curve, is given by minus the reciprocal of the Igusa cusp form of weight 10. For a fixed primitive…
We study the representation theory of the uniform block permutation algebra in the context of the representation theory of factorizable inverse monoids. The uniform block permutation algebra is a subalgebra of the partition algebra and is…
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…
When one expands a Schur function in terms of the irreducible characters of the symplectic (or orthogonal) group, the coefficient of the trivial character is 0 unless the indexing partition has an appropriate form. A number of q-analogues…
We refine and generalise a Rogers-Ramanujan type partition identity arising from crystal base theory. Our proof uses the variant of the method of weighted words recently introduced by the first author.
Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…
This note is devoted to a combinatorial proof of a Schmidt type theorem due to Andrews and Paule. A four-variable refinement of Andrews and Paule's theorem is also obtained based on this combinatorial construction.
The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…
We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…
Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…
Eigenvectors of the discrete Fourier transform can be expressed using Ramanujan theta functions. New theta function identities, Ramanujan theta function identities, and generating functions for the quadratic numbers are a consequence.
Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective…
The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain…