Combinatorial identities by way of Wilf's multigraph model (Q2644160): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60692616 / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the sequential and random selection of subspaces over a finite field / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4853724 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial family of labeled trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3932310 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3748279 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:51, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial identities by way of Wilf's multigraph model |
scientific article |
Statements
Combinatorial identities by way of Wilf's multigraph model (English)
0 references
7 September 2007
0 references
Summary: For many families of combinatorial objects, a construction of \textit{H. S. Wilf} [Adv. Math. 24, 281--291 (1977; Zbl 0354.05041)] allows the members of the family to be viewed as paths in a directed multigraph. Introducing a partition of these paths generates a number of known, but hitherto disparate, combinatorial identities. We include several examples.
0 references
paths
0 references
