列挙、数え上げること

関: enumerate

WordNet

a numbered list (同)numbering
specify individually; "She enumerated the many obstacles she had encountered"; "The doctor recited the list of possible side effects of the drug" (同)recite, itemize, itemise

PrepTutorEJDIC

〈U〉数え上げること;列挙 / 〈C〉目録,表(list)
…‘を'列挙する;…‘を'数え上げる

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2015/09/04 22:06:24」(JST)

wiki en

[Wiki en表示]

An enumeration is a complete, ordered listing of all the items in a collection. The term is commonly used in mathematics and theoretical computer science (as well as applied computer science) to refer to a listing of all of the elements of a set. In statistics the term categorical variable is used rather than enumeration. The precise requirements for an enumeration (for example, whether the set must be finite, or whether the list is allowed to contain repetitions) depend on the branch of mathematics and the context one is working in.

Some sets can be enumerated by means of a natural ordering (such as 1, 2, 3, 4, ... for the set of positive integers), but in other cases it may be necessary to impose a (perhaps arbitrary) ordering. In some contexts, such as enumerative combinatorics, the term enumeration is used more in the sense of counting – with emphasis on determination of the number of elements that a set contains, rather than the production of an explicit listing of those elements.

1 Enumeration in combinatorics
2 Enumeration in set theory
- 2.1 Enumeration as listing
- 2.2 Enumeration in countable vs. uncountable context
  - 2.2.1 Examples
  - 2.2.2 Properties
- 2.3 Ordinal enumeration
- 2.4 Enumeration as comparison of cardinalities
3 Enumeration in computability theory
4 See also
5 References
6 External links

Enumeration in combinatorics

In combinatorics, enumeration means counting, i.e., determining the exact number of elements of finite sets, usually grouped into infinite families, such as the family of sets each consisting of all permutations of some finite set. There are flourishing subareas in many branches of mathematics concerned with enumerating in this sense objects of special kinds. For instance, in partition enumeration and graph enumeration the objective is to count partitions or graphs that meet certain conditions.

Enumeration in set theory

In set theory, the notion of enumeration has a broader sense, and does not require the set being enumerated to be finite.

Enumeration as listing

When an enumeration is used in an ordered list context, we impose some sort of ordering structure requirement on the index set. While we can make the requirements on the ordering quite lax in order to allow for great generality, the most natural and common prerequisite is that the index set be well-ordered. According to this characterization, an ordered enumeration is defined to be a surjection (a many-to-one relationship) with a well-ordered domain. This definition is natural in the sense that a given well-ordering on the index set provides a unique way to list the next element given a partial enumeration.

Enumeration in countable vs. uncountable context

The most common use of enumeration in set theory occurs in the context where infinite sets are separated into those that are countable and those that are not. In this case, an enumeration is merely an enumeration with domain ω, the ordinal of the natural numbers. This definition can also be stated as follows:

As a surjective mapping from (the natural numbers) to S (i.e., every element of S is the image of at least one natural number). This definition is especially suitable to questions of computability and elementary set theory.

We may also define it differently when working with finite sets. In this case an enumeration may be defined as follows:

As a bijective mapping from S to an initial segment of the natural numbers. This definition is especially suitable to combinatorial questions and finite sets; then the initial segment is {1,2,...,n} for some n which is the cardinality of S.

In the first definition it varies whether the mapping is also required to be injective (i.e., every element of S is the image of exactly one natural number), and/or allowed to be partial (i.e., the mapping is defined only for some natural numbers). In some applications (especially those concerned with computability of the set S), these differences are of little importance, because one is concerned only with the mere existence of some enumeration, and an enumeration according to a liberal definition will generally imply that enumerations satisfying stricter requirements also exist.

Enumeration of finite sets obviously requires that either non-injectivity or partiality is accepted, and in contexts where finite sets may appear one or both of these are inevitably present.

Examples

The natural numbers are enumerable by the function f(x) = x. In this case is simply the identity function.
, the set of integers is enumerable by

is a bijection since every natural number corresponds to exactly one integer. The following table gives the first few values of this enumeration:

x	0	1	2	3	4	5	6	7	8
ƒ(x)	0	−1	1	−2	2	−3	3	−4	4

All (non empty) finite sets are enumerable. Let S be a finite set with n > 0 elements and let K = {1,2,...,n}. Select any element s in S and assign ƒ(n) = s. Now set S' = S − {s} (where − denotes set difference). Select any element s' ∈ S' and assign ƒ(n − 1) = s' . Continue this process until all elements of the set have been assigned a natural number. Then is an enumeration of S.

The real numbers have no countable enumeration as proved by Cantor's diagonal argument and Cantor's first uncountability proof.

Properties

There exists an enumeration for a set (in this sense) if and only if the set is countable.

If a set is enumerable it will have an uncountable infinity of different enumerations, except in the degenerate cases of the empty set or (depending on the precise definition) sets with one element. However, if one requires enumerations to be injective and allows only a limited form of partiality such that if ƒ(n) is defined then ƒ(m) must be defined for all m < n, then a finite set of N elements has exactly N! enumerations.

An enumeration e of a set S with domain induces a well-order ≤ on that set defined by s ≤ t if and only if min e⁻¹(s) ≤ min e⁻¹(t). Although the order may have little to do with the underlying set, it is useful when some order of the set is necessary.

Ordinal enumeration

In set theory, there is a more general notion of an enumeration than the characterization requiring the domain of the listing function to be an initial segment of the Natural numbers where the domain of the enumerating function can assume any ordinal. Under this definition, an enumeration of a set S is any surjection from an ordinal α onto S. The more restrictive version of enumeration mentioned before is the special case where α is a finite ordinal or the first limit ordinal ω. This more generalized version extends the aforementioned definition to encompass transfinite listings.

Under this definition, the first uncountable ordinal can be enumerated by the identity function on so that these two notions do not coincide. More generally, it is a theorem of ZF that any well-ordered set can be enumerated under this characterization so that it coincides up to relabeling with the generalized listing enumeration. If one also assumes the Axiom of Choice, then all sets can be enumerated so that it coincides up to relabeling with the most general form of enumerations.

Since set theorists work with infinite sets of arbitrarily large cardinalities, the default definition among this group of mathematicians of an enumeration of a set tends to be any arbitrary α-sequence exactly listing all of its elements. Indeed, in Jech's book, which is a common reference for set theorists, an enumeration is defined to be exactly this. Therefore, in order to avoid ambiguity, one may use the term finitely enumerable or denumerable to denote one of the corresponding types of distinguished countable enumerations.

Enumeration as comparison of cardinalities

Formally, the most inclusive definition of an enumeration of a set S is any surjection from an arbitrary index set I onto S. In this broad context, every set S can be trivially enumerated by the identity function from S onto itself. If one does not assume the axiom of choice or one of its variants, S need not have any well-ordering. Even if one does assume the axiom of choice, S need not have any natural well-ordering.

This general definition therefore lends itself to a counting notion where we are interested in "how many" rather than "in what order." In practice, this broad meaning of enumeration is often used to compare the relative sizes or cardinalities of different sets. If one works in Zermelo-Fraenkel set theory without the axiom of choice, one may want to impose the additional restriction that an enumeration must also be injective (without repetition) since in this theory, the existence of a surjection from I onto S need not imply the existence of an injection from S into I.

Enumeration in computability theory

In computability theory one often considers countable enumerations with the added requirement that the mapping from (set of all natural numbers) to the enumerated set must be computable. The set being enumerated is then called recursively enumerable (or computably enumerable in more contemporary language), referring to the use of recursion theory in formalizations of what it means for the map to be computable.

In this sense, a subset of the natural numbers is computably enumerable if it is the range of a computable function. In this context, enumerable may be used to mean computably enumerable. However, these definitions characterize distinct classes since there are uncountably many subsets of the natural numbers that can be enumerated by an arbitrary function with domain ω and only countably many computable functions. A specific example of a set with an enumeration but not a computable enumeration is the complement of the halting set.

Furthermore, this characterization illustrates a place where the ordering of the listing is important. There exists a computable enumeration of the halting set, but not one that lists the elements in an increasing ordering. If there were one, then the halting set would be decidable, which is provably false. In general, being recursively enumerable is a weaker condition than being a decidable set.

References

Jech, Thomas (2002). Set theory, third millennium edition (revised and expanded). Springer. ISBN 3-540-44085-2.

External links

The dictionary definition of enumeration at Wiktionary

UpToDate Contents

全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.

1. 自動血液分析装置 automated hematology instrumentation
2. 小児における関節穿刺または注射：適応、手技、および合併症 joint aspiration or injection in children indications technique and complications
3. 内皮：プライマー the endothelium a primer
4. HER2陽性早期乳癌に対する補助化学療法 adjuvant medical therapy for her2 positive early stage breast cancer
5. 濾胞性リンパ腫の臨床症状、病理学的特徴、診断、および予後 clinical manifestations pathologic features diagnosis and prognosis of follicular lymphoma

English Journal

In-situ fluorescent immunomagnetic multiplex detection of foodborne pathogens in very low numbers.

Cho IH1, Mauer L2, Irudayaraj J3.Author information 1Bindley Bioscience and Birck Nanotechnology Center, Department of Agricultural & Biological Engineering, Purdue University, West Lafayette, IN 47907, United States.2Department of Food Science, Purdue University, West Lafayette, IN 47907, United States.3Bindley Bioscience and Birck Nanotechnology Center, Department of Agricultural & Biological Engineering, Purdue University, West Lafayette, IN 47907, United States; Department of Food Science, Purdue University, West Lafayette, IN 47907, United States. Electronic address: josephi@purdue.edu.AbstractConsumption of foods contaminated with pathogenic bacteria is a major public health concern. Foods contain microorganisms, the overwhelming majority of which are nonpathogenic, some are responsible for food spoilage, and some cause serious illness leading to death or a variety of diseases in humans. The key challenge in food safety is to rapidly screen foods to determine the presence of pathogens so that appropriate intervention protocols can be pursued. A simple fluorometric immunological method in combination with a magnetic concentration step was developed for rapid detection of target bacteria with high sensitivity and specificity in less than 2h without enumeration. The method constitutes performing an in-situ immunoassay on a magnetic bead through the formation of a sandwich complex of the target bacteria and the probe (detection antibody-denatured BSA labelled with fluorophores) followed by the release of fluorophores by means of enzymatic digestion with proteinase K. The limit of detection (LOD) was <5CFU/mL of the tested pathogens (Escherichia coli O157:H7, Salmonella typhimurium, and Listeria monocytogenes) in buffer. When the pathogens were inoculated in foods (spinach, chicken, and milk), the LOD was under 5CFU/mL for E. coli O157:H7, S. typhimurium and L. monocytogenes. Furthermore, the method was highly specific in detecting the target pathogens in a multiplex format. The developed in-situ fluorescent immunomagnetic sensor approach offers distinct advantages because it is rapid, highly sensitive, and easy to use and could therefore be potentially used as a pathogen screening tool.
Biosensors & bioelectronics.Biosens Bioelectron.2014 Jul 15;57:143-8. doi: 10.1016/j.bios.2014.02.012. Epub 2014 Feb 19.
Consumption of foods contaminated with pathogenic bacteria is a major public health concern. Foods contain microorganisms, the overwhelming majority of which are nonpathogenic, some are responsible for food spoilage, and some cause serious illness leading to death or a variety of diseases in humans.
PMID 24583684

Development of a selective culture medium for bifidobacteria, Raffinose-Propionate Lithium Mupirocin (RP-MUP) and assessment of its usage with Petrifilm™ Aerobic Count plates.

Miranda RO1, de Carvalho AF2, Nero LA3.Author information 1Departamento de Veterinária, Universidade Federal de Viçosa, Campus UFV, 36570 000 Viçosa, MG, Brazil.2Departamento de Tecnologia de Alimentos, Universidade Federal de Viçosa, Campus UFV, Viçosa, MG 36570 000, Brazil.3Departamento de Veterinária, Universidade Federal de Viçosa, Campus UFV, 36570 000 Viçosa, MG, Brazil. Electronic address: nero@ufv.br.AbstractThis study aimed to develop a selective culture media to enumerate bifidobacteria in fermented milk and to assess this medium when used with Petrifilm™ AC plates. For this purpose, Bifidobacterium spp., Lactobacillus spp. and Streptococcus thermophilus strains were tested to verify their fermentation patterns for different carbohydrates. All bifidobacteria strains were able to use raffinose. Based on these characteristic, a selective culture medium was proposed (Raffinose-Propionate Lithium Mupirocin, RP-MUP), used with Petrifilm™ AC plates, and was used to enumerate bifidobacteria in fermented milk. RP-MUP performance was assessed by comparing the results with this medium to reference protocols and culture media for bifidobacteria enumeration. RP-MUP, whether used or not with Petrifilm™ AC, presented similar performance to TOS-MUP (ISO 29981), with no significant differences between the mean bifidobacteria counts (p < 0.05) and with high correlation indices (r = 0.99, p < 0.05). As an advantage, reliable results were obtained after just 48 h of incubation when RP-MUP was used with Petrifilm™ AC, instead of the 72 h described in the ISO 29981 protocol.
Food microbiology.Food Microbiol.2014 May;39:96-102. doi: 10.1016/j.fm.2013.11.010. Epub 2013 Nov 26.
This study aimed to develop a selective culture media to enumerate bifidobacteria in fermented milk and to assess this medium when used with Petrifilm™ AC plates. For this purpose, Bifidobacterium spp., Lactobacillus spp. and Streptococcus thermophilus strains were tested to verify their fermentat
PMID 24387858

Development of an alternative culture medium for the selective enumeration of Lactobacillus casei in fermented milk.

Colombo M1, de Oliveira AE1, de Carvalho AF2, Nero LA3.Author information 1Departamento de Veterinária, Universidade Federal de Viçosa, Campus UFV, 36570 000 Viçosa, MG, Brazil.2Departamento de Tecnologia de Alimentos, Universidade Federal de Viçosa, Campus UFV, 36570 000 Viçosa, MG, Brazil.3Departamento de Veterinária, Universidade Federal de Viçosa, Campus UFV, 36570 000 Viçosa, MG, Brazil. Electronic address: nero@ufv.br.AbstractMonitoring the populations of probiotic strains of the species Lactobacillus casei in food is required by food industries in order to assure that a minimum concentration of these organisms will be ingested by consumers. In this context, Petrifilm™ AC plates can be used along with selective culture media to allow the enumeration of specific groups of lactic acid bacteria. The present study aimed to assess chemical substances as selective agents for Lb. casei in order to propose a selective culture medium to be used with Petrifilm™ AC plates as an alternative protocol for the enumeration of probiotic strains of this species in fermented milk. Twenty-six probiotic and starter cultures (including six strains of Lb. casei) were plated on de Man Rogosa and Sharpe (MRS) agar with distinct concentrations of nalidixic acid, bile, lithium chloride, metronidazole, sodium propionate, and vancomycin. Vancomycin at 10 mg/L demonstrated selective activity for Lb. casei. In addition, 2,3,5-triphenyltetrazolium chlorine was identified as a compound that did not inhibit Lb. casei, and Petrifilm™ AC plates used with MRS and vancomycin at 10 mg/L (MRS-V) demonstrated more colonies of this organism when incubated under anaerobic conditions than aerobic conditions. Acidophilus milk and yoghurt were prepared, added to Lb. casei strains, and stored at 4 °C. Lb. casei populations were monitored using MRS-V and MRTLV by conventional plating and associated with Petrifilm™ AC plates. All correlation indices between counts obtained by conventional plating and Petrifilm™ AC were significant (p < 0.05), but the best performance was observed for growth on MRS-V. The obtained data indicate the efficiency of using MRS-V associated with Petrifilm™ AC plates for the enumeration of Lb. casei strains in fermented milk. However, the selective potential of this culture medium must be evaluated considering the specific strains of Lb. casei and the starter cultures inoculated in the fermented milk that requires monitoring.
Food microbiology.Food Microbiol.2014 May;39:89-95. doi: 10.1016/j.fm.2013.11.008. Epub 2013 Nov 21.
Monitoring the populations of probiotic strains of the species Lactobacillus casei in food is required by food industries in order to assure that a minimum concentration of these organisms will be ingested by consumers. In this context, Petrifilm™ AC plates can be used along with selective culture
PMID 24387857

Japanese Journal

パス頻度の上下限制約を満たす木状化合物の二段階列挙法

鈴木政喜,永持仁,阿久津達也
情報処理学会研究報告. BIO, バイオ情報学 2012-BIO-28(17), 1-8, 2012-03-21
分子構造の部分情報が与えられたとき,それに基づく化合物の推定問題は生物情報学において重要な課題の一つであり,薬剤設計などの多くの分野に応用することが期待される.本研究では,部分的な分子構造として,長さが与えられた整数K ≧ 0以下である部分パスを取扱い,このような部分パスに関する特徴ベクトルの上限と下限が与えられたときに,この上下限制約の範囲内の特徴ベクトルに一致する木状の化合物を全て列挙する問題 …
NAID 110008803122

〈論文〉標識偶ブロックの数え上げについて

田澤新成
総社る: Social=近畿大学総合社会学部紀要 1(2), 19-23, 2012-3
… In graph theory, this problem has been called an enumeration problem. … Among those problems, the enumeration of labeled blocks was achieved by Ford and Uhlenbeck (Proc. … In this paper, we consider the enumeration of labeled blocks in which the degree of each vertex is even. …
NAID 120004009255