G. W. Peck


G. W. Peck is a pseudonymous attribution used as the author or co-author of a number of published mathematics academic papers. Peck is sometimes humorously identified with George Wilbur Peck, a former governor of the US state of Wisconsin.[1]

Peck first appeared as the official author of a 1979 paper entitled "Maximum antichains of rectangular arrays".[2] The name "G. W. Peck" is derived from the initials of the actual writers of this paper: Ronald Graham, Douglas West, George B. Purdy, Paul Erdős, Fan Chung, and Daniel Kleitman. The paper initially listed Peck's affiliation as Xanadu, but the editor of the journal objected, so Ron Graham gave him a job at Bell Labs. Since then, Peck's name has appeared on some sixteen publications,[3] primarily as a pseudonym of Daniel Kleitman.[1]

In reference to "G. W. Peck", Richard P. Stanley defined a Peck poset to be a graded partially ordered set that is rank symmetric, rank unimodal, and strongly Sperner.[4] The posets in the original paper by G. W. Peck are not quite Peck posets, as they lack the property of being rank symmetric.

See alsoEdit


  1. ^ a b Peck, G. W. (2002), "Kleitman and combinatorics: a celebration", Discrete Mathematics, 257 (2–3): 193–224, doi:10.1016/S0012-365X(02)00595-2, MR 1935723.
  2. ^ Peck, G. W. (1979), "Maximum antichains of rectangular arrays", Journal of Combinatorial Theory, Series A, 27 (3): 397–400, doi:10.1016/0097-3165(79)90035-9, MR 0555816.
  3. ^ Listing of Peck's publications in MathSciNet (subscription required), retrieved 2010-03-11.
  4. ^ Stanley, Richard (1984), "Quotients of Peck posets", Order, 1 (1): 29–34, doi:10.1007/BF00396271, MR 0745587, S2CID 14857863.

External linksEdit

  • Imaginary Erdős numbers, Numberphile, Nov 26, 2014. Video interview with Ron Graham in which he tells the story of G. W. Peck.