AbstractAn up–down permutation P=(p1,p2,…,pn) is a permutation of the integers 1 to n which satisfies constraints specified by a sequence C=(c1,c2,…,cn−1) of U's and D's of length n−1. If ci is U then pi<pi+1 otherwise pi−1>pi. A loopless algorithm is developed for generating all the up–down permutations satisfying any sequence C. Ranking and unranking algorithms are discussed
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceThis article presents a methodology that automatically derives a combinatorial...
International audienceThis article presents a methodology that automatically derives a combinatorial...
AbstractAn up–down permutation P=(p1,p2,…,pn) is a permutation of the integers 1 to n which satisfie...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
International audienceA universal cycle for permutations of length $n$ is a cyclic word or permutati...
International audienceA universal cycle for permutations of length $n$ is a cyclic word or permutati...
AbstractPut Zn = {1, 2,…, n} and let π denote an arbitrary permutation of Zn. Problem I. Let π = (π(...
AbstractWe present a recursive generating algorithm for unrestricted permutations which is based on ...
We give a formula to compute the number of permutations with a prescribed descent set in quadratic t...
AbstractDedicated to the memory of Marcel–Paul Schützenberger Cet article présente une étude des per...
Abstract. This article presents a methodology that automatically derives a combinatorial specificati...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceThis article presents a methodology that automatically derives a combinatorial...
International audienceThis article presents a methodology that automatically derives a combinatorial...
AbstractAn up–down permutation P=(p1,p2,…,pn) is a permutation of the integers 1 to n which satisfie...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
AbstractA permutation with a signature Q=(q1,q2,…,qn−1) where qi is either 1 or −1, is a permutation...
International audienceA universal cycle for permutations of length $n$ is a cyclic word or permutati...
International audienceA universal cycle for permutations of length $n$ is a cyclic word or permutati...
AbstractPut Zn = {1, 2,…, n} and let π denote an arbitrary permutation of Zn. Problem I. Let π = (π(...
AbstractWe present a recursive generating algorithm for unrestricted permutations which is based on ...
We give a formula to compute the number of permutations with a prescribed descent set in quadratic t...
AbstractDedicated to the memory of Marcel–Paul Schützenberger Cet article présente une étude des per...
Abstract. This article presents a methodology that automatically derives a combinatorial specificati...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceGeneralizing stack sorting and c-sorting for permutations, we define the permu...
International audienceThis article presents a methodology that automatically derives a combinatorial...
International audienceThis article presents a methodology that automatically derives a combinatorial...
DOI
Add to ORKG