Related papers: A skeleton model to enumerate standard puzzle sequ…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively applies binary splits to divide the set of classes into two subsets, and trains a binary…
We present a combinatorial model for cluster algebras of type $D_n$ in terms of centrally symmetric pseudotriangulations of a regular $2n$-gon with a small disk in the centre. This model provides convenient and uniform interpretations for…
Variations of human body skeletons may be considered as dynamic graphs, which are generic data representation for numerous real-world applications. In this paper, we propose a spatio-temporal graph convolution (STGC) approach for assembling…
Using an asymmetric associative network with synchronous updating, it is possible to recall a sequence of patterns. To obtain a stable sequence generation with a large storage capacity, we introduce a threshold that eliminates the…
The notion of a $\tau$-exceptional sequence was introduced by Buan and Marsh in 2018 as a generalisation of an exceptional sequence for finite dimensional algebras. We calculate the number of complete $\tau$-exceptional sequences over…
A chessboard has the property that every row and every column has as many white squares as black squares. In this mostly methodological note, we address the problem of counting such rectangular arrays with a fixed (numeric) number of rows,…
Stacking, a potent ensemble learning method, leverages a meta-model to harness the strengths of multiple base models, thereby enhancing prediction accuracy. Traditional stacking techniques typically utilize established learning models, such…
Graph convolutional networks (GCNs) can effectively capture the features of related nodes and improve the performance of the model. More attention is paid to employing GCN in Skeleton-Based action recognition. But existing methods based on…
We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…
The Catalan numbers form a sequence that counts over 200 combinatorial objects. A remarkable property of the Catalan numbers, which extends to these objects, is its recursive definition; that is, we can determine the $n^{th}$ object from…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural…
This paper proposes JiGAN, a GAN-based method for solving Jigsaw puzzles with eroded or missing borders. Missing borders is a common real-world situation, for example, when dealing with the reconstruction of broken artifacts or ruined…
SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a…
Let $G$ be a finite, simple, connected graph. An arithmetical structure on $G$ is a pair of positive integer vectors $\mathbf{d},\mathbf{r}$ such that $(\mathrm{diag}(\mathbf{d})-A)\mathbf{r}=0$, where $A$ is the adjacency matrix of $G$. We…
This paper presents a new axis-based shape representation scheme along with a matching framework to address the problem of generic shape recognition. The main idea is to define the relative spatial arrangement of local symmetry axes and…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
The application of fermion-boson symmetry to the standard model leads to the following: first, there are three generations of scalar quarks and scalar leptons in addition to the known quarks and leptons, and, secondly, the divergences in…
We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known…