Posted in A must read, About math, Algorithms, Applications, Books to read, Graph theory, philosophy by: admin

No Comments

20 Mar

The only known serious approach to the N versus NP problem today is due to Ketan Mulmuley from t he University of Chicago. He has shown that solving some difficult problems in a mathematical field called algebraic geometry (considerably more complex than high school algebra and geometry) may lead to a proof that N ≠ NP. But resolving these algebraic geometry problems may require mathematical techniques far beyond what we have available today.

Posted in A must read, Algorithms, Books to read, Combinatorics, Graph theory by: admin

Comments Off on In Pursuit of the Traveling Salesman

25 Dec

Tweet It's a rare pleasure to get a good book ahead of its planned publishing date. In Pursuit of the Traveling Salesman by William Cook that was expected at the beginning of 2012, was delivered yesterday right to my door. My first impression is that this is the sort of a book that are read […]

Posted in Beautiful math, Books to read, Graph theory, Homeschooling by: admin

No Comments

31 Oct

Tweet Many book authors end their book Introduction expressing the hope that readers will enjoy reading the book as much as the author(s) enjoyed writing it. Persi Diaconis and Ron Graham do not. Nonetheless, their book - Magical Mathematics - oozes their enjoyment at writing it. The authors are master storytellers. Movingly, Martin Gardner wrote […]

Posted in Early math, Graph theory, Homeschooling, Puzzles, Simple math by: admin

No Comments

04 Jul

TweetWhat is the setup? The setup for this activity is the graph with 8 nodes joined as shown: What is the task? The task is to place the integers 1 through 8 onto the nodes of the graph so that no two successive integers are "graph neighbors", i.e., joined by an edge. What to observe? […]