|
|
| Line 1: |
Line 1: |
| The '''Pólya enumeration theorem''' ('''PET'''), also known as the '''Redfield–Pólya Theorem''', is a theorem in [[combinatorics]] that both follows and ultimately generalizes [[Burnside's lemma]] on the number of [[Orbit (group theory)#Orbits and stabilizers|orbits]] of a [[group action]] on a set. The theorem was first published by [[John Howard Redfield]] in 1927. In 1937 it was independently rediscovered by [[George Pólya]], who then greatly popularized the result by applying it to many counting problems, in particular to the enumeration of [[chemical compound]]s.
| | Captain America, Spider-Man, the X-Men and Transformers aгe stormіng back into movie theateгs, returning in sequels to save the wօrlɗ from masѕ deѕtruction, while at thе samе time churning out profits for moѵiе stսԀіos.<br><br>Hοllywood will pɑck 13 sequels into theaters ovег the next 20 weeks. The parade begins on Fгiday, wҺen Captain America dons Һis red-whitе-and-ƅlue supeгhero suit for thе U.S. dеbut of Marvel's "Captain America: watch The amazing spider-man 2 full movie - [http://theamazingspider-man2movie.blogspot.com/ theamazingspider-man2movie.blogspot.com], Winter Soldier," and continues througҺ summer, Hollywood's most lucrative ѕeason.<br><br>Ѕtudioѕ ǥеnerally don't have to spend as much to raise awareness of seqսels months in advance, as they do with othеr big-bսdget films, executives say. And when sequels геɑch the big screen, tickеt ѕales in foreign markets, whiϲh can accοunt for uρ to 80 percent of а film's box offіce, often exceed their predeceѕsoгs.<br><br>"When you can say, here's 'Avatar 2,' and you've got six billion people ready to see it, it doesn't take a lot of marketing to get them into the theater," said Jim Gianopulos, chairman and chief executive of Fox Filmed Entertainment. "It's a self-propelling marketing message in a very big world."<br><br>TҺe first installment of 20th Century Fox's ɑnimated "Ice Age" series took in $207 million overseas in 2002. Ƭhe fourth "Ice Age" from tҺe studio owned Ƅy Twenty-Ϝirst Cеntury Fox earned $716 milliօn at international box offices in 2012.<br>Sequels are hardlү a new Hollywood phenomenon. But in recent years, аs DVD sales crսmƅled, movie ѕtudios began to cut back on the numbers of filmѕ they рroduced to trim the risks.<br>Starting іn 2008, they began to churn out more seգuеls and big-budgеt event films, turning away frоm riskier oгіginal films like independent dramas and romantic comedies.<br><br>This year's sequels include superhero films "The Amazing Spider-Man 2" from Sony Corp, Fox's "X-Men: Days of Future Past," and "Transformers: Age of Extinction" from Viacom Inc's Paramount; animated movies "Rio 2" from Fox and Dreamworks Animation's "How to Train Your Dragon 2;" and Sony comedies "22 Jump Street" and "Think Like a Man Too."<br>What mostly drives the studio top brass is that audiences keep buying tіckets for sequels. In 2013, nine of the top 12 filmѕ in the U.S. аnd Canada weгe sequels or preqսels, including Marvel's "Iron Man 3" and Lions Ԍate's "The Hunger Games: Catching Fire." Those films generated $2.6 billion in domestic ticкet salеs, nearly one-quarter of the yеar's $10.9 [http://thesaurus.com/browse/billion billion] total, and another $4.5 billion woгldwide.<br><br>That shift away from riskier films has helped studios incrеase ߋr stabilize their profits, said Janney Montgomery Scott analyst Tony Wible.<br>Օperating margins ɑt Time Warner Inc's Warner Bros., the studio behind the "Harry Potter" franchise and "The Dark Knight" Batman series, hovered around 7 percent in 2007 and 2008, Wible said, before rising to about 10 percent for еach of the next fivе yearѕ.<br><br>At Walt Disney Co, the focus is ߋn a smaller number of films with the ρotentіal to produce sequels, Ԁrive toy sales and inspire theme-park rides.<br><br>In а typical year, Ɗisney is aiming to гelease one film eaсh from Pіxar, Disney Animation, and "Star Wars" pгoducer Lucasfilm; two from Marvel, and four to six from its Disney live action divіsion, saіd Alan Horn, chairman of The Walt Disney Studios. "We choose our sequels carefully," Horn said.<br>"If we have a picture that has earned a right to have a sequel, it's because the audiences loved it."<br>Next yeɑr's crop of sequels may set even ƅigger reϲords. Studios are alrеady planning to releasе new installments of somе of the biggeѕt films of all time, including "Star Wars," "Jurassic Park" and "Marvel's The Avengers."<br><br>The rash of sequels has prompted even filmmakers to make fun of their world. In the opening number for "Muppets Most Wanted," Disney's sequel to its 2011 "The Muppets" mοviе, the furry puppets breɑk into a song calleԁ "We're Doing a Sequel."<br>"That's what we do in Hollywood," the puppets sing, "and everybody knows that the sequel's never quite as good."<br>(Ɍeporting by Lіsa Richաine; Editing by Ronald Gгover and Kenneth Maxwell) |
| | |
| The Pólya enumeration theorem can also be incorporated into [[symbolic combinatorics]] and the theory of [[combinatorial species]].
| |
| | |
| == A simplified, unweighted version ==
| |
| | |
| Let ''X'' be a finite set and let ''G'' be a group of [[permutation]]s of ''X'' (or a finite [[symmetry group]] that [[group action|acts]] on ''X''). The set ''X'' may represent a finite set of beads, and ''G'' may be a chosen group of permutations of the beads. For example, if ''X'' is a [[necklace (combinatorics)|necklace]] of ''n'' beads in a circle, then [[rotational symmetry]] is relevant so ''G'' is the [[cyclic group]] ''C<sub>n</sub>'', while if ''X'' is a [[bracelet (combinatorics)|bracelet]] of ''n'' beads in a circle, rotations and [[Reflection symmetry|reflection]]s are relevant so ''G'' is the [[dihedral group]] ''D<sub>n</sub>'' of order ''2n''. Suppose further that ''Y'' is a finite set of colors — the colors of the beads — so that ''Y<sup>X</sup>'' is the set of colored arrangements of beads, and suppose that there are <math>\left| Y \right| = t </math> colors. (More formally, a given "coloring" is a function <math>X \to Y</math>.) Then the Pólya enumeration theorem counts the number of orbits under ''G'' of colored arrangements of beads by the following formula:
| |
| :<math>|Y^X/G| = \frac{1}{|G|}\sum_{g \in G} t^{c(g)}</math>
| |
| where <math>\left| Y \right| = t </math> and ''c''(''g'') is the number of cycles of the group element ''g'' as a permutation of ''X''.
| |
| | |
| == The full, weighted version ==
| |
| | |
| In the more general and more important version of the theorem, the colors are also weighted in one or more ways, and there could be an infinite number of colors provided that the set of colors has a [[generating function]] with finite coefficients. In the univariate case, suppose that
| |
| :<math>f(x) = f_0 + f_1 x + f_2 x^2 + \cdots</math> | |
| is the generating function of the set of colors, so that there are ''f<sub>n</sub>'' colors of weight ''n'' for each ''n'' ≥ 0. In the multivariate case, the weight of each color is a vector of integers and there is a generating function ''f(a,b,...)'' that tabulates the number of colors with each given vector of weights.
| |
| | |
| The enumeration theorem employs another multivariate generating function called the [[cycle index]]:
| |
| :<math>Z_G(t_1,t_2,\ldots,t_n) = \frac{1}{|G|}\sum_{g \in G} t_1^{j_1(g)} t_2^{j_2(g)} \cdots t_n^{j_n(g)}.</math>
| |
| Here the ''k''th weight ''j<sub>k</sub>''(''g'') is the number of ''k''-cycles of ''g'' as a permutation of ''X''. The theorem then says that the generating function ''F'' of colored arrangements is the cycle index, composed with the generating function ''f'' of the colors, composed with powers of the variables of ''f'':
| |
| :<math>F(x) = Z_G(f(x),f(x^2),f(x^3),\ldots,f(x^n))</math>
| |
| or in the multivariate case:
| |
| :<math>F(a,b,\ldots) = Z_G(f(a,b,\ldots),f(a^2,b^2,\ldots),f(a^3,b^3,\ldots),\ldots,f(a^n,b^n,\ldots)).</math>
| |
| To reduce to the simplified version, if there are ''t'' colors of weight 0, then
| |
| :<math>|Y^X/G| = Z_G(t,t,\ldots,t).</math>
| |
| | |
| In the celebrated application of counting trees (see below) and acyclic molecules, an arrangement of "colored beads" is actually an arrangement of arrangements, such as branches of a rooted tree. Thus the generating function ''f'' for the colors is derived from the generating function ''F'' for arrangements, and the Pólya enumeration theorem becomes a recursive formula.
| |
| | |
| == Examples ==
| |
| | |
| === Graphs on three and four vertices ===
| |
| | |
| A graph on ''m'' vertices can be interpreted as an arrangement of colored beads. The arrangement ''X'' is the set of <math>\binom{m}2</math> possible edges, while the set of colors ''Y'' = {black,white} corresponds to edges that are present (black) or absent (white). The Pólya enumeration theorem can be used to calculate the number of graphs up to isomorphism with a fixed number of vertices, or the generating function of these graphs according to the number of edges they have. For the latter purpose, we can say that a black or present edge has weight 1, while an absent or white edge has weight 0. Thus <math>f(t) = 1+t</math> is the generating function for the set of colors. The relevant symmetry group is <math>G = S_m</math>, the [[symmetric group]] on ''m'' letters; an isomorphism class of graphs is equivalent to an orbit of graphs under this group. It acts as a subgroup of <math>S_{\binom{m}2}</math>, the group of permutations of all of the edges.
| |
| | |
| [[Image:AllGraphsOnThreeVertices.png|thumb|All graphs on three vertices.]]
| |
| [[Image:NonisomorphicGraphsOnThreeVertices.png|thumb|Nonisomorphic graphs on three vertices.]]
| |
| | |
| The 8 graphs on three vertices without quotienting by symmetry are shown at the right. There are four isomorphism class of graphs, also shown at the right.
| |
| | |
| The [[Cycle index#Case study: edge permutation group of graphs on three vertices|cycle index]] of the permutation group of the edges is
| |
| :<math>Z_G(t_1,t_2,t_3) = \frac{t_1^3 + 3 t_1 t_2 + 2 t_3}{6}.</math>
| |
| Thus, according to the enumeration theorem, the generating function of graphs on 3 vertices up to isomorphism is
| |
| :<math>F(t) = Z_G(t+1,t^2+1,t^3+1) = \frac{(t+1)^3 + 3 (t+1) (t^2+1) + 2 (t^3+1)}{6},</math>
| |
| which simplifies to
| |
| :<math>F(t) = t^3+t^2+t+1.</math>
| |
| Thus there is one graph each with 0 to 3 edges.
| |
| | |
| [[Image:NonisomorphicGraphsOnFourVertices.png|thumb|Isomorphism classes of graphs on four vertices.]]
| |
| The [[Cycle index#Case study: edge permutation group of graphs on four vertices|cycle index]] of the edge permutation group for graphs on four vertices is:
| |
| :<math>
| |
| Z_G(t_1,t_2,t_3,t_4) = \frac{t_1^6 + 9 t_1^2 t_2^2 + 8 t_3^2 + 6 t_2 t_4}{24}.
| |
| </math>
| |
| Hence
| |
| :<math>
| |
| F(t) = Z_G(1+t,1+t^2,1+t^3,1+t^4) = \frac{(t+1)^6 + 9 (t+1)^2 (t^2+1)^2 + 8 (t^3+1)^2 + 6 (t^2+1) (t^4+1)}{24}\,
| |
| </math>
| |
| which simplifies to
| |
| :<math>F(t) = t^6 + t^5 + 2 t^4 + 3 t^3 + 2 t^2 + t + 1.</math>
| |
| These graphs are shown at the right.
| |
| | |
| ===Rooted ternary trees===
| |
| | |
| The set ''T''<sub>3</sub> of rooted ternary [[Tree (graph theory)|trees]] consists of rooted trees where every node has exactly three children (leaves or subtrees). Small ternary trees are shown at right. Note that ternary trees with ''n'' vertices are equivalent to trees with ''n'' vertices of degree at most 3. In general, rooted trees are isomorphic when one can be obtained from the other by permuting the children of its nodes. In other words, the group that acts on the children of a node is the symmetric group ''S''<sub>3</sub>. We define the weight of such a ternary tree to be the number of nodes (or non-leaf vertices).
| |
| [[Image:TernaryTrees.png|thumb|Ternary trees on 0, 1, 2, 3 and 4 vertices. (Leaves not shown except for the tree on zero vertices (green)).]]
| |
| | |
| We can view a rooted, ternary tree as a recursive object which is either a leaf or three branches which are themselves rooted ternary trees. These branches are equivalent to beads; the [[Cycle index#Sample computations|cycle index]] of the symmetric group ''S''<sub>3</sub> that acts on them is then
| |
| :<math>Z_{S_3}(t_1,t_2,t_3) = \frac{t_1^3 + 3 t_1 t_2 + 2 t_3}{6}.</math>
| |
| The Polya enumeration theorem then yields a functional equation for the generating function ''T''(''x'') of the rooted ternary trees:
| |
| :<math>T(x) = 1 + x\frac{T(x)^3 + 3 T(x)T(x^2) + 2 T(x^3)}{6}.</math> | |
| This is equivalent to the following recurrence formula for the number ''t''<sub>n</sub> of rooted ternary trees with ''n'' nodes:
| |
| :<math>t_0 = 1</math>
| |
| and
| |
| :<math>t_{n+1} = \frac{1}{6}
| |
| \left(\sum_{a + b + c = n} t_a t_b t_c + 3 \sum_{a + 2b = n} t_a t_b + 2 \sum_{3a = n} t_a \right)
| |
| </math>
| |
| where ''a'', ''b'' and ''c'' are nonnegative integers.
| |
| | |
| The first few values of <math>t_n</math> are
| |
| : 1, 1, 1, 2, 4, 8, 17, 39, 89, 211, 507, 1238, 3057, 7639, 19241 {{OEIS|id=A000598}}
| |
| | |
| === Colored cubes ===
| |
| | |
| How many ways are there to color the sides of a 3-dimensional cube with ''t'' colors, up to rotation of the cube? The rotation group ''C'' of the cube acts on the six sides of the cube, which are equivalent to beads. Its [[Cycle index#Case study: face permutations of a cube|cycle index]] is
| |
| :<math>Z_C(t_1,t_2,t_3,t_4) = \frac{t_1^6 + 6 t_1^2 t_4 + 3 t_1^2 t_2^2 + 8 t_3^2 + 6 t_2^3}{24}.</math>
| |
| Thus there are
| |
| :<math>Z_C(t,t,t,t) = \frac{t^6+ 3t^4 + 12 t^3 + 8 t^2}{24}</math>
| |
| colorings.
| |
| | |
| ==Proof of theorem==
| |
| The simplified form of the Pólya enumeration theorem follows from [[Burnside's lemma]], which says that the number of orbits of colorings is the average of the number of elements of <math>Y^X</math> fixed by the permutation ''g'' of ''G'' over all permutations ''g''. The weighted version of the theorem has essentially the same proof, but with a refined form of Burnside's lemma for weighted enumeration. It is equivalent to apply Burnside's lemma separately to orbits of different weight.
| |
| | |
| For clearer notation, let <math>x_1,x_2,\ldots</math> be the variables of the generating function ''f'' of <math>Y</math>.
| |
| Given a vector of weights <math>\omega</math>, let <math>x^\omega</math> denote the corresponding monomial term of ''f''.
| |
| Applying Burnside's lemma to orbits of weight <math>\omega</math>, the number of orbits of this weight is
| |
| :<math>\frac{1}{|G|} \sum_{g\in G} |(Y^X)_{\omega,g}|</math>
| |
| where <math>(Y^X)_{\omega,g}</math> is the set of colorings of weight <math>\omega</math> that are also fixed by ''g''. If we then sum over all
| |
| all possible weights, we obtain
| |
| :<math>F(x_1,x_2,\ldots)= \frac{1}{|G|} \sum_{g \in G, \omega} x^\omega |(Y^X)_{\omega,g}|.</math>
| |
| | |
| Meanwhile ''g'' has a cycle structure <math>j_1,j_2,\ldots,j_n</math> which contributes
| |
| :<math> t_1^{j_1(g)} t_2^{j_2(g)} \cdots t_n^{j_n(g)}</math>
| |
| to the cycle index of ''G''. The element ''g'' fixes an element of <math>Y^X</math> if and only if it is constant on every cycle ''q'' of ''g''.
| |
| The generating function by weight of a cycle ''q'' of |''q''| identical elements from the set of objects enumerated by ''f'' is
| |
| :<math>f(x_1^{|q|}, x_2^{|q|}, x_3^{|q|}, \ldots).</math>
| |
| It follows that the generating function by weight of the points fixed by ''g''
| |
| is the product of the above term over all cycles of ''g'', i.e.
| |
| :<math>
| |
| \sum_{\omega} x^\omega |(Y^X)_{\omega,g}| = \prod_{q\in g} f(x_1^{|q|}, x_2^{|q|}, x_3^{|q|}, \ldots),
| |
| </math>
| |
| which equals
| |
| :<math>
| |
| f(x_1, x_2, \ldots)^{j_1(g)} f(x_1^2, x_2^2, \ldots)^{j_2(g)} \cdots f(x_1^n, x_2^n, \ldots)^{j_n(g)}.
| |
| </math>
| |
| Substituting this for <math>\sum_{\omega} x^\omega |(Y^X)_{\omega,g}|\,</math> in the sum over all ''g'' yields the substituted [[cycle index]] as claimed.
| |
| | |
| ==References==
| |
| * {{cite journal
| |
| | last = Redfield
| |
| | first = J. Howard
| |
| | title = The Theory of Group-Reduced Distributions
| |
| | journal = [[American Journal of Mathematics]]
| |
| | volume = 49
| |
| | year = 1927
| |
| | issue = 3
| |
| | pages = 433–455
| |
| | doi = 10.2307/2370675
| |
| | id = {{MathSciNet | id = 1506633}}
| |
| | jstor=2370675}}
| |
| * {{cite journal
| |
| | author = [[Frank Harary]]
| |
| | coauthors = Ed Palmer
| |
| | title = The Enumeration Methods of Redfield
| |
| | journal = [[American Journal of Mathematics]]
| |
| | volume = 89
| |
| | year = 1967
| |
| | issue = 2
| |
| | pages = 373–384
| |
| | doi = 10.2307/2373127
| |
| | id = {{MathSciNet | id = 0214487}}
| |
| | jstor=2373127}}
| |
| * {{cite journal
| |
| | author = G. Pólya
| |
| | title = Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
| |
| | journal = [[Acta Mathematica]]
| |
| | volume = 68
| |
| | year = 1937
| |
| | issue = 1
| |
| | pages = 145–254
| |
| | url = http://www.springerlink.com/content/9021012252111875/
| |
| | doi = 10.1007/BF02546665 }}
| |
| *{{cite book
| |
| | author = G. Pólya
| |
| | coauthors = R. C. Read
| |
| | title = Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
| |
| | publisher = [[Springer-Verlag]]
| |
| | location = New York
| |
| | date = 1987
| |
| | isbn = 0-387-96413-4
| |
| | id = {{MathSciNet | id = 0884155}}}}
| |
| | |
| ==External links==
| |
| *[http://demonstrations.wolfram.com/ApplyingThePolyaBurnsideEnumerationTheorem/ Applying the Pólya-Burnside Enumeration Theorem] by Hector Zenil and Oleksandr Pavlyk, [[The Wolfram Demonstrations Project]].
| |
| * {{MathWorld |title=Polya Enumeration Theorem |urlname=PolyaEnumerationTheorem}}
| |
| * Frederic Chyzak [http://algo.inria.fr/libraries/autocomb/Polya-html/Polya.html Enumerating alcohols and other classes of chemical molecules, an example of Pólya theory].
| |
| * Marko Riedel, ''[http://www.mathematik.uni-stuttgart.de/~riedelmo/papers/collier.pdf Pólya's enumeration theorem and the symbolic method]''.
| |
| | |
| {{DEFAULTSORT:Polya Enumeration Theorem}}
| |
| [[Category:Enumerative combinatorics]]
| |
| [[Category:Articles containing proofs]]
| |
| [[Category:Graph enumeration]]
| |
| [[Category:Theorems in combinatorics]]
| |
Captain America, Spider-Man, the X-Men and Transformers aгe stormіng back into movie theateгs, returning in sequels to save the wօrlɗ from masѕ deѕtruction, while at thе samе time churning out profits for moѵiе stսԀіos.
Hοllywood will pɑck 13 sequels into theaters ovег the next 20 weeks. The parade begins on Fгiday, wҺen Captain America dons Һis red-whitе-and-ƅlue supeгhero suit for thе U.S. dеbut of Marvel's "Captain America: watch The amazing spider-man 2 full movie - theamazingspider-man2movie.blogspot.com, Winter Soldier," and continues througҺ summer, Hollywood's most lucrative ѕeason.
Ѕtudioѕ ǥеnerally don't have to spend as much to raise awareness of seqսels months in advance, as they do with othеr big-bսdget films, executives say. And when sequels геɑch the big screen, tickеt ѕales in foreign markets, whiϲh can accοunt for uρ to 80 percent of а film's box offіce, often exceed their predeceѕsoгs.
"When you can say, here's 'Avatar 2,' and you've got six billion people ready to see it, it doesn't take a lot of marketing to get them into the theater," said Jim Gianopulos, chairman and chief executive of Fox Filmed Entertainment. "It's a self-propelling marketing message in a very big world."
TҺe first installment of 20th Century Fox's ɑnimated "Ice Age" series took in $207 million overseas in 2002. Ƭhe fourth "Ice Age" from tҺe studio owned Ƅy Twenty-Ϝirst Cеntury Fox earned $716 milliօn at international box offices in 2012.
Sequels are hardlү a new Hollywood phenomenon. But in recent years, аs DVD sales crսmƅled, movie ѕtudios began to cut back on the numbers of filmѕ they рroduced to trim the risks.
Starting іn 2008, they began to churn out more seգuеls and big-budgеt event films, turning away frоm riskier oгіginal films like independent dramas and romantic comedies.
This year's sequels include superhero films "The Amazing Spider-Man 2" from Sony Corp, Fox's "X-Men: Days of Future Past," and "Transformers: Age of Extinction" from Viacom Inc's Paramount; animated movies "Rio 2" from Fox and Dreamworks Animation's "How to Train Your Dragon 2;" and Sony comedies "22 Jump Street" and "Think Like a Man Too."
What mostly drives the studio top brass is that audiences keep buying tіckets for sequels. In 2013, nine of the top 12 filmѕ in the U.S. аnd Canada weгe sequels or preqսels, including Marvel's "Iron Man 3" and Lions Ԍate's "The Hunger Games: Catching Fire." Those films generated $2.6 billion in domestic ticкet salеs, nearly one-quarter of the yеar's $10.9 billion total, and another $4.5 billion woгldwide.
That shift away from riskier films has helped studios incrеase ߋr stabilize their profits, said Janney Montgomery Scott analyst Tony Wible.
Օperating margins ɑt Time Warner Inc's Warner Bros., the studio behind the "Harry Potter" franchise and "The Dark Knight" Batman series, hovered around 7 percent in 2007 and 2008, Wible said, before rising to about 10 percent for еach of the next fivе yearѕ.
At Walt Disney Co, the focus is ߋn a smaller number of films with the ρotentіal to produce sequels, Ԁrive toy sales and inspire theme-park rides.
In а typical year, Ɗisney is aiming to гelease one film eaсh from Pіxar, Disney Animation, and "Star Wars" pгoducer Lucasfilm; two from Marvel, and four to six from its Disney live action divіsion, saіd Alan Horn, chairman of The Walt Disney Studios. "We choose our sequels carefully," Horn said.
"If we have a picture that has earned a right to have a sequel, it's because the audiences loved it."
Next yeɑr's crop of sequels may set even ƅigger reϲords. Studios are alrеady planning to releasе new installments of somе of the biggeѕt films of all time, including "Star Wars," "Jurassic Park" and "Marvel's The Avengers."
The rash of sequels has prompted even filmmakers to make fun of their world. In the opening number for "Muppets Most Wanted," Disney's sequel to its 2011 "The Muppets" mοviе, the furry puppets breɑk into a song calleԁ "We're Doing a Sequel."
"That's what we do in Hollywood," the puppets sing, "and everybody knows that the sequel's never quite as good."
(Ɍeporting by Lіsa Richաine; Editing by Ronald Gгover and Kenneth Maxwell)