Related papers: Constructing Skolem sequences via generating trees
A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This characterization yields a linear-time algorithm for…
The ability to generate natural language sequences from source code snippets has a variety of applications such as code summarization, documentation, and retrieval. Sequence-to-sequence (seq2seq) models, adopted from neural machine…
We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary…
Generating mathematical equations from natural language requires an accurate understanding of the relations among math expressions. Existing approaches can be broadly categorized into token-level and expression-level generation. The former…
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…
Curriculum learning has shown promising improvements in multiple domains by training machine learning models from easy samples to hard ones. Previous works which either design rules or train models for scoring the difficulty highly rely on…
Random Forests are one of the most popular classifiers in machine learning. The larger they are, the more precise is the outcome of their predictions. However, this comes at a cost: their running time for classification grows linearly with…
A partition on [n] has an m-nesting if there exists i_1 < i_2 < ... < i_m < j_m < j_{m-1} < ... < j_1, where i_l and j_l are in the same block for all 1 <= l <= m. We use generating trees to construct the class of partitions with no…
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators $\mathfrak{G}$…
We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
In almost all text generation applications, word sequences are constructed in a left-to-right (L2R) or right-to-left (R2L) manner, as natural language sentences are written either L2R or R2L. However, we find that the natural language…
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…
In this paper we provide a way to construct new moment sequences from a given moment sequence. An operator based on multivariate positive polynomials is applied to get the new moment sequences. A class of new sequences is corresponding to a…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…
This work discusses an approach to solving geometric construction problems in which the given figure is included in a set ordered by construction steps. The flow of information is carried through the chain, allowing the original problem to…
Synthesizing realistic 3D indoor scenes is a challenging task that traditionally relies on manual arrangement and annotation by expert designers. Recent advances in autoregressive models have automated this process, but they often lack…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish…
Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially…