相关论文: Generating trees for permutations avoiding general…

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets…

Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…

Let $S_n$ denote the group all permutations of $n$. For every permutation $\sigma$, we let $\mathrm{des}(\sigma)$ denote the number of descents in $\sigma$ and $\mathrm{LRMin}(\sigma)$ denote the number of left-to-right minima of $\sigma$.…

We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating…

Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…

The generation of trees with a specified tree edit distance has significant applications across various fields, including computational biology, structured data analysis, and image processing. Recently, generative networks have been…

We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…

We propose TD-GEN, a graph generation framework based on tree decomposition, and introduce a reduced upper bound on the maximum number of decisions needed for graph generation. The framework includes a permutation invariant tree generation…

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 discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words,…

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…

Text generation is a fundamental building block in natural language processing tasks. Existing sequential models performs autoregression directly over the text sequence and have difficulty generating long sentences of complex structures.…

The typical problem in Data Science is creating a structure that encodes the occurrence frequency of unique elements in rows and relations between different rows of a data frame. We present the probability tree abstract data structure, an…

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…

Given a gene tree and a species tree, ancestral configurations represent the combinatorially distinct sets of gene lineages that can reach a given node of the species tree. They have been introduced as a data structure for use in the…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…