A new proof of a theorem of Mansour and Sun (Q942127): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 0711.2769 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592987 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3788018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Generalizations of Vandermonde's Convolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bijective proofs of Gould's and Rothe's identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of the “Problème des ménages” / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two selection problems revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of combinations without unit separation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of combinations without a fixed distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344108 / rank | |||
Normal rank |
Latest revision as of 16:12, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new proof of a theorem of Mansour and Sun |
scientific article |
Statements
A new proof of a theorem of Mansour and Sun (English)
0 references
4 September 2008
0 references
The theorem mentioned in the title says [\textit{T. Mansour} and \textit{Y. Sun}, Eur. J. Comb. 29, No. 5, 1200-1206 (2008; Zbl 1178.05007)]: Let \(m,p,k\geq 1\) and \(n\geq mpk+1\). Then the number of \(k\)-subsets \(\{x_1,\dots,x_k\}\) of \({\mathbb Z}_n\) such that \(| x_i-x_j| \notin \{m,2m,\dots,pm\}\) for all \(1\leq i<j\leq k\) is given by \({n-pk\choose k} n/(n-pk)\). The original proof was based on computation of the residues of a Laurent series, the proof in the paper under review is combinatorial and uses elementary number theory and repeated use of the so-called Rothe's identity.
0 references
Rothe's identity
0 references
points arranged on a cycle
0 references
\(k\)-subset
0 references
combinatorial number
0 references