歡迎來到 財團法人台北市九章數學教育基金會
首頁 新聞區 討論區 檔案下載

2018 澳洲AMC數學能力檢定


第22屆小學數學世界邀請賽(PMWC 2019,香港)與2019國際小學數學競賽(SAIMC 2019,南非Durban市)

2019青少年數學國際城市邀請賽(SAIMC 2019,南非Durban市))



2017 澳洲AMC

2016 澳洲AMC


IMAS 2017

IMAS 2016



PMWC 2018與BIMC 2018

PMWC 2017與InIMC 2017


IMSO 2018

IMSO 2017



BIMC 2018

InIMC 2017

國際青少年數學奧林匹亞(ITMO )

ITMO 2017

ITMO 2015

國際青少年數學家會議(IYMC )

IYMC 2016

· 回首頁
· 新聞區
· 討論區
· 檔案下載
· 網站連結
· 電子相薄
· 夥伴網站
· 精華文章
/  討論區主頁10
   /  讀書討論區
      /  "Road Coloring Problem." 道路著色謎題 以色列數學家破解(轉貼)
Quite a regular

註冊日: 2005-09-03
發表數: 48

 "Road Coloring Problem." 道路著色謎題 以色列數學家破解(轉貼)

〔編譯胡立宗/美聯社耶路撒冷二十日電〕「道路著色問題」(Road Coloring Problem)一九七○年代提出,此後近四十年,釵h數學家都試著找出解答,但都無它茠臐C一位「高齡」六十三歲的以色列數學家卻在去年底得出解答,儘管釵h人訝異於他的成就,但他自己仍然低調表示,這只是個「數學家的本務」。

近40年來 大熱門數學謎題




自蘇聯返以 一度屈就守衛





In graph theory the road coloring theorem, until recently known as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from any other point within a network (which might be a representation of city streets or a maze).[1] In the real world, this phenomenon would be as if you called a friend to ask for directions to his house, and he gave you a set of directions that worked no matter where you started from. This theorem also has implications in symbolic dynamics.

The theorem was first conjectured in 1970 by Benjamin Weiss and Roy Adler.[2] It was proved by Avraham Trahtman in September 2007[3].

Example and intuition

The image to the right shows a directed graph on eight vertices in which each vertex has out-degree 2. (Each vertex in this case also has in-degree 2, but that is not necessary for a synchronizing coloring to exist.) The edges of this graph have been colored red and blue to create a synchronizing coloring.

For example, consider the vertex marked in yellow. No matter where in the graph you start, if you traverse all nine edges in the walk "blue-red-red—blue-red-red—blue-red-red", you will end up at the yellow vertex. Similarly, if you traverse all nine edges in the walk "blue-blue-red—blue-blue-red—blue-blue-red", you will always end up at the vertex marked in green, no matter where you started.

The road coloring theorem states that for a certain category of directed graphs, it is always possible to create such a coloring.


After 38 years, Israeli solves math code[Road Coloring Problem]

JERUSALEM - A mathematical puzzle that baffled the top minds in the esoteric field of symbolic dynamics for nearly four decades has been cracked — by a 63-year-old immigrant who once had to work as a security guard.

Avraham Trahtman, a mathematician who also toiled as a laborer after moving to Israel from Russia, succeeded where dozens failed, solving the elusive "Road Coloring Problem."

The conjecture essentially assumed it's possible to create a "universal map" that can direct people to arrive at a certain destination, at the same time, regardless of starting point. Experts say the proposition could have real-life applications in mapping and computer science.

The "Road Coloring Problem" was first posed in 1970 by Benjamin Weiss, an Israeli-American mathematician, and a colleague, Roy Adler, who worked at IBM at the time.

For eight years, Weiss tried to prove his theory. Over the next 30 years, some 100 other scientists attempted as well. All failed, until Trahtman came along and, in eight short pages, jotted the solution down in pencil last year.

"The solution is not that complicated. It's hard, but it is not that complicated," Trahtman said in heavily accented Hebrew. "Some people think they need to be complicated. I think they need to be nice and simple."

Weiss said it gave him great joy to see someone solve his problem.

Stuart Margolis, a mathematician who recruited Trahtman to teach at Bar Ilan University near Tel Aviv, called the solution one of the "beautiful results." But he said what makes the result especially remarkable is Trahtman's age and background.

"Math is usually a younger person's game, like music and the arts," Margolis said. "Usually you do your better work in your mid 20s and early 30s. He certainly came up with a good one at age 63."

Adding to the excitement is Trahtman's personal triumph in finally finding work as a mathematician after immigrating from Russia. "The first time I met him he was wearing a night watchman's uniform," Margolis said.

Originally from Yekaterinburg, Russia, Trahtman was an accomplished mathematician when he came to Israel in 1992, at age 48. But like many immigrants in the wave that followed the breakup of the Soviet Union, he struggled to find work in the Jewish state and was forced into stints working maintenance and security before landing a teaching position at Bar Ilan in 1995.

The soft-spoken Trahtman declined to talk about his odyssey, calling that the "old days." He said he felt "lucky" to be recognized for his solution, and played down the achievement as a "matter for mathematicians," saying it hasn't changed him a bit.

The puzzle tackled by Trahtman wasn't the longest-standing open problem to be solved recently. In 1994, British mathematician Andrew Wiles solved Fermat's last theorem, which had been open for more than 300 years.

Trahtman's solution is available on the Internet and is to be published soon in the Israel Journal of Mathematics.

Joel Friedman, a math professor at the University of British Columbia, said probably everyone in the field of symbolic dynamics had tried to solve the problem at some point, including himself. He said people in the related disciplines of graph theory, discrete math and theoretical computer science also tried.

"The solution to this problem has definitely generated excitement in the mathematical community," he said in an e-mail.

Margolis said the solution could have many applications.

"Say you've lost an e-mail and you want to get it back — it would be guaranteed," he said. "Let's say you are lost in a town you have never been in before and you have to get to a friend's house and there are no street signs — the directions will work no matter what."


 2008-03-22 09:36個人資料

註冊日: 2002-07-30
發表數: 1094

 Re: "Road Coloring Problem." 道路著色謎題 以色列數學家破解(轉貼)


孫文先 敬上

 2008-03-23 11:33個人資料傳送 Email 給 孫文先
Quite a regular

註冊日: 2005-09-03
發表數: 48

 Re: "Road Coloring Problem." 道路著色謎題 以色列數學家破解(轉貼)


孫文先 寫道:


我仔細走過一遍,沒錯啊! 老師可以說說您的走法嗎?



所以圖形應該沒錯啊! 老師,可否指點我們您的看法呢?

下面四個是談到四色圖法及有關UPS走對送貨路線是可以節省成本,這在九章數學俱樂部及我自己看過一些數學邏輯書籍都有提過Bivariate Splines and the Four Color Map Problem走法,可提供給大家想一想:

“UPS Figures Out the ‘Right Way’ to Save Money, Time and Gas”

It’s quite an interesting theorem / problem. Here are few brief descriptions, with some original info in each one:



And the one that likely crosses the bridge from Four Color Map Problem to Road Coloring Problem - Multivariate Splines:


Wikipedia also has a decent description of theorem and practical implications for topography and topology:



學生 敬上.

 2008-03-23 12:26個人資料

註冊日: 2002-07-30
發表數: 1094

 Re: "Road Coloring Problem." 道路著色謎題 以色列數學家破解(轉貼)


孫文先 敬上

 2008-03-23 15:22個人資料傳送 Email 給 孫文先

Copyright 2000 ~2004九章數學出版社、九章數學基金會
This web site was made with XOOPS, a web portal system written in PHP.
XOOPS is a free software released under the GNU/GPL license.

TW XOOPS Official WebsiteFreeBSD Official WebsiteApache Official Website

Powered by XOOPS 1.3.10 © 2002 The XOOPS Project