• The Pólya enumeration theorem, also known as the Redfield–Pólya theorem and Pólya counting, is a theorem in combinatorics that both follows from and ultimately...
    15 KB (2,882 words) - 03:15, 26 April 2023
  • Thumbnail for George Pólya
    Laguerre–Pólya class Landau–Kolmogorov inequality Multivariate Pólya distribution Pólya's characterization theorem Pólya class Pólya conjecture Polya distribution...
    18 KB (1,782 words) - 19:36, 23 September 2024
  • Mathematics Pólya Award, awarded by the Mathematical Association of America (MAA) Pólya enumeration theorem Pólya conjecture Hilbert–Pólya conjecture Pólya–Szegő...
    1 KB (159 words) - 17:26, 20 July 2020
  • scientific discoveries is referred to as Stigler's law of eponymy. Pólya enumeration theorem Cycle index Burnside 1897, §119 Rotman 1995, Chapter 3 Cull, Paul;...
    10 KB (1,452 words) - 19:32, 20 August 2024
  • Thumbnail for Graph enumeration
    problems tend to be easier. As with combinatorial enumeration more generally, the Pólya enumeration theorem is an important tool for reducing unlabeled problems...
    5 KB (554 words) - 01:15, 6 August 2024
  • principle Method of distinguished element Pólya enumeration theorem Sieve theory Zeilberger, Doron, Enumerative and Algebraic Combinatorics Björner, Anders...
    9 KB (1,350 words) - 19:18, 20 August 2022
  • recurrence theorem (dynamical systems) Poisson limit theorem (probability) Pólya enumeration theorem (combinatorics) Pomeranchuk's theorem (physics) Pompeiu's...
    73 KB (6,015 words) - 12:17, 2 August 2024
  • Cycle index (category Enumerative combinatorics)
    group, one can enumerate equivalence classes due to the group's action. This is the main ingredient in the Pólya enumeration theorem. Performing formal...
    27 KB (5,007 words) - 14:06, 30 November 2023
  • Thumbnail for The Art of Computer Programming
    2.3. Generating inequivalent patterns (includes discussion of Pólya enumeration theorem) (see "Techniques for Isomorph Rejection", chapter 4 of "Classification...
    34 KB (3,792 words) - 04:29, 27 September 2024
  • Thumbnail for Up to
    can be counted using Burnside's lemma or its generalization, Pólya enumeration theorem. Consider the seven Tetris pieces (I, J, L, O, S, T, Z), known...
    7 KB (846 words) - 00:21, 16 September 2024
  • Thumbnail for Dirichlet distribution
    … , n q {\displaystyle n_{1},\dotsc ,n_{q}} in the sense of Pólya enumeration theorem. Particular cases include the simple computation E ⁡ [ ∏ i = 1...
    41 KB (6,539 words) - 11:38, 8 August 2024
  • Thumbnail for Telephone number (mathematics)
    Telephone number (mathematics) (category Enumerative combinatorics)
    is symmetric under a diagonal reflection of the board. Via the Pólya enumeration theorem, these numbers form one of the key components of a formula for...
    17 KB (2,039 words) - 15:09, 3 March 2024
  • book From Polychords to Pólya: Adventures in Musical Combinatorics is about the application of the Pólya enumeration theorem to the counting and classification...
    4 KB (370 words) - 04:40, 20 January 2024
  • combinatorial mathematics, the labelled enumeration theorem is the counterpart of the Pólya enumeration theorem for the labelled case, where we have a...
    5 KB (1,019 words) - 00:18, 14 January 2024
  • of electron transfer under action of light Pólya enumeration theorem, a mathematical theorem in enumerative combinatorics Potential evapotranspiration...
    3 KB (444 words) - 22:39, 20 June 2024
  • Thumbnail for Necklace (combinatorics)
    Necklace (combinatorics) (category Enumerative combinatorics)
    count these orbits, and thus necklaces and bracelets, using Pólya's enumeration theorem. There are N k ( n ) = 1 n ∑ d ∣ n φ ( d ) k n / d = 1 n ∑ i...
    8 KB (1,111 words) - 10:20, 30 March 2024
  • motivate the creation of classes of combinatorial structures. The Pólya enumeration theorem solves this problem in the unlabelled case. Let f(z) be the ordinary...
    28 KB (5,182 words) - 08:47, 7 November 2023
  • what is now called Pólya enumeration theorem (PET) in 1927, ten years ahead of similar but independent discovery made by George Pólya. Redfield was a great-grandson...
    8 KB (1,091 words) - 20:43, 19 October 2022
  • are connected with the use of the Pólya enumeration theorem in combinatorial groups and combinatorial enumerations. There is a formula for calculating...
    23 KB (2,887 words) - 22:08, 2 October 2024
  • Thumbnail for List of misnamed theorems
    himself written, its original proof was by Jörg Siebeck in 1864. Pólya enumeration theorem. This was proven in 1927 in a difficult paper by J. H. Redfield...
    18 KB (1,976 words) - 03:40, 23 February 2024
  • Thumbnail for Mathematical proof
    The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic...
    38 KB (4,778 words) - 08:10, 24 September 2024
  • treated bear witness to the special interests of Pólya (Descartes' rule of signs, Pólya's enumeration theorem), Szegö (polynomials, trigonometric polynomials...
    10 KB (1,340 words) - 14:23, 19 August 2024
  • Thumbnail for Fano plane
    calculated by plugging the numbers of cycle structures into the Pólya enumeration theorem. This number of colorings is n 7 + 21 n 5 + 98 n 3 + 48 n 168...
    24 KB (3,094 words) - 01:49, 22 July 2024
  • George Pólya, based on the evidence, that most numbers less than any particular limit have an odd number of prime factors. However, this Pólya conjecture...
    36 KB (1,566 words) - 06:04, 20 July 2024
  • Thumbnail for Graph theory
    The techniques he used mainly concern the enumeration of graphs with particular properties. Enumerative graph theory then arose from the results of...
    52 KB (6,403 words) - 19:52, 7 October 2024
  • structures. Matroid Greedoid Ramsey theory Van der Waerden's theorem Hales–Jewett theorem Umbral calculus, binomial type polynomial sequences Combinatorial...
    9 KB (683 words) - 08:34, 14 July 2024
  • Thumbnail for Eulerian path
    3 (3–4): 375–380, doi:10.1007/BF02579193, MR 0729790, S2CID 13708977. Pólya, George; Tarjan, Robert E.; Woods, Donald R. (October 2009), "Hamiltonian...
    27 KB (3,269 words) - 00:33, 2 October 2024
  • consecutive values of a mimic a random variable like a coin flip. Specifically, Pólya and Vinogradov proved (independently) in 1918 that for any nonprincipal...
    54 KB (5,557 words) - 19:40, 15 May 2024
  • Thumbnail for Shing-Tung Yau
    partial differential equations, the Calabi conjecture, the positive energy theorem, and the Monge–Ampère equation. Yau is considered one of the major contributors...
    116 KB (10,419 words) - 07:02, 13 September 2024
  • Thumbnail for David Hilbert
    of analytic number theory, but his name has become known for the Hilbert–Pólya conjecture, for reasons that are anecdotal. Ernst Hellinger, a student of...
    59 KB (7,101 words) - 11:25, 21 September 2024