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

Publisher： Taylor & Francis Ltd

E-ISSN： 1563-5120|21|1|16-36

ISSN： 1023-6198

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

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 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

COUNTING PERMUTATIONS BY NUMBERS OF EXCEDANCES, FIXED POINTS AND CYCLES

By  

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

Cambridge University Press

Access to resources Recommend Favorite

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

By Bousquet-Mélou Mireille  

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

Springer Publishing Company

Access to resources Recommend Favorite

95.45 What do permutations of a given cycle pattern generate?

By  

The Mathematical Gazette, Vol. 95, Iss. 533, 2011-07 ,pp. : 341-342

Cambridge University Press

Access to resources Recommend Favorite

Recurrence relations for discrete hypergeometric functions

By álvarez-Nodarse R.  

Journal of Difference Equations and Applications, Vol. 11, Iss. 9, 2005-08 ,pp. : 829-850

Taylor & Francis Ltd

Access to resources Recommend Favorite