Pages that link to "Item:Q2483349"
From MaRDI portal
The following pages link to Kernel method and linear recurrence system (Q2483349):
Displaying 31 items.
- The kernel method and systems of functional equations with several conditions (Q609206) (← links)
- Diffusion on an Ising chain with kinks (Q663013) (← links)
- Minimal permutations with \(d\) descents (Q976167) (← links)
- New permutation statistics: Variation and a variant (Q1026169) (← links)
- The kernel method: a collection of examples (Q1778033) (← links)
- Poincaré polynomial at \(-1\) associated with a Young diagram of three rows (Q2084691) (← links)
- Betti numbers of the Springer fibers over nilpotent elements in \(gl_n(\mathbb{C})\) of Jordan form \((2^b,1^{a-b})\) (Q2137068) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- Smooth column convex polyominoes (Q2167315) (← links)
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model (Q2269489) (← links)
- Counting subwords in flattened partitions of sets (Q2352065) (← links)
- Unimodality of the distribution of Betti numbers for some Springer fibers (Q2438025) (← links)
- Kernel method and system of functional equations (Q2519703) (← links)
- The research and progress of the enumeration of lattice paths (Q2689733) (← links)
- Counting subwords in flattened involutions and Kummer functions (Q2964219) (← links)
- Counting pattern avoiding permutations by number of movable letters (Q3390785) (← links)
- New refined enumerations of set partitions related to sorting (Q4559339) (← links)
- Visibility in pattern-restricted permutations (Q4991426) (← links)
- Visibility in non-crossing and non-nesting partitions (Q4991851) (← links)
- Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations (Q5085251) (← links)
- Statistics on bargraphs of inversion sequences of permutations (Q5121950) (← links)
- (Q5863484) (← links)
- Further enumeration results concerning a recent equivalence of restricted inversion sequences (Q5864727) (← links)
- Counting subword patterns in permutations arising as flattened partitions of sets (Q5866251) (← links)
- Counting occurrences of subword patterns in non-crossing partitions (Q5888416) (← links)
- Enumeration of smooth inversion sequences and proof of a recent related conjecture (Q6044152) (← links)
- Five classes of pattern avoiding inversion sequences under one roof: generating trees (Q6081493) (← links)
- Inversion sequences avoiding a triple of patterns of 3 letters (Q6133161) (← links)
- Inversion sequences avoiding 021 and another pattern of length four (Q6599801) (← links)
- Words over a finite alphabet avoiding 1243 (Q6618737) (← links)
- Pattern avoidance in parking functions (Q6659956) (← links)
