Related papers: Growth rates for subclasses of Av(321)
I review the main steps made so far towards the construction of a (semi) analytical model for describing the growth history of bound virialized objects or haloes in the gravitational instability scenario. I mainly focus on those models…
An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove…
Mechanistic models can provide an intuitive and interpretable explanation of network growth by specifying a set of generative rules. These rules can be defined by domain knowledge about real-world mechanisms governing network growth or may…
We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…
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…
We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…
The crystallization proceeds by the advance of the crystal faces into the disordered phase at the expense of the supersaturation which is not sustained in our model. Using a conservation constraint for the transformation ratio and a kinetic…
During the last decade, self-affine geometrical properties of many growing aggregates, originated in a wide variety of processes, have been well characterized. However, little progress has been achieved in the search of a unified…
We study the distribution and the popularity of left children on sets of treeshelves avoiding a pattern of size three. (Treeshelves are ordered binary increasing trees where every child is connected to its parent by a left or a right link.)…
We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…
In this paper, we define a class of additive random growth models whose growth is at least and at most linear and prove an asymptotic shape theorem for these models. This proof generalizes already known proofs for the classical contact…
(Work in progress) Marcus and Tardos \cite{MarcusTardos2004} proved the Stanley--Wilf conjecture by reducing pattern avoidance to an extremal problem on $0$--$1$ matrices. We give a parallel proof for classical permutation patterns that…
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…
Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…
In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemer\'edi's…
We start by studying the distribution of (cyclically reduced) elements of the free groups with respect to their abelianization. We derive an explicit generating function, and a limiting distribution, by means of certain results (of…
We give a construction of the zero range and bricklayers' processes in the totally asymmetric, attractive case. The novelty is that we allow jump rates to grow exponentially. Earlier constructions have permitted at most linearly growing…
This Letter introduces a generalization of known duplication-divergence models for growing random graphs. This general duplication-divergence model includes a new coupled divergence asymmetry rate, which allows to obtain the structure of…
Optimization algorithms are increasingly being used in applications with limited time budgets. In many real-time and embedded scenarios, only a few iterations can be performed and traditional convergence metrics cannot be used to evaluate…
A graph class $\mathcal{G}$ has linear growth if, for each graph $G \in \mathcal{G}$ and every positive integer $r$, every subgraph of $G$ with radius at most $r$ contains $O(r)$ vertices. In this paper, we show that every graph class with…