Related papers: Growth rates for subclasses of Av(321)
The Knot Entropy Conjecture states that the exponential growth rate of the number of $n$-edge lattice polygons with knot-type $K$ is the same as that for unknot polygons. Moreover, the next order growth follows a power law in $n$ with an…
To every finitely generated group one can assign the conjugacy growth function that counts the number of conjugacy classes intersecting a ball of radius $n$. Results of Ivanov and Osin show that the conjugacy growth function may be constant…
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
We model a social-encounter network where linked nodes match for reproduction in a manner depending probabilistically on each node`s attractiveness. The developed model reveals that increasing either the network`s mean degree or the…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
Let Mod(S) denote the mapping class group of a compact, orientable surface S. We prove that finitely generated subgroups of Mod(S) which are not virtually abelian have uniform exponential growth with minimal growth rate bounded below by a…
The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a…
We investigate the behavior of the dichotomy spectrum of nonautonomous linear systems under general growth rates. By introducing comparison criteria we clarify how $\mu$-dichotomy and $\mu$-bounded growth interact. We also study the…
We construct an increasing, submultiplicative, arbitrarily rapid function which is not equivalent to the growth function of any finitely generated algebra, demonstrating the difficulty in characterizing growth functions in an asymptotic…
An interesting feature of growth in animals is that different parts of the body grow at approximately the same rate. This property is called proportionate growth. In this paper, we review our recent work on patterns formed by adding $N$…
We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the…
We study the number of 231-avoiding permutations with $j$-descents and maximum drop is less than or equal to $k$ which we denote by $a_{n,231,j}^{(k)}$. We show that $a_{n,231,j}^{(k)}$ also counts the number of Dyck paths of length $2n$…
Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…
An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets…
Denote by an $l$-component a connected graph with $l$ edges more than vertices. We prove that the expected number of creations of $(l+1)$-component, by means of adding a new edge to an $l$-component in a randomly growing graph with $n$…
A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.