AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two classes of permutations. A natural map from one class to the other is described in terms of a shared recursive structure
AbstractA simple permutation is one that never maps a nontrivial contiguous set of indices contiguou...
AbstractWe prove that every entry in a simple permutation of length at least 4 is contained in a cop...
AbstractTwo transformations are constructed that map the permutation group onto a well-defined subse...
AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two cl...
AbstractIn this paper we propose two bijections between permutation tableaux and permutations. These...
AbstractLet γn be the permutation on n symbols defined by γn=(12…n). We are interested in an enumera...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
AbstractAn encoding of the set of two-stack-sortable permutations (TSS) in terms of lattice paths an...
AbstractThe subject of pattern avoiding permutations has its roots in computer science, namely in th...
AbstractWe give two bijective proofs of a result of Corteel and Nadeau. We find a generating functio...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
Two proofs of a frequently rediscovered combinatorial lemma are presented. Using the lemma, a combin...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractA simple permutation is one that never maps a nontrivial contiguous set of indices contiguou...
AbstractWe prove that every entry in a simple permutation of length at least 4 is contained in a cop...
AbstractTwo transformations are constructed that map the permutation group onto a well-defined subse...
AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two cl...
AbstractIn this paper we propose two bijections between permutation tableaux and permutations. These...
AbstractLet γn be the permutation on n symbols defined by γn=(12…n). We are interested in an enumera...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
AbstractAn encoding of the set of two-stack-sortable permutations (TSS) in terms of lattice paths an...
AbstractThe subject of pattern avoiding permutations has its roots in computer science, namely in th...
AbstractWe give two bijective proofs of a result of Corteel and Nadeau. We find a generating functio...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
AbstractWe give a combinatorial proof of Harer and Zagier's formula for the disjoint cycle distribut...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
Two proofs of a frequently rediscovered combinatorial lemma are presented. Using the lemma, a combin...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractA simple permutation is one that never maps a nontrivial contiguous set of indices contiguou...
AbstractWe prove that every entry in a simple permutation of length at least 4 is contained in a cop...
AbstractTwo transformations are constructed that map the permutation group onto a well-defined subse...
DOI
Add to ORKG