Related papers: Valleyless Sequences
In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for…
The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…
In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
Sampling is a fundamental technique, and sampling without replacement is often desirable when duplicate samples are not beneficial. Within machine learning, sampling is useful for generating diverse outputs from a trained model. We present…
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…
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…
A sequential piecewise linear programming method is presented where bounded domains of non-convex functions are successively contracted about the solution of a piecewise linear program at each iteration of the algorithm. Although…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
We consider character sequences evolving on a phylogenetic tree under the TKF91 model. We show that as the sequence lengths tend to infinity the the topology of the phylogenetic tree and the edge lengths are determined by any one of (a) the…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
An improved upper bound is obtained for the density of sequences of positive integers that contain no k-term geometric progression.
We introduce the notion of minimal inversion sequences for a pattern $\rho$, which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of $\rho$ for inversion sequences. We give a characterization of…
Muller and Schupp introduced the concept of context-free graphs (originating from Cayley graphs of context-free groups). These graphs are always tree-like (i.e. quasi-isometric to a tree) and in this paper we investigate the subclass of…
In this paper, we introduce a new method for computing generating functions with respect to the number of descents and left-to-right minima over the set of permutations which have no consecutive occurrences of a pattern that starts with 1.
We introduce a family of synthetic languages with hierarchical structure -- generated by a broadcast process on trees -- for which the role of context length and reasoning in autoregressive generation can be analyzed precisely. At the heart…
Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…
We present a new probabilistic proof of Otter's asymptotic formula for the number of unlabelled trees with a given number of vertices. We additionally prove a new approximation result, showing that the total variation distance between…
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as…
Maximal green sequences are particular sequences of quiver mutations appearing in the context of quantum dilogarithm identities and supersymmetric gauge theory. Interpreting maximal green sequences as paths in various natural posets arising…