- enumeration function
- мат. перечисляющая функция
Большой англо-русский и русско-английский словарь. 2001.
enumeration function
Смотреть что такое "enumeration function" в других словарях:
Function Analysis System Technic — Function Analysis System Technique Pour une définition du mot « fast », voir l’article fast du Wiktionnaire. Un diagramme FAST (Functional Analysis System Technic) présente une traduction rigoureuse de chacune des fonctions de service… … Wikipédia en Français
Enumeration — In mathematics and theoretical computer science, the broadest and most abstract definition of an enumeration of a set is an exact listing of all of its elements (perhaps with repetition). The restrictions imposed on the type of list used depend… … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Pólya enumeration theorem — Enumeration theorem redirects here. For its labelled counterpart, see Labelled enumeration theorem. The Pólya enumeration theorem (PET), also known as Redfield–Pólya s Theorem, is a theorem in combinatorics, generalizing Burnside s lemma about… … Wikipedia
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is … Wikipedia
Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Labelled enumeration theorem — The labelled enumeration theorem is the counterpart of the Pólya enumeration theorem for the labelled case, where we have a set of labelled objects given by an exponential generating function (EGF) g ( z ) which are being distributed into n slots … Wikipedia
Surjective function — Onto redirects here. For other uses, see wikt:onto. A surjective function from domain X to codomain Y. The function is surjective because every point in the codomain is the value of f(x) for at least one point x in the domain. In mathematics, a… … Wikipedia
Lambert W function — The graph of W(x) for W > −4 and x < 6. The upper branch with W ≥ −1 is the function W0 (principal branch), the lower branch with W ≤ −1 is the function W−1. In mathematics, the Lambert W function, also called the Omega function or product… … Wikipedia
