Related papers: Linked partition ideals, directed graphs and $q$-m…
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…
We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…
Cell formation is a critical step in the design of cellular manufacturing systems. Recently, it was tackled using a cut-based-graph-partitioning model. This model meets real-life production systems requirements as it uses the actual amount…
A Q-system is a unitary version of a separable Frobenius algebra object in a C*-tensor category. In a recent joint work with P. Das, S. Ghosh and C. Jones, the author has categorified Bratteli diagrams and unitary connections by building a…
Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…
We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
We present a natural multiplicative theory of integer partitions (which are usually considered in terms of addition), and find many theorems of classical number theory arise as particular cases of extremely general combinatorial structure…
Graph Generating Dependencies (GGDs) informally express constraints between two (possibly different) graph patterns which enforce relationships on both graph's data (via property value constraints) and its structure (via topological…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
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…
In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…
We discuss the problem posed by Bender, Coley, Robbins and Rumsey of enumerating the number of subspaces which have a given profile with respect to a linear operator over the finite field $\mathbb{F}_q$. We solve this problem in the case…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
We calculate the partition function of the $q$-state Potts model on arbitrary-length cyclic ladder graphs of the square and triangular lattices, with a generalized external magnetic field that favors or disfavors a subset of spin values…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schl\"afli and Gould. Using q-analogs of Stirling numbers defined as inversion generating functions, we provide q-analogs of the two identities.…
For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent tree. We also give conditions on a rooted digraph G which allow us to construct a countable…