Search results
Results from the WOW.Com Content Network
Download as PDF; Printable version; ... List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural ...
[2] [3] An important open mathematics problem solved in the early 21st century is the Poincaré conjecture. Open problems exist in all scientific fields. For example, one of the most important open problems in biochemistry is the protein structure prediction problem [4] [5] – how to predict a protein's structure from its sequence.
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
13. Impossibility of the solution of the general equation of 7th degree by means of functions of only two arguments. 14. Proof of the finiteness of certain complete systems of functions. 15. Rigorous foundation of Schubert's enumerative calculus. 16. Problem of the topology of algebraic curves and surfaces. 17. Expression of definite forms by ...
First edition. Open Problems in Mathematics is a book, edited by John Forbes Nash Jr. and Michael Th. Rassias, published in 2016 by Springer (ISBN 978-3-319-32160-8).The book consists of seventeen expository articles, written by outstanding researchers, on some of the central open problems in the field of mathematics.
In point-set topology, Kuratowski's closure-complement problem asks for the largest number of distinct sets obtainable by repeatedly applying the set operations of closure and complement to a given starting subset of a topological space. The answer is 14. This result was first published by Kazimierz Kuratowski in 1922. [1]
The topological derivative is, conceptually, a derivative of a shape functional with respect to infinitesimal changes in its topology, such as adding an infinitesimal hole or crack. When used in higher dimensions than one, the term topological gradient is also used to name the first-order term of the topological asymptotic expansion, dealing ...
The question is whether or not, for all problems for which an algorithm can verify a given solution quickly (that is, in polynomial time), an algorithm can also find that solution quickly. Since the former describes the class of problems termed NP, while the latter describes P, the question is equivalent to asking whether all problems in NP are ...