Related papers: Bivariate Generating Functions Enumerating Non-Bon…
We present a rejection method based on recursive covering of the probability density function with equal tiles. The concept works for any probability density function that is pointwise computable or representable by tabular data. By the…
Based on tensor neural network, we propose an interpolation method for high dimensional non-tensor-product-type functions. This interpolation scheme is designed by using the tensor neural network based machine learning method. This means…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
We present a multivariate generating function for all n x n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients…
Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this chapter we generalize that result. Let a p-column polyomino be a polyomino whose columns…
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.…
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…
A formula for the number of toroidal m x n binary arrays, allowing rotation of the rows and/or the columns but not reflection, is known. Here we find a formula for the number of toroidal m x n binary arrays, allowing rotation and/or…
Given a quiver algebra A with relations defined by a superpotential, this paper defines a set of invariants of A counting framed cyclic A-modules, analogous to rank-1 Donaldson-Thomas invariants of Calabi-Yau threefolds. For the special…
Using diagrammatic techniques, we provide explicit functional relations between the cumulant generating functions for the biunitarily invariant ensembles in the limit of large size of matrices. The formalism allows to map two distinct areas…
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…
In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams in a planar way. This…
Let $m,k$ be fixed positive integers. Determining the generating function for the number of tilings of an $m\times n$ rectangle by $k\times 1$ rectangles is a long-standing open problem to which the answer is only known in certain special…
We consider the tiling generating functions of semi-hexagons and quartered hexagons with dents on their sides. In general, there are no simple product formulas for these generating functions. However, we show that the modification in the…
In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of {\it crossing numbers} for tilings and derive bounds on the crossing numbers of faultfree…
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…
The Complex Boolean Turing Machine (CBTM) characterizes non-deterministic computation using the abstract generator $\alpha$, but the abstractness of $\alpha$ makes it difficult to understand intuitively. In this paper, by concretizing…
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…