In number theory and set theory, the minimum overlap problem is a problem proposed by Hungarian mathematician Paul Erdős in 1955. Let A = {ai} and B =...

mathematics – History and development of mathematics in Hungary Minimum overlap problem Probabilistic method – Nonconstructive method for mathematical...

sum of an odd prime number and an even semiprime. Minimum overlap problem of estimating the minimum possible maximum number of times a number appears...

the edge cover problem. Covering problems allow the covering primitives to overlap; the process of covering something with non-overlapping primitives is...

with a number of circles one less than a triangular number. The minimum overlap problem to estimate the limit of M(n). A conjecture that the ternary expansion...

every region of the container, where objects are allowed to overlap. In a bin packing problem, people are given: A container, usually a two- or three-dimensional...

Conversely, for any vertex v {\displaystyle v} of any minimum spanning tree, one can construct non-overlapping unit spheres centered at v {\displaystyle v} and...

related problems which are concerned with some other criterion, such as the following: The minimum pattern count problem: to find a minimum-pattern-count...

a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have...

is an example of a Kakeya needle set. The Kakeya needle problem asks whether there is a minimum area of a region D {\displaystyle D} in the plane, in which...

In signal processing, the overlap–add method is an efficient way to evaluate the discrete convolution of a very long signal x [ n ] {\displaystyle x[n]}...

independent set in an interval graph is just a set of non-overlapping intervals. The problem of finding maximum independent sets in interval graphs has...

empty and an "overlapping rectangles" test will produce a high number of false positives. One system that attempts to deal with this problem, particularly...

the minimal covering to not overlap). Hence, the minimum covering problem is identical to the polygon triangulation problem, which can be solved in time...

given large polygon, such that no two small rectangles overlap. Several variants of this problem have been studied. In this variant, there are multiple...

widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the weight of the minimum-weight edge...

Körner–Imre Csiszár–Marton theorems. The result of An.A. Muchnik on minimum overlap above is an important theoretical application showing that certain...

problem. If the solution to any problem can be formulated recursively using the solution to its sub-problems, and if its sub-problems are overlapping...

solutions to decision-making problems. Because of its emphasis on practical applications, operations research has overlapped with many other disciplines...

intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries...

induction that this is optimal at each step. Otherwise, provided the problem exhibits overlapping subproblems as well, divide-and-conquer methods or dynamic programming...

(1990) because it emphasizes prevention of overlap in the bounding boxes, which increasingly becomes a problem in high dimensions. In cases where nodes...

arbitrary number of input sequences, the problem is NP-hard. The closely related problem of finding a minimum-length string which is a superstring of a...

operations, such as by using simple regions, having simpler ways to test for overlap. A bounding volume for a set of objects is also a bounding volume for the...

rectangles, etc.), which do not overlap and whose union equals the polygon. A polygon partition problem is a problem of finding a partition which is minimal...

different minimum boxes for n points is O ( n 2 + ϵ ) . {\displaystyle O(n^{2+\epsilon }).} The existence of a local data structure for this problem is an...

phase of hidden surface removal, if two polygons have no overlapping extents or extreme minimum and maximum values in the x, y, and z directions, then they...

forces may be placed on edges as well as on nodes in order to avoid overlap or near-overlap in the final drawing. In drawings with curved edges such as circular...

feasible elements), it is also the global minimum, but a nonconvex problem may have more than one local minimum not all of which need be global minima....

merge–find set, is a data structure that stores a collection of disjoint (non-overlapping) sets. Equivalently, it stores a partition of a set into disjoint subsets...