English
Related papers

Related papers: Asymptotic enumeration of permutations avoiding ge…

200 papers

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…

Combinatorics · Mathematics 2008-05-14 Marteinn T. Hardarson

Consider a sample of size $N$ from a population governed by a hierarchical species sampling model. We study the large $N$ asymptotic behavior of the number ${\bf K}_N$ of clusters and the number ${\bf M}_{r,N}$ of clusters with frequency…

Probability · Mathematics 2025-01-17 Stefano Favaro , Shui Feng , J. E. Paguyo

There are several versions of permutation pattern avoidance that have arisen in the literature, and some known examples of two different types of pattern avoidance coinciding. In this paper, we examine barred patterns and vincular patterns.…

Combinatorics · Mathematics 2013-01-28 Bridget Eileen Tenner

The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…

General Mathematics · Mathematics 2020-04-30 Victor Volfson

We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called "generalized patterns" or "dashed patterns"). In particular we provide an algorithm which takes in as input a set…

Combinatorics · Mathematics 2012-01-17 Andrew M. Baxter , Lara K. Pudwell

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

Combinatorics · Mathematics 2024-08-07 Anant Godbole , Hannah Swickheimer

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

Combinatorics · Mathematics 2007-11-05 Robert Parviainen

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…

Probability · Mathematics 2014-11-11 Neal Madras , Lerna Pehlivan

Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jessica A. Tomasko

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

Combinatorics · Mathematics 2026-03-17 Alexander Dobner

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…

Combinatorics · Mathematics 2024-11-06 Tian Han , Sergey Kitaev

In this paper, we compute the distributions of the statistic number of crossings over permutations avoiding one of the pairs $\{321,231\}$, $\{123,132\}$ and $\{123,213\}$. The obtained results are new combinatorial interpretations of two…

Combinatorics · Mathematics 2021-05-18 Paul M. Rakotomamonjy , Sandrataniaina R. Andriantsoa , Arthur Randrianarivony

We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset $\{1,1,2,2,\ldots, n,n\}$ that avoid the patterns 1212 and 2121. Their study is motivated by a known relationship between…

Combinatorics · Mathematics 2018-04-20 Kassie Archer , Adam Gregory , Bryan Pennington , Stephanie Slayden

Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative…

Combinatorics · Mathematics 2022-04-20 Sergey Kitaev , Artem Pyatkin

Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings,…

Combinatorics · Mathematics 2012-11-16 Jonathan Bloom , Sergi Elizalde

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…

Probability · Mathematics 2013-02-26 Ashkan Nikeghbali , Julia Storm , Dirk Zeindler

This paper studies the joint limiting behavior of extreme eigenvalues and trace of large sample covariance matrix in a generalized spiked population model, where the asymptotic regime is such that the dimension and sample size grow…

Statistics Theory · Mathematics 2019-06-25 Zeng Li , Fang Han , Jianfeng Yao

We consider the preferential attachment model. This is a growing random graph such that at each step a new vertex is added and forms $m$ connections. The neighbors of the new vertex are chosen at random with probability proportional to…

Probability · Mathematics 2024-04-11 Simone Baldassarri , Gianmarco Bet
‹ Prev 1 8 9 10 Next ›