Kernel method and linear recurrence system

Authors:
Qing-Hu Hou;Toufik Mansour
Affiliations:
Center for Combinatorics, LPMC, Nankai University, 300071Tianjin, PR China;Center for Combinatorics, LPMC, Nankai University, 300071Tianjin, PR China and Department of Mathematics, University of Haifa, 31905 Haifa, Israel
Venue:
Journal of Computational and Applied Mathematics
Year:
2008

Citing 3
Cited 5

Enumerative combinatorics

Enumerative combinatorics
Generating trees and forbidden subsequences

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Generating functions for generating trees

Discrete Mathematics

Kernel method and system of functional equations

Journal of Computational and Applied Mathematics
Note: New permutation statistics: Variation and a variant

Discrete Applied Mathematics
Exact tail asymptotics in a priority queue--characterizations of the preemptive model

Queueing Systems: Theory and Applications
Minimal permutations with d descents

European Journal of Combinatorics
The kernel method and systems of functional equations with several conditions

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	7.29

Visualization

Abstract

Based on the kernel method, we present systematic methods to solve equation systems on generating functions of two variables. Using these methods, we get the generating functions for the number of permutations which avoid 1234 and 12k(k-1)...3 and permutations which avoid 1243 and 12...k.