Related papers: Classical length-5 pattern-avoiding permutations
The self-alignment concentrations, $c(x)$, as functions of the length, $x$, of the identically matching maximal segments in the genomes of a variety of species, typically present power-law tails extending to the largest scales, i.e., $c(x)…
We introduce and investigate the algebras of steadily growing length, that is the class of algebras, where the length is bounded by a linear function of the dimension. In particular we show that Malcev algebras belong to this class and…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
This note extends the results of classical parametric statistics like Fisher and Wilks theorem to modern setups with a high or infinite parameter dimension, limited sample size, and possible model misspecification. We consider a special…
The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…
Stankova and West showed that for any non-negative integer $s$ and any permutation $\gamma$ of $\{4,5,\dots,s+3\}$ there are as many permutations that avoid $231\gamma$ as there are that avoid $312\gamma$. We extend this result to the…
Zipf's law is a fundamental paradigm in the statistics of written and spoken natural language as well as in other communication systems. We raise the question of the elementary units for which Zipf's law should hold in the most natural way,…
We consider stochastic processes where randomly chosen particles with positive quantities x, y (> 0) interact and exchange the quantities asymmetrically by the rule x' = c{(1-a) x + b y}, y' = d{a x + (1-b) y} (x \ge y), where (0 \le) a, b…
We use the cluster method to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite…
We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…
Since the sequencing of large genomes, many statistical features of their sequences have been found. One intriguing feature is that certain subsequences are much more abundant than others. In fact, abundances of subsequences of a given…
Continuous-time branching processes describe the evolution of a population whose individuals generate a random number of children according to a birth process. Such branching processes can be used to understand preferential attachment…
We present four constructions of inversion sequences, and use them to compute the enumeration sequences of 24 classes of pattern-avoiding inversion sequences. This completes the enumeration of inversion sequences avoiding one or two…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
The maximally clustered permutations are characterized by avoiding the classical permutation patterns 3421, 4312, and 4321. This class contains the freely-braided permutations and the fully-commutative permutations. In this work, we show…
Many studies in Economics and other disciplines have been reporting distributions following power-law behavior (i.e distributions of incomes (Pareto's law), city sizes (Zipf's law), frequencies of words in long sequences of text etc.)[1, 6,…
The first problem addressed by this article is the enumeration of some families of pattern-avoiding inversion sequences. We solve some enumerative conjectures left open by the foundational work on the topics by Corteel et al., some of these…
Pin sequences play an important role in the structural study of permutation classes. In this paper, we study the permutation classes that comprise all the finite subpermutations contained in an infinite pin sequence. We prove that these…
We investigate two Stieltjes continued fractions given by the paperfolding sequence and the Rudin-Shapiro sequence. By explicitly describing certain subsequences of the convergents $P_n(x)/Q_n(x)$ modulo $4$, we give the formal power series…