Related papers: Dual Graphs and Generating Sequences of Non-diviso…
The phylogenetic semigroup on a graph generalizes the Jukes-Cantor binary model on a tree. Minimal generating sets of phylogenetic semigroups have been described for trivalent trees by Buczy\'nska and Wi\'sniewski, and for trivalent graphs…
Non-Abelian fractional supersymmetry algebra in two dimensions is introduced utilizing $U_q(sl(2,\Rcc))$ at roots of unity. Its representations and the matrix elements are obtained. The dual of it is constructed and the corepresentations…
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…
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.…
Graph generation is one of the most challenging tasks in recent years, and its core is to learn the ground truth distribution hiding in the training data. However, training data may not be available due to security concerns or unaffordable…
Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…
Graphs are important data representations for describing objects and their relationships, which appear in a wide diversity of real-world scenarios. As one of a critical problem in this area, graph generation considers learning the…
Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks…
The graphicality problem -- whether or not a sequence of integers can be used to create a simple graph -- is a key question in network theory and combinatorics, with many important practical applications. In this work, we study the…
It is well known that for a regular semistable curve $\mathfrak X$ over a DVR with algebraically closed residue field, the spanning trees of the dual graph of the special fiber of $\mathfrak X$ are in bijection with components of the…
We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…
The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ of a ribbon graph $G$ is the generating function that enumerates all partial duals of $G$. In this paper, we give a categorification for this polynomial. The key ingredient of…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…
Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results…
We consider the question of when a semigroup is the semigroup of a valuation dominating a two dimensional noetherian local domain, giving some surprising examples. We give a necessary and sufficient condition for the pair of a semigroup S…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
Graph generative models have broad applications in biology, chemistry and social science. However, modelling and understanding the generative process of graphs is challenging due to the discrete and high-dimensional nature of graphs, as…
Learning generative models for graph-structured data is challenging because graphs are discrete, combinatorial, and the underlying data distribution is invariant to the ordering of nodes. However, most of the existing generative models for…