Table of Contents
32 relations: Analysis of algorithms, Binomial coefficient, Binomial theorem, Canadian Journal of Mathematics, Combinatorial species, Derangement, Determinant, Divisor function, Endomorphism, Euler–Maclaurin formula, Falling and rising factorials, Formal power series, Generating function, Golomb–Dickman constant, Harmonic number, Inclusion–exclusion principle, Involution (mathematics), London Mathematical Society, Möbius inversion formula, Order (group theory), Parity of a permutation, Parity of zero, Probability-generating function, Quickselect, Quicksort, Random permutation, Rencontres numbers, Stirling numbers of the first kind, Stirling numbers of the second kind, Symbolic method (combinatorics), Telephone number (mathematics), William Lowell Putnam Mathematical Competition.
Analysis of algorithms
In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them.
See Random permutation statistics and Analysis of algorithms
Binomial coefficient
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Random permutation statistics and binomial coefficient are combinatorics.
See Random permutation statistics and Binomial coefficient
Binomial theorem
In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial.
See Random permutation statistics and Binomial theorem
Canadian Journal of Mathematics
The Canadian Journal of Mathematics (Journal canadien de mathématiques) is a bimonthly mathematics journal published by the Canadian Mathematical Society.
See Random permutation statistics and Canadian Journal of Mathematics
Combinatorial species
In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for deriving the generating functions of discrete structures, which allows one to not merely count these structures but give bijective proofs involving them.
See Random permutation statistics and Combinatorial species
Derangement
In combinatorial mathematics, a derangement is a permutation of the elements of a set in which no element appears in its original position.
See Random permutation statistics and Derangement
Determinant
In mathematics, the determinant is a scalar-valued function of the entries of a square matrix.
See Random permutation statistics and Determinant
Divisor function
In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer.
See Random permutation statistics and Divisor function
Endomorphism
In mathematics, an endomorphism is a morphism from a mathematical object to itself.
See Random permutation statistics and Endomorphism
Euler–Maclaurin formula
In mathematics, the Euler–Maclaurin formula is a formula for the difference between an integral and a closely related sum.
See Random permutation statistics and Euler–Maclaurin formula
Falling and rising factorials
In mathematics, the falling factorial (sometimes called the descending factorial, falling sequential product, or lower factorial) is defined as the polynomial \begin (x)_n.
See Random permutation statistics and Falling and rising factorials
Formal power series
In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series (addition, subtraction, multiplication, division, partial sums, etc.). A formal power series is a special kind of formal series, of the form where the a_n, called coefficients, are numbers or, more generally, elements of some ring, and the x^n are formal powers of the symbol x that is called an indeterminate or, commonly, a variable.
See Random permutation statistics and Formal power series
Generating function
In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series.
See Random permutation statistics and Generating function
Golomb–Dickman constant
In mathematics, the Golomb–Dickman constant, named after Solomon W. Golomb and Karl Dickman, arises in the theory of random permutations and in number theory.
See Random permutation statistics and Golomb–Dickman constant
Harmonic number
In mathematics, the -th harmonic number is the sum of the reciprocals of the first natural numbers: H_n.
See Random permutation statistics and Harmonic number
Inclusion–exclusion principle
In combinatorics, a branch of mathematics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as where A and B are two finite sets and |S | indicates the cardinality of a set S (which may be considered as the number of elements of the set, if the set is finite).
See Random permutation statistics and Inclusion–exclusion principle
Involution (mathematics)
In mathematics, an involution, involutory function, or self-inverse function is a function that is its own inverse, for all in the domain of.
See Random permutation statistics and Involution (mathematics)
London Mathematical Society
The London Mathematical Society (LMS) is one of the United Kingdom's learned societies for mathematics (the others being the Royal Statistical Society (RSS), the Institute of Mathematics and its Applications (IMA), the Edinburgh Mathematical Society and the Operational Research Society (ORS).
See Random permutation statistics and London Mathematical Society
Möbius inversion formula
In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors.
See Random permutation statistics and Möbius inversion formula
Order (group theory)
In mathematics, the order of a finite group is the number of its elements.
See Random permutation statistics and Order (group theory)
Parity of a permutation
In mathematics, when X is a finite set with at least two elements, the permutations of X (i.e. the bijective functions from X to X) fall into two classes of equal size: the even permutations and the odd permutations.
See Random permutation statistics and Parity of a permutation
Parity of zero
In mathematics, zero is an even number.
See Random permutation statistics and Parity of zero
Probability-generating function
In probability theory, the probability generating function of a discrete random variable is a power series representation (the generating function) of the probability mass function of the random variable.
See Random permutation statistics and Probability-generating function
Quickselect
In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list, also known as the kth order statistic.
See Random permutation statistics and Quickselect
Quicksort
Quicksort is an efficient, general-purpose sorting algorithm.
See Random permutation statistics and Quicksort
Random permutation
A random permutation is a random ordering of a set of objects, that is, a permutation-valued random variable.
See Random permutation statistics and Random permutation
Rencontres numbers
In combinatorics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set with specified numbers of fixed points: in other words, partial derangements.
See Random permutation statistics and Rencontres numbers
Stirling numbers of the first kind
In mathematics, especially in combinatorics, Stirling numbers of the first kind arise in the study of permutations.
See Random permutation statistics and Stirling numbers of the first kind
Stirling numbers of the second kind
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of n objects into k non-empty subsets and is denoted by S(n,k) or \textstyle \left\.
See Random permutation statistics and Stirling numbers of the second kind
Symbolic method (combinatorics)
In combinatorics, the symbolic method is a technique for counting combinatorial objects. Random permutation statistics and symbolic method (combinatorics) are combinatorics.
See Random permutation statistics and Symbolic method (combinatorics)
Telephone number (mathematics)
In mathematics, the telephone numbers or the involution numbers form a sequence of integers that count the ways people can be connected by person-to-person telephone calls.
See Random permutation statistics and Telephone number (mathematics)
William Lowell Putnam Mathematical Competition
The William Lowell Putnam Mathematical Competition, often abbreviated to Putnam Competition, is an annual mathematics competition for undergraduate college students enrolled at institutions of higher learning in the United States and Canada (regardless of the students' nationalities).
See Random permutation statistics and William Lowell Putnam Mathematical Competition
References
Also known as Permutation statistic, Permutation statistics, Random permutation statistic.