Related papers: N-graphs, modular Sidon and sum-free sets, and par…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
We prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…
We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…
We provide a refined combinatorial identity for the set of partitions of $\{1,\dots, n\}$, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free…
In this paper we present a new class of integer partition identities. The number of partitions with d-distant parts can be represented as a sum of the number of partitions with 1-distant parts whose even parts are greater than twice the…
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
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…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We determine an infinite family of linear identities for the number $A_4(n)$ of partition pairs of $n$ with $4$-cores by employing elementary $q$-series techniques and certain $3$-dissection formulas. We then discover an infinite family of…
Consider an algebraic identity between elliptic modular graphs where several vertices are at fixed locations (and hence unintegrated) while the others are integrated over the toroidal worldsheet. At any unintegrated vertex, we can glue an…
In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…
We prove two partition identities which are dual to the Rogers-Ramanujan identities. These identities are inspired by (and proved using) a correspondence between three kinds of objects: a new type of partitions (neighborly partitions),…
A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…