AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subsequence of length 3 is n3(n+32n) [0,0,1,6,27,110,429, ... (Sloane A3517)]
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
AbstractChung et al. (1978) have proved that the number of Baxter permutations on [n] is ∑r=0n−1(n+1...
AbstractWe say that a permutation σ∈Sn contains a permutation π∈Sk as a pattern if some subsequence ...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
AbstractA permutation π ϵ Sn avoids the subpattern τ iff π has no subsequence having all the same pa...
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractFor every integer j⩾1, we define a class of permutations in terms of certain forbidden subse...
AbstractLet σ∈Sk and τ∈Sn be permutations. We say τ contains σ if there exist 1⩽x1<x2<…<xk⩽n such th...
AbstractProving a first nontrivial instance of a conjecture of Noonan and Zeilberger we show that th...
AbstractBabson and Steingrı́msson introduced generalized permutation patterns that allow the ...
AbstractIn this paper we prove that any sequence of n real numbers contains a unimodal subsequence o...
AbstractWe improve the lower bound on the number of permutations of {1,2,…,n} in which no 3-term ari...
AbstractWe consider the problem of enumerating the permutations containing exactly k occurrences of ...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
AbstractThis paper examines the extremal problem of how many 1-entries an n×n 0–1 matrix can have th...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
AbstractChung et al. (1978) have proved that the number of Baxter permutations on [n] is ∑r=0n−1(n+1...
AbstractWe say that a permutation σ∈Sn contains a permutation π∈Sk as a pattern if some subsequence ...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
AbstractA permutation π ϵ Sn avoids the subpattern τ iff π has no subsequence having all the same pa...
AbstractThe problem of the number p(n , r), (1 ⩽r⩽n), of permutations on the set {1,…,n} with longes...
AbstractFor every integer j⩾1, we define a class of permutations in terms of certain forbidden subse...
AbstractLet σ∈Sk and τ∈Sn be permutations. We say τ contains σ if there exist 1⩽x1<x2<…<xk⩽n such th...
AbstractProving a first nontrivial instance of a conjecture of Noonan and Zeilberger we show that th...
AbstractBabson and Steingrı́msson introduced generalized permutation patterns that allow the ...
AbstractIn this paper we prove that any sequence of n real numbers contains a unimodal subsequence o...
AbstractWe improve the lower bound on the number of permutations of {1,2,…,n} in which no 3-term ari...
AbstractWe consider the problem of enumerating the permutations containing exactly k occurrences of ...
AbstractUsing the technique of generating trees, we prove that there are exactly 10 classes of patte...
AbstractThis paper examines the extremal problem of how many 1-entries an n×n 0–1 matrix can have th...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
AbstractChung et al. (1978) have proved that the number of Baxter permutations on [n] is ∑r=0n−1(n+1...
AbstractWe say that a permutation σ∈Sn contains a permutation π∈Sk as a pattern if some subsequence ...
DOI
Add to ORKG