plural of Sylow theorem

(mathematics) Any of a collection of theorems of finite group theory that give detailed information about the number of subgroups of fixed order that a given finite group contains.

(mathematics) A statement in algebraic geometry concerning the number of common zeros of n polynomials in n indeterminates. In its original form, the theorem states that in general the number of common zeros equals the product of the degrees of the polynomials.

(number theory) A theorem stating that, given a fixed base b, the set of numbers that are the sum of a prime and a positive integer power of b has a positive lower asymptotic density.

A theorem stating that, for a thermodynamic system exchanging heat with external reservoirs and undergoing a thermodynamic cycle, ∮(𝛿Q)/(T_surr)≤0,, where 𝛿Q is the infinitesimal amount of heat absorbed by the system from the reservoir, and T_surr is the temperature of the external reservoir (surroundings) at a particular instant in time.

(physics) A theorem that relates the time derivative of the expectation values of the position and momentum operators x and p to the expectation value of the force F=-V'(x) on a massive particle moving in a scalar potential V(x).

(mathematics) In additive combinatorics, a central result that indicates the approximate structure of sets whose sumset is small. It roughly states that if |A+A|/|A| is small, then A can be contained in a small generalized arithmetic progression.

Abbreviation of Kochen-Specker theorem.

(mathematics) A formula for the exponent of the highest power of a prime number that divides a given binomial coefficient.

(game theory) A theorem about finite two-person games of perfect information in which the players move alternately and chance does not affect the decision-making process. It states that if the game cannot end in a draw, then one of the two players must have a winning strategy, i.e. force a win.