Related papers: N-graphs, modular Sidon and sum-free sets, and par…
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…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…
We utilize the technique of staircases and jagged partitions to provide analytic sum-sides to some old and new partition identities of Rogers-Ramanujan type. Firstly, we conjecture a class of new partition identities related to the…
Let ${{B}_{3}}(n)$ denote the number of partition triples of $n$ where each partition is 3-core. With the help of generating function manipulations, we find several infinite families of arithmetic identities and congruences for…
We generalize the notion of identities among relations, well known for presentations of groups, to presentations of n-categories by polygraphs. To each polygraph, we associate a track n-category, generalizing the notion of crossed module…
We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of one-vertex insertions v_1,...,v_n, such that the neighbourhood of vertex v_i, 2<= i<= n, forms a module (a homogeneous set) of the graph…
The problem of determining the Tur\'an number of $C_4$ is a well studied problem that dates back to a paper of Erd\"os from 1938. It is known that Sidon sets can be used to construct $C_4$-free graphs. If $\A$ is a Sidon set in the abelian…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…
A partition of a positive integer $n$ is defined as a non-increasing sequence $P = [y_0, y_1, ..., y_m]$ of positive integers which sum to $n$, where the $y_i$ are called the $parts$ of the partition. A Young diagram is a visual…
We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…
Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
We construct and study the space C(\R^d,n) of all partitions of \R^d into n non-empty open convex regions (n-partitions). A representation on the upper hemisphere of an n-sphere is used to obtain a metric and thus a topology on this space.…
We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…
For the SU(3) system of graphs generalizing the ADE Dynkin digrams in the classification of modular invariant partition functions in CFT, we present a general collection of algebraic objects and relations that describe fusion properties and…
Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $\nu(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author…
We give formulae for a module presentation of the module of identities among relations for a presentation of a group, in terms of information on 0- and 1-combings of the Cayley graph. This is seen as a special case of extending a partial…