7,849 research outputs found

    On consecutive pattern-avoiding permutations of length 4, 5 and beyond

    Full text link
    We review and extend what is known about the generating functions for consecutive pattern-avoiding permutations of length 4, 5 and beyond, and their asymptotic behaviour. There are respectively, seven length-4 and twenty-five length-5 consecutive-Wilf classes. D-finite differential equations are known for the reciprocal of the exponential generating functions for four of the length-4 and eight of the length-5 classes. We give the solutions of some of these ODEs. An unsolved functional equation is known for one more class of length-4, length-5 and beyond. We give the solution of this functional equation, and use it to show that the solution is not D-finite. For three further length-5 c-Wilf classes we give recurrences for two and a differential-functional equation for a third. For a fourth class we find a new algebraic solution. We give a polynomial-time algorithm to generate the coefficients of the generating functions which is faster than existing algorithms, and use this to (a) calculate the asymptotics for all classes of length 4 and length 5 to significantly greater precision than previously, and (b) use these extended series to search, unsuccessfully, for D-finite solutions for the unsolved classes, leading us to conjecture that the solutions are not D-finite. We have also searched, unsuccessfully, for differentially algebraic solutions.Comment: 23 pages, 2 figures (update of references, plus web link to enumeration data). Minor update. Typos corrected. One additional referenc

    Computational Approaches to Consecutive Pattern Avoidance in Permutations

    Full text link
    In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms have been implemented in the accompanying Maple package CAV, which can be downloaded from the author's website. As a byproduct of the first algorithm, we have a theorem giving a sufficient condition for when two pattern sets are strongly (consecutively) Wilf-Equivalent. For the implementation of the second algorithm, we define the cluster tail generating function and show that it always satisfies a certain functional equation. We also explain how the CAV package can be used to approximate asymptotic constants for single pattern avoidance.Comment: 12 page

    Place-difference-value patterns: A generalization of generalized permutation and word patterns

    Full text link
    Motivated by study of Mahonian statistics, in 2000, Babson and Steingrimsson introduced the notion of a "generalized permutation pattern" (GP) which generalizes the concept of "classical" permutation pattern introduced by Knuth in 1969. The invention of GPs led to a large number of publications related to properties of these patterns in permutations and words. Since the work of Babson and Steingrimsson, several further generalizations of permutation patterns have appeared in the literature, each bringing a new set of permutation or word pattern problems and often new connections with other combinatorial objects and disciplines. For example, Bousquet-Melou et al. introduced a new type of permutation pattern that allowed them to relate permutation patterns theory to the theory of partially ordered sets. In this paper we introduce yet another, more general definition of a pattern, called place-difference-value patterns (PDVP) that covers all of the most common definitions of permutation and/or word patterns that have occurred in the literature. PDVPs provide many new ways to develop the theory of patterns in permutations and words. We shall give several examples of PDVPs in both permutations and words that cannot be described in terms of any other pattern conditions that have been introduced previously. Finally, we raise several bijective questions linking our patterns to other combinatorial objects.Comment: 18 pages, 2 figures, 1 tabl

    Introduction to Partially Ordered Patterns

    Get PDF
    We review selected known results on partially ordered patterns (POPs) that include co-unimodal, multi- and shuffle patterns, peaks and valleys ((modified) maxima and minima) in permutations, the Horse permutations and others. We provide several (new) results on a class of POPs built on an arbitrary flat poset, obtaining, as corollaries, the bivariate generating function for the distribution of peaks (valleys) in permutations, links to Catalan, Narayna, and Pell numbers, as well as generalizations of few results in the literature including the descent distribution. Moreover, we discuss q-analogue for a result on non-overlapping segmented POPs. Finally, we suggest several open problems for further research.Comment: 23 pages; Discrete Applied Mathematics, to appea

    Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations

    Full text link
    Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by establishing bijections between these classes and various lattice paths. This allows us to prove nine conjectures of Defant.Comment: 18 pages, 16 figures, new version with updated abstract and reference
    • …
    corecore