Related papers: Bivariate Generating Functions Enumerating Non-Bon…
We study the Gram determinant and construct bases of hom spaces for the one-dimensional topological theory of decorated unoriented one-dimensional cobordisms, as recently defined by Khovanov, when the pair of generating functions is linear.
The computation of matrix functions is a well-studied problem. Of special importance are the exponential and the logarithm of a matrix, where the latter also raises existence and uniqueness questions. This is particularly relevant in the…
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We investigate structure for pairs of randomizations that do not follow each other in a chain. These are unrandomized-inclusive, independent, coincident or double randomizations. This involves taking several structures that satisfy…
In this paper, we consider classes of decision tables with many-valued decisions closed under operations of removal of columns, changing of decisions, permutation of columns, and duplication of columns. We study relationships among three…
Non-overlapping codes are a set of codewords in $\bigcup_{n \ge 2} \mathbb{Z}_q^n$, where $\mathbb{Z}_q = \{0,1,\dots,q-1\}$, such that, the prefix of each codeword is not a suffix of any codeword in the set, including itself; and for…
We study tilings of rectangular boards using unit squares together with a single type of big tile shaped as a Ferrers diagram. We derive generating functions for these tilings, prove real-rootedness and interlacing properties of associated…
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…
Convolutions for Tribonacci numbers involving binomial coefficients are treated with ordinary generating functions and the diagonalization method of Hautus and Klarner. In this way, the relevant generating function can be established, which…
It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
We construct a generating functional for the exact evalutation of a coherent representation of spin network amplitudes. This generating functional is defined for arbitrary graphs and depends only on a pair of spinors for each edge. The…
In 2019, Butler, Choi, Kim, and Seo introduced a new type of juggling card that represents multiplex juggling patterns in a natural bijective way. They conjectured a formula for the generating function for the number of multiplex juggling…
Two criteria for planarity of a Feynman diagram upon its propagators (momentum flows) are presented. Instructive Mathematica programs that solve the problem and examples are provided. A simple geometric argument is used to show that while…
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
In a region R consisting of unit squares, a (domino) tiling is a collection of dominoes (the union of two adjacent squares) which pave fully the region. The flip graph of R is defined on the set of all tilings of R where two tilings are…