2006年 09月 26日
Ten years since I began my mathematics
|
My homepage is renewed slightly
I maintained my HP a bit. please check the cover page.
http://babalabo.blogdns.com/labo/
it contains the following articles, though most of them are just an
excerpt from theory-edge/algorithm-forge.
1. An Infinitely Palindromic Square-Free Sequence
2. An Efficient Factoring Algorithm by Repunit Number Method
3. A Polynomial Time Solution for Plesnik's Problem by Irrigation Canal
Method
4. A Polynomial Time Algorithm for Matrix & Graph Isomorphism
5. The Final Solution for Kelly-Ulam Conjecture
6. Kelly-Ulam Conjecture and Graph Numbering
7. Strongly Intransitive Graphs and the Perfect Graph Conjecture
8. Universal Turing Machine with Active Graph
9. Ariadne100 Hamiltonian Circuit Experiment Program
10. Regarding the Solution of Hamiltonian Circuit Problem Using
Experimental Graphs or the Method of How to Control One's Fortune
Fermat mit seiner Muse
1. An Infinitely Palindromic Square-Free Sequence: our latest work.
I discovered an infinitely square free sequence named "Mathematical
Mozu Song", as well found a morphism for Rivest sequence. the origin
of the research was some consideration of perpetual checkmate status
of chess/shogi-game.
2. An Efficient Factoring Algorithm by Repunit Number Method: it was
a work around spring in 2005. the origin was my answer to a schoolgirl
saying that multiplication and division are essentially equivalent. to
confirm it myself I buried in the depth of the investigation on and on.
we established an extension of Euler's totient function independently,
which we call u-length function or Psi function.
3. A Polynomial Time Solution for Plesnik's Problem by Irrigation Canal
Method: Plesnik showed that Hamiltonian problem is NP-Complete
even if it is bounded to directed graphs of degree two. it is said to
be the ultimate Hamiltonian problem. we attacked the line and gained
pretty remarkable progress. we found that in this circumstance the
problem turns to a kind of Eulerian cycle problem, but may head towards
somewhat topological direction.
4. A Polynomial Time Algorithm for Matrix & Graph Isomorphism:
we extended Graph Isomorphism to Matrix Isomorphism in course of
nature. we tried a canonical graph numbering and eventually came up
with the concept of "critical state experiment", a kind of partitioning but
really an amazing method. in parallel we built an Isomorphism program
named ELSIE. (Narcissus/Narkissos is another thread of Isomorphism
experiment.)
5. The Final Solution for Kelly-Ulam Conjecture: a brief proof for Kelly-
Ulam Conjecture. the next article is the record of our failure for the
problem, and if you read the article, you would understand how K-U
problem is tough and subtle. however the final solution became in a
sense very simple one. it uses a huge number for canonical labeling.
6. Kelly-Ulam Conjecture and Graph Numbering: we actually failed
to prove vertex version K-U, but succeeded for edge version. this
work was done summer in 2002. we used here the name of Psi numbers
but this is quite different from the Psi function for factoring (No.2 article).
7. Strongly Intransitive Graphs and the Perfect Graph Conjecture: we
attacked transitive graphs. I forgot the origin for now. it was a terribly
steep mountain with ferocious blizzard. at the top of the hill we find a
flag Gallai planted. we barely put them into an article. we intended to
attack Berge's perfect graph conjecture from the perspective, but
beyond our reach as you know well.
8. Universal Turing Machine with Active Graph: this is the most
notorious trouble on me. I almost/actually kicked out from the list.
by good fortune Lasse interacted with me till the last. I designed an
Universal Turing Machine and reduced it to SAT in the similar way that
Cook used in his paper. thus I accept the theory and made an official
apology to the audience. after math: I considered that if Cook is a
pocket picker then I must be a holdup.
9. Ariadne100 Hamiltonian Circuit Experiment Program: Hamiltonian
problem is my best favorite problem. the base of Ariadne100 is graph
contracting and timing chart method. this program was publicly
delivered to some extent.
10. Regarding the Solution of Hamiltonian Circuit Problem using
Experimental Graphs or the Method of How to Control One's Fortune:
my first and incomplete article. I almost abandoned this paper, but
published it anyway. it is sure that this premature draft was circulated
in some range. once the name was put in a wiki-page next to the name
of Wiliam Rowan Hamilton. if you doubt it, check the URL, a remainder.
http://dictionary.laborlawtalk.com/Hamiltonian_path_problem
ten years have passed since I began mathematics. now I reached at
my 60 years. surely it is very hard to control one's fortune. but my
fortune is really a good friends. I greatly appreciate you all my virtual
colleagues here.
M...
mailto:babalabo@...
http://babalabo.blogdns.com/labo/
http://www.aya.or.jp/~babalabo/
http://www.geocities.com/babalabo/
http://tech.groups.yahoo.com/group/theory-edge/message/12425
I maintained my HP a bit. please check the cover page.
http://babalabo.blogdns.com/labo/
it contains the following articles, though most of them are just an
excerpt from theory-edge/algorithm-forge.
1. An Infinitely Palindromic Square-Free Sequence
2. An Efficient Factoring Algorithm by Repunit Number Method
3. A Polynomial Time Solution for Plesnik's Problem by Irrigation Canal
Method
4. A Polynomial Time Algorithm for Matrix & Graph Isomorphism
5. The Final Solution for Kelly-Ulam Conjecture
6. Kelly-Ulam Conjecture and Graph Numbering
7. Strongly Intransitive Graphs and the Perfect Graph Conjecture
8. Universal Turing Machine with Active Graph
9. Ariadne100 Hamiltonian Circuit Experiment Program
10. Regarding the Solution of Hamiltonian Circuit Problem Using
Experimental Graphs or the Method of How to Control One's Fortune
Fermat mit seiner Muse
1. An Infinitely Palindromic Square-Free Sequence: our latest work.
I discovered an infinitely square free sequence named "Mathematical
Mozu Song", as well found a morphism for Rivest sequence. the origin
of the research was some consideration of perpetual checkmate status
of chess/shogi-game.
2. An Efficient Factoring Algorithm by Repunit Number Method: it was
a work around spring in 2005. the origin was my answer to a schoolgirl
saying that multiplication and division are essentially equivalent. to
confirm it myself I buried in the depth of the investigation on and on.
we established an extension of Euler's totient function independently,
which we call u-length function or Psi function.
3. A Polynomial Time Solution for Plesnik's Problem by Irrigation Canal
Method: Plesnik showed that Hamiltonian problem is NP-Complete
even if it is bounded to directed graphs of degree two. it is said to
be the ultimate Hamiltonian problem. we attacked the line and gained
pretty remarkable progress. we found that in this circumstance the
problem turns to a kind of Eulerian cycle problem, but may head towards
somewhat topological direction.
4. A Polynomial Time Algorithm for Matrix & Graph Isomorphism:
we extended Graph Isomorphism to Matrix Isomorphism in course of
nature. we tried a canonical graph numbering and eventually came up
with the concept of "critical state experiment", a kind of partitioning but
really an amazing method. in parallel we built an Isomorphism program
named ELSIE. (Narcissus/Narkissos is another thread of Isomorphism
experiment.)
5. The Final Solution for Kelly-Ulam Conjecture: a brief proof for Kelly-
Ulam Conjecture. the next article is the record of our failure for the
problem, and if you read the article, you would understand how K-U
problem is tough and subtle. however the final solution became in a
sense very simple one. it uses a huge number for canonical labeling.
6. Kelly-Ulam Conjecture and Graph Numbering: we actually failed
to prove vertex version K-U, but succeeded for edge version. this
work was done summer in 2002. we used here the name of Psi numbers
but this is quite different from the Psi function for factoring (No.2 article).
7. Strongly Intransitive Graphs and the Perfect Graph Conjecture: we
attacked transitive graphs. I forgot the origin for now. it was a terribly
steep mountain with ferocious blizzard. at the top of the hill we find a
flag Gallai planted. we barely put them into an article. we intended to
attack Berge's perfect graph conjecture from the perspective, but
beyond our reach as you know well.
8. Universal Turing Machine with Active Graph: this is the most
notorious trouble on me. I almost/actually kicked out from the list.
by good fortune Lasse interacted with me till the last. I designed an
Universal Turing Machine and reduced it to SAT in the similar way that
Cook used in his paper. thus I accept the theory and made an official
apology to the audience. after math: I considered that if Cook is a
pocket picker then I must be a holdup.
9. Ariadne100 Hamiltonian Circuit Experiment Program: Hamiltonian
problem is my best favorite problem. the base of Ariadne100 is graph
contracting and timing chart method. this program was publicly
delivered to some extent.
10. Regarding the Solution of Hamiltonian Circuit Problem using
Experimental Graphs or the Method of How to Control One's Fortune:
my first and incomplete article. I almost abandoned this paper, but
published it anyway. it is sure that this premature draft was circulated
in some range. once the name was put in a wiki-page next to the name
of Wiliam Rowan Hamilton. if you doubt it, check the URL, a remainder.
http://dictionary.laborlawtalk.com/Hamiltonian_path_problem
ten years have passed since I began mathematics. now I reached at
my 60 years. surely it is very hard to control one's fortune. but my
fortune is really a good friends. I greatly appreciate you all my virtual
colleagues here.
M...
mailto:babalabo@...
http://babalabo.blogdns.com/labo/
http://www.aya.or.jp/~babalabo/
http://www.geocities.com/babalabo/
http://tech.groups.yahoo.com/group/theory-edge/message/12425
by exod-US
| 2006-09-26 12:02
| 我が命運の尽きる日まで