LISTSERV mailing list manager LISTSERV 16.0

Help for TSE Archives


TSE Archives

TSE Archives


TSE@PO.MISSOURI.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

TSE Home

TSE Home

TSE  March 2001

TSE March 2001

Subject:

RE: (VERY) OFF TOPIC - Map coloring

From:

"Arwin van Arum" <[log in to unmask]>

Date:

Mon, 12 Mar 2001 23:15:21 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (297 lines)

This is a multi-part message in MIME format.

------=_NextPart_000_0022_01C0AB4A.4FB670E0
Content-Type: text/plain;
	charset="US-ASCII"
Content-Transfer-Encoding: 7bit


  -----Oorspronkelijk bericht-----
  Van: [log in to unmask]
[mailto:[log in to unmask]]Namens [log in to unmask]
  Verzonden: maandag 12 maart 2001 22:33
  Aan: [log in to unmask]
  Onderwerp: Re: (VERY) OFF TOPIC - Map coloring


  In a message dated 3/12/01 12:14:55 PM Eastern Standard Time,
  [log in to unmask] writes:



      It is the job of the mathematicians is to determine what is
    mathematically
    meant by "every case". That's done all the time. For example, in poker,
the
    "odds" of getting five cards of the same suit is determined by
calculating
    the NUMBER of ways five randomly drawn cards can be of the same suit,
and
    then dividing that number by the TOTAL NUMBER OF WAYS any five cards can
be
    drawn from a 52 card deck.


  Yes, and if n colors are going to be used to color n shapes, the number of
  possibilities is n to the nth power. This really includes all
possibilities,
  including using only one of the n colors for all of the n shapes.

  Most of these color arrangments are not going to meet the criteria for
what
  Saaty calls correct k-coloring--that is, no two contiguous countries are
the
  same color. For his correct k-coloring, the limit is n!. That is, n
  factorial.

  Thus, for four color used on a basic four-shape module, there are 256
  possible combinations of which only 24 are "correct."

  Now here are my questions.

  1) This sounds to me like it's leading into a problem in what I believe is
  called combinatorial algebra. So why does one need a computer?

  2) For each n in the number series, the nth power of n is an infinite
series.
  So is n factorial.  So the computer, if using brute force, is going to run
  out of steam at some point, as it can't deal with an infinite series by
  testing "every" possibility.

  3) What was wrong with de Morgan's proof, which was rejected? It seems to
me
  that he was on the right track, much more so than what followed after.

  4) Maybe you should rethink your poker example. The number is finite
because
  there's a limit to the number of cards in a pack. There's no limit to the
  number of shapes that can be on a map.

The idea was that although there isn't a fixed number of shapes, there was a
fixed number of shape-combinations. That is, one country can be limited by
one country (say, the Vatican for example), by two countries, three, etc.
Each type of combination and situation can then be used in combination with
other combinations, which altogether apparently lead to about 1200 possible
configurations of countries you can theoretically have. For these, no
further simplification has been found and thus brute force proof is required
to complete the proof.

But this is only what I remember from quick reading in a bookstore (was the
only book I looked at though in that bookstore) and most of what I read was
about the difficulty to get the proof widely accepted (gosh, can be pretty
tricky to type with a cat resting his head on your hand, especially a big
muscular male 'great white'). You read that book and you'll be perfectly
happy (or not, but I doubt many on this list can detail everything nearly as
well as that book, which was also very pleasantly written). There was
another book that I browsed in Schotland on dreaming - the biggest point the
book made was that there was still so incredibly little known about it,
particularly on why it is even useful. I think it probably has to do with
recovery from thinking, some kind of low-power save-mode stuff, but
hopefully with the new big power-magnet and computer analysis they'll be
able to unravel those mysteries of the brain a bit further.

Another mystery is that the cat isn't in the least bit bothered by having
it's head bounce slightly up and down by my typing. Amazing ...

Arwin

   That's why one has to do something
  along the line of breaking a large map down into, say, units of four or
fewer
  shapes.  How, exactly, did they compute the number of possible
combinations,
  and what did the number turn out to be? You keep assuring me it was
  "gazillions," which I don't find very clear. I'm actually more interested
in
  how it was computed than what it turned out to be.

  pat




------=_NextPart_000_0022_01C0AB4A.4FB670E0
Content-Type: text/html;
	charset="US-ASCII"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Dus-ascii" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2920.0" name=3DGENERATOR></HEAD>
<BODY>
<DIV>&nbsp;</DIV>
<BLOCKQUOTE=20
style=3D"BORDER-LEFT: #0000ff 2px solid; MARGIN-LEFT: 5px; PADDING-LEFT: =
5px">
  <DIV align=3Dleft class=3DOutlookMessageHeader dir=3Dltr><FONT =
face=3DTahoma=20
  size=3D2>-----Oorspronkelijk bericht-----<BR><B>Van:</B>=20
  [log in to unmask] =
[mailto:[log in to unmask]]<B>Namens=20
  </B>[log in to unmask]<BR><B>Verzonden:</B> maandag 12 maart 2001=20
  22:33<BR><B>Aan:</B> [log in to unmask]<BR><B>Onderwerp:</B> Re: =
(VERY)=20
  OFF TOPIC - Map coloring<BR><BR></DIV></FONT><FONT =
face=3Darial,helvetica><FONT=20
  face=3D"Arial Narrow" lang=3D0 size=3D3 FAMILY=3D"SANSSERIF"><B>In a =
message dated=20
  3/12/01 12:14:55 PM Eastern Standard Time, <BR>[log in to unmask] =
writes:=20
  <BR><BR></FONT><FONT color=3D#000000 lang=3D0 size=3D2 =
FAMILY=3D"SANSSERIF">
  <BLOCKQUOTE=20
  style=3D"BORDER-LEFT: #0000ff 2px solid; MARGIN-LEFT: 5px; =
MARGIN-RIGHT: 0px; PADDING-LEFT: 5px"=20
  TYPE=3D"CITE"></B><BR>&nbsp;&nbsp;It is the job of the mathematicians =
is to=20
    determine what is <BR>mathematically <BR>meant by "every case". =
That's done=20
    all the time. For example, in poker, the <BR>"odds" of getting five =
cards of=20
    the same suit is determined by calculating <BR>the NUMBER of ways =
five=20
    randomly drawn cards can be of the same suit, and <BR>then dividing =
that=20
    number by the TOTAL NUMBER OF WAYS any five cards can be <BR>drawn =
from a 52=20
    card deck.</FONT><FONT color=3D#000000 lang=3D0 size=3D3=20
  FAMILY=3D"SANSSERIF"></BLOCKQUOTE>
  <DIV><BR><BR></FONT><FONT color=3D#000000 lang=3D0 =
FAMILY=3D"SANSSERIF"><FONT=20
  size=3D2><STRONG>Yes, and if n colors are going to be used to color n =
shapes,=20
  the number of <BR>possibilities is n to the nth power. This really =
includes=20
  <U>all </U>possibilities, <BR>including using only one of the n colors =
for all=20
  of the n shapes. <BR><BR>Most of these color arrangments are not going =
to meet=20
  the criteria for what <BR>Saaty calls correct k-coloring--that is, no =
two=20
  contiguous countries are the <BR>same color. For his correct =
k-coloring, the=20
  limit is n!. That is, n <BR>factorial. &nbsp; <BR><BR>Thus, for four =
color=20
  used on a basic four-shape module, there are 256 <BR>possible =
combinations of=20
  which only 24 are "correct." &nbsp; <BR><BR>Now here are my questions. =

  <BR><BR>1) This sounds to me like it's leading into a problem in what =
I=20
  believe is <BR>called combinatorial algebra. So why does one need a =
computer?=20
  <BR><BR>2) For each n in the number series, the nth power of n is an =
infinite=20
  series. <BR>So is n factorial. &nbsp;So the computer, if using brute =
force, is=20
  going to run <BR>out of steam at some point, as it can't deal with an =
infinite=20
  series by <BR>testing "every" possibility. <BR><BR>3) What was wrong =
with de=20
  Morgan's proof, which was rejected? It seems to me <BR>that he was on =
the=20
  right track, much more so than what followed after. <BR><BR>4) Maybe =
you=20
  should rethink your poker example. The number is finite because =
<BR>there's a=20
  limit to the number of cards in a pack. There's no limit to the =
<BR>number of=20
  shapes that can be on a map.&nbsp;</STRONG><SPAN=20
  class=3D132385021-12032001><FONT=20
  color=3D#0000ff>&nbsp;</FONT></SPAN></FONT></FONT></DIV>
  <DIV><FONT color=3D#000000 lang=3D0 FAMILY=3D"SANSSERIF"><FONT =
size=3D2><SPAN=20
  =
class=3D132385021-12032001></SPAN></FONT></FONT>&nbsp;</DIV></BLOCKQUOTE>=

<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001>The idea was that although there isn't a =
fixed number=20
of shapes, there was a fixed number of shape-combinations. That is, one =
country=20
can be limited by one country (say, the Vatican for example), by two =
countries,=20
three, etc. Each type of combination and situation can then be used in=20
combination with other combinations, which altogether apparently lead to =
about=20
1200 possible configurations of countries you can theoretically have. =
For these,=20
no further simplification has been found and thus brute force proof is =
required=20
to complete the proof. </SPAN></FONT></FONT></DIV>
<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001></SPAN></FONT></FONT>&nbsp;</DIV>
<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001>But this is only what I remember from quick =
reading in=20
a bookstore (was the only book I looked at though in that bookstore) and =
most of=20
what I read was about the difficulty to get the proof widely accepted =
(gosh, can=20
be pretty tricky to type with a cat resting his head on your hand, =
especially a=20
big muscular male 'great white'). You read that book and you'll be =
perfectly=20
happy (or not, but I doubt many on this list can detail everything =
nearly as=20
well as that book, which was also very pleasantly written). There was =
another=20
book that I browsed in Schotland on dreaming - the biggest point the =
book made=20
was that there was still so incredibly little known about it, =
particularly on=20
why it is even useful. I think it probably has to do with recovery from=20
thinking, some kind of low-power save-mode stuff, but hopefully with the =
new big=20
power-magnet and computer analysis they'll be able to unravel those =
mysteries of=20
the brain a bit further. </SPAN></FONT></FONT></DIV>
<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001></SPAN></FONT></FONT>&nbsp;</DIV>
<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001>Another mystery is that the cat isn't in the =
least bit=20
bothered by having it's head bounce slightly up and down by my typing. =
Amazing=20
.... </SPAN></FONT></FONT></DIV>
<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001></SPAN></FONT></FONT>&nbsp;</DIV>
<DIV><FONT lang=3D0 FAMILY=3D"SANSSERIF"><FONT color=3D#0000ff =
size=3D2><SPAN=20
class=3D132385021-12032001>Arwin</SPAN></FONT></FONT></DIV>
<BLOCKQUOTE=20
style=3D"BORDER-LEFT: #0000ff 2px solid; MARGIN-LEFT: 5px; PADDING-LEFT: =
5px">
  <DIV><FONT color=3D#000000 lang=3D0 FAMILY=3D"SANSSERIF"><FONT =
size=3D2><SPAN=20
  class=3D132385021-12032001></SPAN></FONT></FONT>&nbsp;</DIV>
  <DIV><FONT color=3D#000000 lang=3D0 FAMILY=3D"SANSSERIF"><FONT =
size=3D2><SPAN=20
  class=3D132385021-12032001>&nbsp;</SPAN><STRONG></FONT><FONT =
size=3D2>That's why=20
  one has to do something <BR>along the line of breaking a large map =
down into,=20
  say, units of four or fewer <BR>shapes. &nbsp;How, exactly, did they =
compute=20
  the number of possible combinations, <BR>and what did the number turn =
out to=20
  be? You keep assuring me it was <BR>"gazillions," which I don't find =
very=20
  clear. I'm actually more interested in <BR>how it was computed than =
what it=20
  turned out to be. <BR><BR>pat</FONT></STRONG><FONT size=3D2>=20
  <BR><BR></FONT></FONT><FONT color=3D#000000 lang=3D0 size=3D3=20
  FAMILY=3D"SANSSERIF"><BR></DIV></BLOCKQUOTE></FONT><FONT =
color=3D#000000 lang=3D0=20
size=3D2 FAMILY=3D"SANSSERIF"></FONT></FONT></BODY></HTML>

------=_NextPart_000_0022_01C0AB4A.4FB670E0--

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
March 1996
February 1996
January 1996
December 1995
November 1995

ATOM RSS1 RSS2



PO.MISSOURI.EDU

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager