Related papers: Classical length-5 pattern-avoiding permutations
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of…
In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…
Understanding how language model performance varies with scale is critical to benchmark and algorithm development. Scaling laws are one approach to building this understanding, but the requirement of training models across many different…
The Stieltjes moment problem is studied in a new framework within the general Gelfand-Shilov spaces defined via weight sequences. The novelty consists of allowing for a naturally larger target space for the moment mapping, which sends a…
We offer elementary proofs for several results in consecutive pattern containment that were previously demonstrated using ideas from cluster method and analytical combinatorics. Furthermore, we establish new general bounds on the growth…
Finding distributions of permutation statistics over pattern-avoiding classes of permutations attracted much attention in the literature. In particular, Bukata et al. found distributions of ascents and descents on permutations avoiding any…
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…
For a fixed integer $m\ge 1$, let $\mathcal{A}_n^{(m)}$ be the set of permutations $\pi\in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1}-\pi_i|\le m$ for all $i$. Here, a pattern $132$ means three indices…
In context of the Wolfram Physics Project, a certain class of abstract rewrite systems known as "multiway systems" have played an important role in discrete models of spacetime and quantum mechanics. However, as abstract mathematical…
Sergey Kitaev has shown that the exponential generating function for permutations avoiding the generalized pattern $\sigma$-$k$, where $\sigma$ is a pattern without dashes and $k$ is one greater than the biggest element in $\sigma$, is…
In this paper, we consider cyclic permutations that avoid the monotone decreasing permutation $k(k-1)\ldots 21$, whose cycle also demonstrates some pattern avoidance. If the cycle is written in standard form with 1 appearing at the…
We extend the Siegel-Walfisz theorem to a family of integer sequences that are characterized by constraints on the size of the prime factors. Besides prime powers, this family includes smooth numbers, almost primes and practical numbers.
The study of pattern avoidance in linear permutations has been an active area of research for almost half a century now, starting with the work of Knuth in 1973. More recently, the question of pattern avoidance in circular permutations has…
Recent works have highlighted optimization difficulties faced by gradient descent in training the first and last layers of transformer-based language models, which are overcome by optimizers such as Adam. These works suggest that the…
Unlike the well-studied models of growing networks, where the dominant dynamics consist of insertions of new nodes and connections, and rewiring of existing links, we study {\em ad hoc} networks, where one also has to contend with rapid and…
We consider normalizing sequences that can give rise to nondegenerate limittheorems for Birkhoff sums under the iteration of a conservative map. Mostclassical limit theorems involve normalizing sequences that are polynomial,possibly with an…
In this paper, we study the Wilf-type equivalence relations among multiset permutations. We identify all multiset equivalences among pairs of patterns consisting of a pattern of length three and another pattern of length at most four. To…
We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…
We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $\alpha$-stable laws and…
Zipf's power-law distribution is a generic empirical statistical regularity found in many complex systems. However, rather than universality with a single power-law exponent (equal to 1 for Zipf's law), there are many reported deviations…