Search results
Results From The WOW.Com Content Network
[11] The term pseudomathematics has been applied to attempts in mental and social sciences to quantify the effects of what is typically considered to be qualitative. [ 12 ]
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.
According to Jensen & Toft (1995), the problem was first formulated by Nelson in 1950, and first published by Gardner (1960). Hadwiger (1945) had earlier published a related result, showing that any cover of the plane by five congruent closed sets contains a unit distance in one of the sets, and he also mentioned the problem in a later paper (Hadwiger 1961).
Minimum maximal independent set a.k.a. minimum independent dominating set [4] NP-complete special cases include the minimum maximal matching problem, [ 3 ] : GT10 which is essentially equal to the edge dominating set problem (see above).
[9] [10] Finding the capacity of an information-stable finite state machine channel. [11] In network coding, determining whether a network is solvable. [12] [13] Determining whether a player has a winning strategy in a game of Magic: The Gathering. [14] Planning in a partially observable Markov decision process.
In mathematics, Hilbert's fourth problem in the 1900 list of Hilbert's problems is a foundational question in geometry.In one statement derived from the original, it was to find — up to an isomorphism — all geometries that have an axiomatic system of the classical geometry (Euclidean, hyperbolic and elliptic), with those axioms of congruence that involve the concept of the angle dropped ...
In computational geometry, the largest empty rectangle problem, [2] maximal empty rectangle problem [3] or maximum empty rectangle problem, [4] is the problem of finding a rectangle of maximal size to be placed among obstacles in the plane. There are a number of variants of the problem, depending on the particularities of this generic ...
An arrangement of nine points (related to the Pappus configuration) forming ten 3-point lines.. In discrete geometry, the original orchard-planting problem (or the tree-planting problem) asks for the maximum number of 3-point lines attainable by a configuration of a specific number of points in the plane.