English
Related papers

Related papers: Growth rates for subclasses of Av(321)

200 papers

Our main results in this paper are new equidistributions on plane trees and $132$-avoiding permutations, two closely related objects. As for the former, we discover a characteristic for vertices of plane trees that is equally distributed as…

Combinatorics · Mathematics 2024-09-09 Zi-Wei Bai , Ricky X. F. Chen

Models of bacterial growth tend to be `irreversible', allowing for the number of bacteria in a colony to increase but not to decrease. By contrast, models of molecular self-assembly are usually `reversible', allowing for addition and…

Statistical Mechanics · Physics 2017-10-18 Katherine Klymko , Juan P. Garrahan , Stephen Whitelam

The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth…

Formal Languages and Automata Theory · Computer Science 2019-02-20 Robert Mercas , Pascal Ochem , Alexei V. Samsonov , Arseny M. Shur

We review models of compositional growth, which were introduced to explain the growth statistics of various quantities ranging from firm sizes to GDP. In these models, entities are decomposed into units that grow independently. Thus, the…

General Economics · Economics 2024-04-12 José Moran , Massimo Riccaboni

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

Number Theory · Mathematics 2021-04-07 James Maynard

In this paper we study the enumeration and the construction of particular binary words avoiding the pattern $1^{j+1}0^j$. By means of the theory of Riordan arrays, we solve the enumeration problem and we give a particular succession rule,…

Discrete Mathematics · Computer Science 2011-03-30 Stefano Bilotta , Donatella Merlini , Elisa Pergola , Renzo Pinzani

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Number Theory · Mathematics 2015-09-08 Janos Pintz

This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…

Algebraic Geometry · Mathematics 2015-09-02 Jérémy Blanc , Julie Déserti

We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove…

Group Theory · Mathematics 2017-10-18 Miklos Abert , Tsachik Gelander , Nikolay Nikolov

The growth of spiral mounds containing a screw dislocation is compared to the growth of wedding cakes by two-dimensional nucleation. Using phase field simulations and homoepitaxial growth experiments on the Pt(111) surface we show that both…

Materials Science · Physics 2008-03-20 A. Redinger , O. Ricken , P. Kuhn , A. Raetz , A. Voigt , J. Krug , T. Michely

Barren-plateau results have established exponential gradient suppression as a widely cited obstacle to the scalability of variational quantum algorithms. When and whether these results extend to a given objective has been addressed through…

Quantum Physics · Physics 2026-04-22 Gordon Ma , Xiufan Li

The growth of an actin network against an obstacle that stimulates branching locally is studied using several variants of a kinetic rate model based on the orientation-dependent number density of filaments. The model emphasizes the effects…

Biological Physics · Physics 2009-11-10 A. E. Carlsson

In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes

Number Theory · Mathematics 2010-04-08 Janos Pintz

We investigate pattern-avoiding (0,1)-matrices as generalizations of pattern-avoiding permutations. Our emphasis is on 123-avoiding and 321-avoiding patterns for which we obtain exact results as to the maximum number of 1's such matrices…

Combinatorics · Mathematics 2020-05-06 Richard A. Brualdi , Lei Cao

We develop an approach to efficiently grow neural networks, within which parameterization and optimization strategies are designed by considering their effects on the training dynamics. Unlike existing growing methods, which follow simple…

Machine Learning · Computer Science 2023-06-23 Xin Yuan , Pedro Savarese , Michael Maire

Let ${\rm cs}(G)$ denote the set of conjugacy class sizes of a group $G$, and let ${\rm cs}^*(G)={\rm cs}(G)\setminus\{1\}$ be the sizes of non-central classes. We prove three results. We classify all finite groups $G$ with ${\rm…

Group Theory · Mathematics 2020-06-09 Mariagrazia Bianchi , Cheryl E. Praeger , S. P. Glasby

This paper investigates pattern avoidance in linear extensions of a certain class of partially ordered set. Since the question of enumerating pattern avoiding linear extensions of posets in general is a very hard one, we focus instead on…

Combinatorics · Mathematics 2014-12-23 Sophia Yakoubov

We give a comprehensive rate equation description for the irreversible growth of aggregates by migration from small to large aggregates. For a homogeneous rate K(i;j) at which monomers migrate from aggregates of size i to those of size j,…

Statistical Mechanics · Physics 2009-11-07 F. Leyvraz , S. Redner

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…

Combinatorics · Mathematics 2012-10-24 Sergi Elizalde , Marc Noy

Let $\mathscr{S}$ be the class of all structures whose growth rate on orbits of subsets of size $n$ is not faster than $\frac{2^n}{p(n)}$ for any polynomial $p$. In this article we give a complete classification of all structures in…

Logic · Mathematics 2025-07-24 Bertalan Bodor
‹ Prev 1 3 4 5 6 7 10 Next ›