Identities in combinatorics, I

on sorting two ordered sets

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

A binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric series is proved combinatorially. The proof depends on the enumeration of ordered pairs (A,B) of subsets of{1,2,3,...,ν} in which |A|=n, |B|=m, and B contains exactly r elements of the first n elements of A∪B.

Original languageEnglish (US)
Pages (from-to)97-106
Number of pages10
JournalDiscrete Mathematics
Volume11
Issue number2
DOIs
StatePublished - Jan 1 1975

Fingerprint

Binomial coefficient identities
Hypergeometric Series
Ordered pair
Ordered Set
Combinatorics
Sorting
Summation
Enumeration
Subset

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

@article{ab7abc645c8640b78d3983e3f2bd20e3,
title = "Identities in combinatorics, I: on sorting two ordered sets",
abstract = "A binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric series is proved combinatorially. The proof depends on the enumeration of ordered pairs (A,B) of subsets of{1,2,3,...,ν} in which |A|=n, |B|=m, and B contains exactly r elements of the first n elements of A∪B.",
author = "Andrews, {George E.}",
year = "1975",
month = "1",
day = "1",
doi = "10.1016/0012-365X(75)90001-1",
language = "English (US)",
volume = "11",
pages = "97--106",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2",

}

Identities in combinatorics, I : on sorting two ordered sets. / Andrews, George E.

In: Discrete Mathematics, Vol. 11, No. 2, 01.01.1975, p. 97-106.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Identities in combinatorics, I

T2 - on sorting two ordered sets

AU - Andrews, George E.

PY - 1975/1/1

Y1 - 1975/1/1

N2 - A binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric series is proved combinatorially. The proof depends on the enumeration of ordered pairs (A,B) of subsets of{1,2,3,...,ν} in which |A|=n, |B|=m, and B contains exactly r elements of the first n elements of A∪B.

AB - A binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric series is proved combinatorially. The proof depends on the enumeration of ordered pairs (A,B) of subsets of{1,2,3,...,ν} in which |A|=n, |B|=m, and B contains exactly r elements of the first n elements of A∪B.

UR - http://www.scopus.com/inward/record.url?scp=0242704798&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242704798&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(75)90001-1

DO - 10.1016/0012-365X(75)90001-1

M3 - Article

VL - 11

SP - 97

EP - 106

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

ER -