Re: A letter want to disprove my paper which submitted recently

On Jun 23, 11:12 am, Zhu Guohun <ccgh...@xxxxxxxxxxxxxxxxxxxx> wrote:
deepakc

Hello Zhu,

I am sorry for my above 2 posts.
Actually, I am not very good in the subject of MATRIX RANK.

The rank of binary matrix could be simplify obtaining by Echolon
method which is O(n^3), when I study the Hamiltonian cycle at
beginning, I had coding this function and implmenent by Java
( existence a little bug when meet zero line or zero column). From
June, 2006, I had tun to using Jama-1.0.2, thus give up improve the
coding.

And also there are several paper when I was in Tokyo and learning
from library had mention the complexity of rank of matrix, The
results is only O(n^3). but now I could only find one of its from
google

I.S. Dhillon, A new O(n^2) algorithm for the symmetric tridiagonal
eigenvalue/- eigenvector problem, PhD. thesis, University of
California, Berkeley, 1997.http://citeseer.ist.psu.edu/new97algorithm.html



Actually, I completed my Bachelor Degree in 2003 in the subject of
Electrical & Electronic Engineering, so my background in Mathematics
is not very strong.

So, please tell us, have u submitted ur paper to any Journal/
Conference ?

I could understand your question. I had register and prepare to
discuss my draft in the "The First Announcement International
Symposium on Graph Theory and Combinatorial Algorithms " (http://www.amt.ac.cn/tulun/enews.htm).

The reseaon select this Symposium is very cheap for me. If no one
could disprove my results after this symposium or from comp.theory,
I will submit it to a Journal, but I don't know which Journal is very
nice for this kind of paper.

I believe my results is correctly, since I had another different
method to prove HC in polynomial, even including others NPC problem
(proof without transform from HC).

Thank you for your giving me strength on this problem.

Sincerely,
Zhu

If you have indeed proved P = NP then I recommend one of the
following:

Transform your solution to a polynomial-time prime-factorizing
algorithm and use it to crack every RSA crypto on the planet.

Translate to a full TSP instance, patent it and sell your algorithm to
every logistics company in the world, you will be a billionaire in an
instant!

Lots of money for less work: Report your findings to the Clay
Mathematics institute and receive a million dollar cash prize and
instant fame. See http://www.claymath.org

A suitable journal for such a proof is certainly JACM (Journal of the
Association for Computing Machines). Note that people will likely be
very, very skeptical of such a claim, since most accept the conjecture
that P /= NP

Be prepared for more letters like the one you received earlier,
possibly with much harsher wordings.

Gambate!

Best Regards,
Raphael Korsoski

.

Relevant Pages

  • Re: A letter want to disprove my paper which submitted recently
    ... The rank of binary matrix could be simplify obtaining by Echolon ... so my background in Mathematics ... Symposium on Graph Theory and Combinatorial Algorithms ". ... algorithm and use it to crack every RSA crypto on the planet. ...
    (comp.theory)
  • Re: More on Lorenz contraction
    ... The Lorenz transform of an E field with no B field can result in a ... Maxwell's equations valid in all frames). ... Just transform the E field of the electrons from their ... rank 2 tensors when the class is for freshmen...) ...
    (sci.physics.relativity)
  • Re: A letter want to disprove my paper which submitted recently
    ... The rank of binary matrix could be simplify obtaining by Echolon ... Electrical & Electronic Engineering, ... Symposium on Graph Theory and Combinatorial Algorithms " (http:// ... The reseaon select this Symposium is very cheap for me. ...
    (comp.theory)
  • Re: Fulltext query with custom rank
    ... return the top 10 results as calculated by your algorithm? ... I've created my own CLR function and use it instead of FTS rank. ... predominant factor for the ranking. ... still hoping that someone has a clue on how to possibly manipulate FT ...
    (microsoft.public.sqlserver.fulltext)
  • Re: Algorithm/Component for Timetable arrangement
    ... It has set of Shifts to fill with workers ... At any given state of the timetable the application can rank the ... suggested solution, and give indication on how far is it from the optimal ... CSP is the most suitable algorithm for this kind of problem. ...
    (borland.public.delphi.thirdpartytools.general)