On Extremal Permutations Avoiding N =NN- 1 . . . 1

Author： Fourre J.-Y.   Krob D.   Novelli J.-C.  

Publisher： Elsevier

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.20, Iss.8, 1999-11, pp. : 773-787

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On primitive recursive permutations and their inverses1

By  

The Journal of Symbolic Logic, Vol. 34, Iss. 4, 1970-02 ,pp. : 634-638

Cambridge University Press

Access to resources Recommend Favorite

On the diagram of 132-avoiding permutations

By Reifegerste A.  

European Journal of Combinatorics, Vol. 24, Iss. 6, 2003-08 ,pp. : 759-776

Elsevier

Access to resources Recommend Favorite

Extremal Permutations with Respect to Weak Majorizations

By Hwang F.K.  

European Journal of Combinatorics, Vol. 17, Iss. 7, 1996-10 ,pp. : 637-645

Academic Press

Access to resources Recommend Favorite

Permutations of a Multiset Avoiding Permutations of Length 3

By Albert M.H.   Aldred R.E.L.   Atkinson M.D.   Handley C.   Holton D.  

European Journal of Combinatorics, Vol. 22, Iss. 8, 2001-11 ,pp. : 1021-1031

Elsevier

Access to resources Recommend Favorite

Extremal problems in H 1 for continuous kernels on a bidisc

By Nakazi Takahiko  

Complex Variables and Elliptic Equations, Vol. 58, Iss. 9, 2013-09 ,pp. : 1321-1329

Taylor & Francis Ltd

Access to resources Recommend Favorite