Counting permutations with no long monotone subsequence via generating trees and the kernel method

ISSN： 0925-9899

Source： Journal of Algebraic Combinatorics, Vol.33, Iss.4, 2011-06, pp. : 571-608

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

Cocommutative Hopf Algebras of Permutations and Trees

By Aguiar Marcelo Sottile Frank

Journal of Algebraic Combinatorics, Vol. 22, Iss. 4, 2005-12 ,pp. : 451-470

Springer Publishing Company

Access to resources Recommend Favorite

Recurrence relations in counting the pattern 13-2 in flattened permutations

Journal of Difference Equations and Applications, Vol. 21, Iss. 1, 2015-01 ,pp. : 16-36

Taylor & Francis Ltd

Access to resources Recommend Favorite

COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES

Bulletin of the Australian Mathematical Society, Vol. 85, Iss. 3, 2011-10 ,pp. : 415-421

Cambridge University Press

Access to resources Recommend Favorite

Hopf Algebras of Heap Ordered Trees and Permutations

By Grossman Robert Larson Richard

Communications in Algebra, Vol. 37, Iss. 2, 2009-02 ,pp. : 453-459

Taylor & Francis Ltd

Access to resources Recommend Favorite

Automorphism Groups of Trees Acting Locally with Affine Permutations

By Benakli N. Glasner Y.

Geometriae Dedicata, Vol. 89, Iss. 1, 2002-02 ,pp. : 1-24

Springer Publishing Company

Access to resources Recommend Favorite