Related papers: Growth rates of permutation classes: from countabl…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

In an evolutionary system in which the rules of mutation are local in nature, the number of possible outcomes after $m$ mutations is an exponential function of $m$ but with a rate that depends only on the set of rules and not the size of…

We define the class of groups of bounded type from tile inflations. These tile inflations also determine some automata describing the groups. In the case when the automata are stationary, we show that if the set of incompressible elements…

We enumerate three specific permutation classes defined by two forbidden patterns of length four. The techniques involve inflations of geometric grid classes.

We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

We give a general asymptotic formula for the growth rate of the number of indecomposable summands in the tensor powers of representations of finite groups, over a field of arbitrary characteristic. In characteristic zero we obtain…

We complete the computation of growth rate of cluster algebras. In particular, we show that growth of all exceptional non-affine mutation-finite cluster algebras is exponential.

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…

We define a large class of abstract Coxeter groups, that we call $\infty$--spanned, and for which the word growth rate and the geodesic growth rate appear to be Perron numbers. This class contains a fair amount of Coxeter groups acting on…

Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of…

Among the mutation finite cluster algebras the tubular ones are a particularly interesting class. We show that all tubular (simply laced) cluster algebras are of exponential growth by two different methods: first by studying the…

We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…

We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

There is a well-known upper bound on the growth rate of the merge of two permutation classes. Curiously, there is no known merge for which this bound is not achieved. Using staircases of permutation classes, we provide sufficient conditions…

The growth rate function $r_N$ counts the number of irreducible representations of simple complex Lie groups of dimension $N$. While no explicit formula is known for this function, previous works have found bounds for $R_N=\sum_{i=1}^Nr_i$.…

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…