Priority inversionIn computer science, priority inversion is a scenario in scheduling in which a high priority task is indirectly superseded by a lower priority task effectively inverting the assigned priorities of the tasks. This violates the priority model that high-priority tasks can only be prevented from running by higher-priority tasks. Inversion occurs when there is a resource contention with a low-priority task that is then preempted by a medium-priority task.
Principal ideal theoremIn mathematics, the principal ideal theorem of class field theory, a branch of algebraic number theory, says that extending ideals gives a mapping on the class group of an algebraic number field to the class group of its Hilbert class field, which sends all ideal classes to the class of a principal ideal. The phenomenon has also been called principalization, or sometimes capitulation. For any algebraic number field K and any ideal I of the ring of integers of K, if L is the Hilbert class field of K, then is a principal ideal αOL, for OL the ring of integers of L and some element α in it.
Unique games conjectureIn computational complexity theory, the unique games conjecture (often referred to as UGC) is a conjecture made by Subhash Khot in 2002. The conjecture postulates that the problem of determining the approximate value of a certain type of game, known as a unique game, has NP-hard computational complexity. It has broad applications in the theory of hardness of approximation. If the unique games conjecture is true and P ≠ NP, then for many important problems it is not only impossible to get an exact solution in polynomial time (as postulated by the P versus NP problem), but also impossible to get a good polynomial-time approximation.
Division by zeroIn mathematics, division by zero is division where the divisor (denominator) is zero. Such a division can be formally expressed as , where a is the dividend (numerator). In ordinary arithmetic, the expression has no meaning, as there is no number that, when multiplied by 0, gives a (assuming ); thus, division by zero is undefined (a type of singularity). Since any number multiplied by zero is zero, the expression is also undefined; when it is the form of a limit, it is an indeterminate form.
Job schedulerA job scheduler is a computer application for controlling unattended background program execution of jobs. This is commonly called batch scheduling, as execution of non-interactive jobs is often called batch processing, though traditional job and batch are distinguished and contrasted; see that page for details. Other synonyms include batch system, distributed resource management system (DRMS), distributed resource manager (DRM), and, commonly today, workload automation (WLA). The data structure of jobs to run is known as the job queue.
J-invariantIn mathematics, Felix Klein's j-invariant or j function, regarded as a function of a complex variable τ, is a modular function of weight zero for SL(2, Z) defined on the upper half-plane of complex numbers. It is the unique such function which is holomorphic away from a simple pole at the cusp such that Rational functions of j are modular, and in fact give all modular functions. Classically, the j-invariant was studied as a parameterization of elliptic curves over C, but it also has surprising connections to the symmetries of the Monster group (this connection is referred to as monstrous moonshine).
Pollard's rho algorithmPollard's rho algorithm is an algorithm for integer factorization. It was invented by John Pollard in 1975. It uses only a small amount of space, and its expected running time is proportional to the square root of the smallest prime factor of the composite number being factorized. The algorithm is used to factorize a number , where is a non-trivial factor. A polynomial modulo , called (e.g., ), is used to generate a pseudorandom sequence. It is important to note that must be a polynomial.
DiophantusDiophantus of Alexandria (born AD 200-214; died AD 284-298) was a Greek mathematician, who was the author of a series of books called Arithmetica, many of which are now lost. His texts deal with solving algebraic equations. Diophantine equations, Diophantine geometry, and Diophantine approximations are subareas of Number theory that are named after him. Diophantus coined the term παρισότης (parisotes) to refer to an approximate equality.
Field normIn mathematics, the (field) norm is a particular mapping defined in field theory, which maps elements of a larger field into a subfield. Let K be a field and L a finite extension (and hence an algebraic extension) of K. The field L is then a finite dimensional vector space over K. Multiplication by α, an element of L, is a K-linear transformation of this vector space into itself. The norm, NL/K(α), is defined as the determinant of this linear transformation.
P-adic valuationIn number theory, the p-adic valuation or p-adic order of an integer n is the exponent of the highest power of the prime number p that divides n. It is denoted . Equivalently, is the exponent to which appears in the prime factorization of . The p-adic valuation is a valuation and gives rise to an analogue of the usual absolute value. Whereas the completion of the rational numbers with respect to the usual absolute value results in the real numbers , the completion of the rational numbers with respect to the -adic absolute value results in the p-adic numbers .
