Um israelita de origem russa resolveu um problema matemático que estava sem solução desde que foi lançado, há cerca de 40 anos.
.
.
.
ver artigo completo AQUI
Um israelita de origem russa resolveu um problema matemático que estava sem solução desde que foi lançado, há cerca de 40 anos.
.
.
.
ver artigo completo AQUI
Congratulations!
I ‘d like to know the solution – could you explain it, please?
Thank you very much!
Best regards,
Leslie de Oliveira Heringer
i don’t… but who knows a website where people can see the solution please post the link hehe
Links to arXiv/Links para o arXiv:
http://uk.arxiv.org/PS_cache/arxiv/pdf/0709/0709.0099v4.pdf
and/e
http://front.math.ucdavis.edu/0709.0099
“The road coloring problem
Authors: A. N. Trahtman
Categories: math.CO Combinatorics
Abstract: The synchronizing word of deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into deterministic finite automaton possessing a synchronizing word.
The road coloring problem is a problem of synchronizing coloring of directed finite strongly connected graph with constant outdegree of all its vertices if the greatest common divisor of lengths of all its cycles is one. The problem was posed by Adler, Goodwyn and Weiss over 30 years ago and evoked a noticeable interest among the specialists in theory of graphs, deterministic automata and symbolic dynamics. The problem is described even in “Wikipedia” – the popular Internet Encyclopedia. The positive solution of the road coloring problem is presented.
Owner: Avraham Trahtman N
Version 4: Fri, 21 Dec 2007 08:07:18 GMT”
obrigado pelo link da solução.
Thanks for the solution’s link.
[...] imagem aparece num post do lugar do conhecimento que comentei, aproveitando para divulgar o teor da notícia do post, que indicava este link para [...]
eu estou querendo as respostas das contas de graficos das funçoes…