Kernel method and linear recurrence system
From MaRDI portal
Publication:2483349
DOI10.1016/j.cam.2007.05.001zbMath1138.65108OpenAlexW2075656311MaRDI QIDQ2483349
Publication date: 28 April 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.05.001
numerical exampleskernel methodrestricted permutationsforbidden subsequenceslinear recurrence systemsystems on generating functions
Related Items
Counting occurrences of subword patterns in non-crossing partitions, Betti numbers of the Springer fibers over nilpotent elements in \(gl_n(\mathbb{C})\) of Jordan form \((2^b,1^{a-b})\), Subregularity in infinitely labeled generating trees of restricted permutations, New refined enumerations of set partitions related to sorting, Smooth column convex polyominoes, Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations, The kernel method and systems of functional equations with several conditions, Enumeration of smooth inversion sequences and proof of a recent related conjecture, Unnamed Item, Counting covered fixed points and covered arcs in an involution, Restricted inversion sequences and Schröder paths, Five classes of pattern avoiding inversion sequences under one roof: generating trees, Inversion sequences avoiding a triple of patterns of 3 letters, The research and progress of the enumeration of lattice paths, Counting subwords in flattened involutions and Kummer functions, Unimodality of the distribution of Betti numbers for some Springer fibers, Diffusion on an Ising chain with kinks, Minimal permutations with \(d\) descents, Exact tail asymptotics in a priority queue -- characterizations of the preemptive model, Statistics on bargraphs of inversion sequences of permutations, Kernel method and system of functional equations, Counting pattern avoiding permutations by number of movable letters, New permutation statistics: Variation and a variant, Visibility in pattern-restricted permutations, Visibility in non-crossing and non-nesting partitions, Poincaré polynomial at \(-1\) associated with a Young diagram of three rows, Further enumeration results concerning a recent equivalence of restricted inversion sequences, Counting subword patterns in permutations arising as flattened partitions of sets, Counting subwords in flattened partitions of sets
Cites Work
- Walks in the quarter plane: Kreweras' algebraic model
- On partitions avoiding 3-crossings
- Generating functions for generating trees
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Linear recurrences with constant coefficients: The multivariate case
- The kernel method: a collection of examples
- Restricted permutations and Chebyshev polynomials
- Generating trees and forbidden subsequences
- Three-letter-pattern avoiding permutations and functional equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
