DOIAbstract
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, number of inversions, and the relationship between σi and σj for all i and j
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, number of inversions, and the relationship between σi and σj for all i and j
Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.MICROFICHE COPY AVA...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
Additive combinatorics is built around the famous theorem by Sze-merédi which asserts existence of ...
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, num...
AbstractA method is described by which the enumeration of permutations of 1, 2, … n with a prescribe...
AbstractThis paper gives a combinatorial derivation of the counting series ψm (alternatively ψm∗) fo...
AbstractLet a be a fixed nonnegative integer and let Nj(n, k) denote the number of sequences (a1, a2...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable metho...
Basic enumeration: recurrence relations, inclusion-exclusion principle, permutation statistics, Stir...
Enumerative combinatorics is about counting. The typical question is to find the number of objects w...
AbstractWe give a method for enumerating sequences over a finite alphabet with respect to certain ma...
Let asc and desc denote respectively the statistics recording the number of ascents or descents in a...
Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.MICROFICHE COPY AVA...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
Additive combinatorics is built around the famous theorem by Sze-merédi which asserts existence of ...
AbstractA general method is provided for enumerating sequences σ1σ2 … σn with respect to length, num...
AbstractA method is described by which the enumeration of permutations of 1, 2, … n with a prescribe...
AbstractThis paper gives a combinatorial derivation of the counting series ψm (alternatively ψm∗) fo...
AbstractLet a be a fixed nonnegative integer and let Nj(n, k) denote the number of sequences (a1, a2...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
Permutations that avoid given patterns have been studied in great depth for their connections to oth...
Inversion sequences of length n, In, are integer sequences (e , . . ., e ) with 0 ≤ e \u3c i for ea...
Abstract. Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable metho...
Basic enumeration: recurrence relations, inclusion-exclusion principle, permutation statistics, Stir...
Enumerative combinatorics is about counting. The typical question is to find the number of objects w...
AbstractWe give a method for enumerating sequences over a finite alphabet with respect to certain ma...
Let asc and desc denote respectively the statistics recording the number of ascents or descents in a...
Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.MICROFICHE COPY AVA...
10 pagesInversion sequences are integer sequences (σ_1, . . . , σ_n) such that 0 ⩽ σ_i < i for all 1...
Additive combinatorics is built around the famous theorem by Sze-merédi which asserts existence of ...
Add to ORKG