Jump to content

Wikipedia:WikiProject Mathematics/PlanetMath Exchange/05-XX Combinatorics

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Rich Farmbrough (talk | contribs) at 21:44, 26 August 2005 (05A10 Factorials, binomial coefficients, combinatorial functions). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This page provides a list of all articles available at PlanetMath in the following topic:

05-XX Combinatorics.

This list will be periodically updated. Each entry in the list has three fields:

  1. PM : The first field is the link to the PlanetMath article, along with the article's object ID.
  2. WP : The second field is either a "guessed" link to a correspondingly named Wikipedia article, produced by the script which generated the list, or one or more manually entered links to the corresponding Wikipedia articles on the subject.
  3. Status : The third field is the status field, which explains the current status of the entry. The recommended status entries are:
Status means PM article
N not needed
A adequately covered
C copied
M merged
NC needs copying
NM needs merging
  • Please update the WP and Status fields as appropriate.
  • if the WP field is correct please remove the qualifier "guess".
  • If the corresponding Wikipedia article exists, but the link to it is wrong, please fix the link.
  • If you copy or merge an article from PlanetMath, please update the WP and Status fields for that entry.
  • If you have any comments, for example, thoughts on how the PlanetMath article compares to the corresponding Wikipedia article(s), please place such comments on a new indented line following the entry. Comments of this kind are very valuable.

Don't forget to include the relevant template if you copy over text or feel like an external link is warranted

  • {{planetmath|id=|title=}} for copied over text
  • {{planetmath reference|id=|title=}} for an external link

See the main page for examples and usage criteria.

One can use the web-based program Pmform to convert PlanetMath articles to the Wikipedia format. As a side benefit, this tool will place the PlanetMath template for you.

05-00 General reference works (handbooks, dictionaries, bibliographies, etc.) (complete)

Paul August 21:51, August 22, 2005 (UTC)
Rich Farmbrough 16:54, 26 August 2005 (UTC)[reply]
linas 15:48, 7 August 2005 (UTC)[reply]

05A05 Combinatorial choice problems (subsets, representatives, permutations)

  • PM: cycle, id=2262 -- Duplicate entry.
See 03-00 General reference works (handbooks, dictionaries, bibliographies, etc.)
Rich Farmbrough 19:14, 26 August 2005 (UTC)[reply]
See 03-00 General reference works (handbooks, dictionaries, bibliographies, etc.)
See 03-00 General reference works (handbooks, dictionaries, bibliographies, etc.)
See 03-00 General reference works (handbooks, dictionaries, bibliographies, etc.)

05A10 Factorials, binomial coefficients, combinatorial functions

Mikkalai 04:49, 4 Feb 2005 (UTC)
Catalan numbers redirects to Catalan number Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
Copied by User:Drini on 28 June 2005 linas 04:04, 22 August 2005 (UTC)[reply]
double factorial redirects to Factorial, while PM aricle is empty. Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
falling factorial redirects to Pochhammer symbol Mikkalai 04:49, 4 Feb 2005 (UTC)
Rich Farmbrough 21:44, 26 August 2005 (UTC)[reply]
generalized binomial coefficient redirect to binomial coefficient. Mikkalai 04:49, 4 Feb 2005 (UTC)
Ruiz identities seem to be vanity names, and PM author has consistently failed to provide references to literature where such term is used other than Ruiz own papers. Pedro Sanchez 21:50, 17 May 2005 (UTC)[reply]
I dunno, looks generally useful, seems to show up on Mathworld Binomial sums, although the name may be a neologism. linas 15:56, 7 August 2005 (UTC)[reply]
PM has some examples that should eb copied over. linas 04:09, 22 August 2005 (UTC)[reply]
Proof must be merged into WP, see below. Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
Mikkalai 04:49, 4 Feb 2005 (UTC)
Since the parent entry is not needed. Pedro Sanchez 21:50, 17 May 2005 (UTC)[reply]
Merged into binomial coefficient Pedro Sanchez 22:22, 17 May 2005 (UTC)[reply]
Besides being a minor identity, Ruiz identities seem to be vanity names, and PM author has consistently failed to provide references to literature where such term is used other than Ruiz own papers. Moreover, this entry is no longer named Ruiz identity in PM. Pedro Sanchez 21:50, 17 May 2005 (UTC)[reply]
binomial coefficient contains the info. Redirect from long title is unnecessary. Mikkalai 04:49, 4 Feb 2005 (UTC)
The PM article is a proof of an identity; WP currently doesn't have (many) proofs; it would need to be copied. linas 16:43, 7 August 2005 (UTC)[reply]
Merged into binomial coefficient Pedro Sanchez 22:22, 17 May 2005 (UTC)[reply]

05A15 Exact enumeration problems, generating functions

PM article much more complete drini 04:05, 18 May 2005 (UTC)[reply]
PM article much more complete drini 04:05, 18 May 2005 (UTC)[reply]

05A17 Partitions of integers (complete)

linas 16:18, 7 August 2005 (UTC)[reply]
See 03E02 Partition relations

05A18 Partitions of sets (complete)

PM article does contain a short proof that WP does not. linas 15:59, 7 August 2005 (UTC)[reply]

05A19 Combinatorial identities (complete)

It was merged by User:Drini on 28 June 2005. linas 16:03, 7 August 2005 (UTC)[reply]
linas 16:06, 7 August 2005 (UTC)[reply]

05A99 Miscellaneous (complete)

Rich Farmbrough 19:27, 26 August 2005 (UTC)[reply]
Not needed, as we mostly don't do proofs on WP. linas 04:14, 22 August 2005 (UTC)[reply]

05B15 Orthogonal arrays, Latin squares, Room squares (complete)

linas 16:31, 7 August 2005 (UTC)[reply]
linas 16:31, 7 August 2005 (UTC)[reply]
linas 16:24, 7 August 2005 (UTC)[reply]
linas 16:31, 7 August 2005 (UTC)[reply]

05B25 Finite geometries

Created redirect to already existing entry. -- < drini | ∂drini > 16:24, 23 August 2005 (UTC)[reply]

05B35 Matroids, geometric lattices

linas 16:50, 7 August 2005 (UTC)[reply]
Rich Farmbrough 21:20, 22 August 2005 (UTC)[reply]
linas 16:50, 7 August 2005 (UTC)[reply]

05B99 Miscellaneous (complete)

Mikkalai 04:52, 4 Feb 2005 (UTC)
Mikkalai 04:52, 4 Feb 2005 (UTC)

05C05 Trees

See 03E05 Other combinatorial set theory
See 03E05 Other combinatorial set theory
linas 04:23, 22 August 2005 (UTC)[reply]
linas 04:25, 22 August 2005 (UTC)[reply]
linas 04:27, 22 August 2005 (UTC)[reply]
  • PM: branch, id=3211 -- Duplicate entry.
See 03E05 Other combinatorial set theory
linas 04:29, 22 August 2005 (UTC)[reply]
See 03E05 Other combinatorial set theory
See 03E05 Other combinatorial set theory
linas 04:32, 22 August 2005 (UTC)[reply]
See 03E05 Other combinatorial set theory
linas 04:34, 22 August 2005 (UTC)[reply]
See 03E05 Other combinatorial set theory
linas 04:38, 22 August 2005 (UTC)[reply]
  • PM: trie, id=2684 -- WP: trie -- Status: WP article more complete.
linas 04:40, 22 August 2005 (UTC)[reply]

05C10 Topological graph theory, imbedding

Redirects to crossing number Terry 04:34, 15 Feb 2005 (UTC)
-- < drini | ∂drini > 16:33, 23 August 2005 (UTC)[reply]
Rich Farmbrough 19:43, 26 August 2005 (UTC)[reply]
Rich Farmbrough 12:05, 23 August 2005 (UTC)[reply]
linas 04:18, 22 August 2005 (UTC)[reply]
Rich Farmbrough 19:50, 26 August 2005 (UTC)[reply]
Rich Farmbrough 19:36, 26 August 2005 (UTC)[reply]

05C12 Distance in graphs (complete)

linas 16:54, 7 August 2005 (UTC)[reply]

05C15 Coloring of graphs and hypergraphs

See 05B35 Matroids, geometric lattices
See 05C10 Topological graph theory, imbedding
See 05C10 Topological graph theory, imbedding

05C20 Directed graphs (digraphs), tournaments

User:Mikkalai
Rich Farmbrough 19:53, 26 August 2005 (UTC)[reply]
-it's a redirect to graph Rich Farmbrough 19:59, 26 August 2005 (UTC)[reply]
Rich Farmbrough 19:57, 26 August 2005 (UTC)[reply]
Rich Farmbrough 20:00, 26 August 2005 (UTC)[reply]

05C25 Graphs and groups

The PM article contains symbolism that WP doesn't. linas 16:59, 7 August 2005 (UTC)[reply]

05C30 Enumeration of graphs and maps (complete)

See 03C15 Denumerable structures

05C38 Paths and cycles

drini 28 June 2005 16:44 (UTC)
See 05C15 Coloring of graphs and hypergraphs
  • PM: path, id=1731 -- WP guess: path -- Status:
See 05C15 Coloring of graphs and hypergraphs

05C40 Connectivity

05C45 Eulerian and Hamiltonian graphs

05C60 Isomorphism problems (reconstruction conjecture, etc.) (complete)

Rich Farmbrough 20:25, 26 August 2005 (UTC)[reply]

05C62 Graph representations (geometric and intersection representations, etc.) (complete)

See 05C10 Topological graph theory, imbedding

05C65 Hypergraphs

See 05B25 Finite geometries
Rich Farmbrough 20:50, 26 August 2005 (UTC)[reply]
See 05C45 Eulerian and Hamiltonian graphs

05C69 Dominating sets, independent sets, cliques

See 05C15 Coloring of graphs and hypergraphs

05C70 Factorization, matching, covering and packing

05C75 Structural characterization of types of graphs (complete)

See 05C69 Dominating sets, independent sets, cliques
Rich Farmbrough 21:03, 26 August 2005 (UTC)[reply]
See 05C69 Dominating sets, independent sets, cliques
Rich Farmbrough 20:56, 26 August 2005 (UTC)[reply]

05C80 Random graphs (complete)

See 05C15 Coloring of graphs and hypergraphs
Rich Farmbrough 20:59, 26 August 2005 (UTC)[reply]
Rich Farmbrough 20:59, 26 August 2005 (UTC)[reply]
See 05C15 Coloring of graphs and hypergraphs
See 05C10 Topological graph theory, imbedding

05C85 Graph algorithms (complete)

See 05C38 Paths and cycles

05C90 Applications (complete)

Rich Farmbrough 21:30, 22 August 2005 (UTC)[reply]

05C99 Miscellaneous

  • PM: loop, id=1615 -- WP guess: loop -- Status:

05D05 Extremal set theory

05D10 Ramsey theory

See 03E05 Other combinatorial set theory
Rich Farmbrough 21:31, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:31, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:31, 26 August 2005 (UTC)[reply]
Seems that the PM article was copied from the WP article anyway (or vice versa). Terry 04:31, 15 Feb 2005 (UTC)

05D15 Transversal (matching) theory

Rich Farmbrough 21:27, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:27, 26 August 2005 (UTC)[reply]
Rich Farmbrough 21:18, 26 August 2005 (UTC)[reply]

05D40 Probabilistic methods (complete)

See 05D10 Ramsey theory
See 03F20 Complexity of proofs

05E05 Symmetric functions

linas 04:53, 22 August 2005 (UTC)[reply]

05E35 Orthogonal polynomials (complete)

Rich Farmbrough 21:07, 26 August 2005 (UTC)[reply]

05E99 Miscellaneous (complete)

Rich Farmbrough 21:04, 26 August 2005 (UTC)[reply]