Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Langford_pairing> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Langford_pairing abstract "In combinatorial mathematics, a Langford pairing, also called a Langford sequence, is a permutation of the sequence of 2n numbers 1, 1, 2, 2, ..., n, n in which the two ones are one unit apart, the two twos are two units apart, and more generally the two copies of each number k are k units apart. Langford pairings are named after C. Dudley Langford, who posed the problem of constructing them in 1958.Langford's problem is the task of finding Langford pairings for a given value of n.The closely related concept of a Skolem sequence is defined in the same way, but instead permutes the sequence 0, 0, 1, 1, ..., n − 1, n − 1.".
- Langford_pairing thumbnail Langford_pairing.svg?width=300.
- Langford_pairing wikiPageExternalLink langford.html.
- Langford_pairing wikiPageExternalLink langford-biblio.html.
- Langford_pairing wikiPageID "17137020".
- Langford_pairing wikiPageLength "3514".
- Langford_pairing wikiPageOutDegree "12".
- Langford_pairing wikiPageRevisionID "631654242".
- Langford_pairing wikiPageWikiLink Category:Combinatorics.
- Langford_pairing wikiPageWikiLink Combinatorics.
- Langford_pairing wikiPageWikiLink Discrete_Mathematics_(journal).
- Langford_pairing wikiPageWikiLink Exact_cover.
- Langford_pairing wikiPageWikiLink Mathematics.
- Langford_pairing wikiPageWikiLink Modular_arithmetic.
- Langford_pairing wikiPageWikiLink Multiplication.
- Langford_pairing wikiPageWikiLink Permutation.
- Langford_pairing wikiPageWikiLink Steiner_system.
- Langford_pairing wikiPageWikiLink Stirling_permutation.
- Langford_pairing wikiPageWikiLink The_Art_of_Computer_Programming.
- Langford_pairing wikiPageWikiLink File:Langford_pairing.svg.
- Langford_pairing wikiPageWikiLinkText "Langford pairing".
- Langford_pairing title "Langford's Problem".
- Langford_pairing urlname "LangfordsProblem".
- Langford_pairing wikiPageUsesTemplate Template:Citation.
- Langford_pairing wikiPageUsesTemplate Template:Harvtxt.
- Langford_pairing wikiPageUsesTemplate Template:Mathworld.
- Langford_pairing wikiPageUsesTemplate Template:OEIS.
- Langford_pairing wikiPageUsesTemplate Template:Reflist.
- Langford_pairing subject Category:Combinatorics.
- Langford_pairing hypernym Permutation.
- Langford_pairing type Combinatoric.
- Langford_pairing type Field.
- Langford_pairing comment "In combinatorial mathematics, a Langford pairing, also called a Langford sequence, is a permutation of the sequence of 2n numbers 1, 1, 2, 2, ..., n, n in which the two ones are one unit apart, the two twos are two units apart, and more generally the two copies of each number k are k units apart. Langford pairings are named after C.".
- Langford_pairing label "Langford pairing".
- Langford_pairing sameAs Q3503249.
- Langford_pairing sameAs Suite_de_Skolem.
- Langford_pairing sameAs רצף_לנגפורד.
- Langford_pairing sameAs Emparelhamento_de_Langford.
- Langford_pairing sameAs m.043m9ht.
- Langford_pairing sameAs Q3503249.
- Langford_pairing wasDerivedFrom Langford_pairing?oldid=631654242.
- Langford_pairing depiction Langford_pairing.svg.
- Langford_pairing isPrimaryTopicOf Langford_pairing.