Add to ORKGThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1990.Includes bibliographical references (p. 113-114).by Julian West.Ph.D
AbstractWe discuss an enumerative technique called generating trees which was introduced in the stud...
This paper is concerned with counting permutations which do not contain certain subsequences. The nu...
There has been considerable interest recently in the subject of patterns in permutations and words, ...
AbstractWe give what we believe to be the first combinatorial proof of J. West's conjecture that is ...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/73364/1/j.1096-0031.1994.tb00165.x.pd
A permutation is an (r, s)-permutation if it can be partitioned into r increasing and s decreasing, ...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
AMS Subject Classication: 05A15 Abstract. The enumeration of permutations with specic forbidden subs...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractThe Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hou...
AbstractThe goal of the present work is to connect combinatorially a family of maps to a family of p...
18 pages, 5 figuresGeneralizing stack sorting and $c$-sorting for permutations, we define the permut...
AbstractWe discuss an enumerative technique called generating trees which was introduced in the stud...
This paper is concerned with counting permutations which do not contain certain subsequences. The nu...
There has been considerable interest recently in the subject of patterns in permutations and words, ...
AbstractWe give what we believe to be the first combinatorial proof of J. West's conjecture that is ...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/73364/1/j.1096-0031.1994.tb00165.x.pd
A permutation is an (r, s)-permutation if it can be partitioned into r increasing and s decreasing, ...
Abstract. The enumeration of permutations with specific forbidden subsequences has applications in a...
Stacks which allow elements to be pushed into any of the top r positions and popped from any of the ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.Includes bibliogr...
AMS Subject Classication: 05A15 Abstract. The enumeration of permutations with specic forbidden subs...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractThe Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hou...
AbstractThe goal of the present work is to connect combinatorially a family of maps to a family of p...
18 pages, 5 figuresGeneralizing stack sorting and $c$-sorting for permutations, we define the permut...
AbstractWe discuss an enumerative technique called generating trees which was introduced in the stud...
This paper is concerned with counting permutations which do not contain certain subsequences. The nu...
There has been considerable interest recently in the subject of patterns in permutations and words, ...