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 ...
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.
[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.
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 ...
The inscribed square problem, also known as the square peg problem or the Toeplitz' conjecture, is an unsolved question in geometry: Does every plane simple closed curve contain all four vertices of some square? This is true if the curve is convex or piecewise smooth and in other special cases. The problem was proposed by Otto Toeplitz in 1911. [1]
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.
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 ...
The following is a list of named topologies or topological spaces, many of which are counterexamples in topology and related branches of mathematics. This is not a list of properties that a topology or topological space might possess; for that, see List of general topology topics and Topological property.