Search arXiv⌕ Search

arXiv · 2501.10721

Equilibrium Combinatorial Self-Assembly via Generating Functions

Abstract

We develop a generating-function calculus for equilibrium combinatorial self-assembly. Starting from a bond-level specification of allowable interactions, we define a symmetry-weighted species generating function whose evaluation yields equilibrium concentrations, and an ensemble generating function (an exponential transform) that packages equilibrium probabilities of mixtures. We ground these objects in both deterministic (coagulation-fragmentation) and stochastic (master equation) dynamics, showing how detailed balance leads to the equilibrium expressions and how the exponential generating function arises as a partition function. We develop a formal power series calculus -- derivatives, integrals, exponentials, composition -- where each operation acquires a precise combinatorial interpretation. The paper is organized around two regimes: cycle-free assembly, where binding equations for the species generating function are nonlinear and the ensemble equation couples to the species generating function; and assembly with cycles, where a cycle-opening term enters the species equation and the exponential transform linearizes the ensemble equation into a closed linear PDE with operator-exponential solutions. Each regime is developed with a linear polymer worked example in which we compute equilibrium concentrations, extract canonical partition functions, and derive canonical factorial moments. A cross-linked polymer example -- combining heterotypic chain bonds with homotypic cross-links -- illustrates both regimes together, yielding a factorized canonical partition function and an explicit gelation surface.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrés Ortiz-Muñoz. 2026-06-15. Equilibrium Combinatorial Self-Assembly via Generating Functions. https://arxiv.org/abs/2501.10721

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗