| http://dbpedia.org/ontology/abstract
|
In number theory and enumerative combinato … In number theory and enumerative combinatorics, the ordered Bell numbers or Fubini numbers count the number of weak orderings on a set of n elements (orderings of the elements into a sequence allowing ties, such as might arise as the outcome of a horse race). Starting from n = 0, these numbers are 1, 1, 3, 13, 75, 541, 4683, 47293, 545835, 7087261, 102247563, ... (sequence in the OEIS). The ordered Bell numbers may be computed via a summation formula involving binomial coefficients, or by using a recurrence relation. Along with the weak orderings, they count several other types of combinatorial objects that have a bijective correspondence to the weak orderings, such as the ordered multiplicative partitions of a squarefree number or the faces of all dimensions of a permutohedron (e.g. the sum of faces of all dimensions in the truncated octahedron is 1 + 14 + 36 + 24 = 75).ated octahedron is 1 + 14 + 36 + 24 = 75).
, En mathématiques, et plus particulièrement … En mathématiques, et plus particulièrement en combinatoire, les nombres de Fubini ou nombres de Bell ordonnés dénombrent les partitions ordonnées d'un ensemble E à n éléments, c'est-à-dire les familles finies de parties non vides disjointes de E dont la réunion est égale à E. Par exemple, pour n = 3, il y a 13 partitions ordonnées de : 6 du type , 3 du type , 3 du type , plus .6 du type , 3 du type , 3 du type , plus .
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/13-Weak-Orders.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
6992164
|
| http://dbpedia.org/ontology/wikiPageLength
|
17311
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1122565116
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Modular_arithmetic +
, http://dbpedia.org/resource/Combination_lock +
, http://dbpedia.org/resource/Guido_Fubini +
, http://dbpedia.org/resource/Permutohedron +
, http://dbpedia.org/resource/Election +
, http://dbpedia.org/resource/Horse_racing +
, http://dbpedia.org/resource/Linguistics +
, http://dbpedia.org/resource/Optimality_theory +
, http://dbpedia.org/resource/Set_%28mathematics%29 +
, http://dbpedia.org/resource/Fubini%27s_theorem +
, http://dbpedia.org/resource/File:Cayley_ordered_Bell_trees.svg +
, http://dbpedia.org/resource/List_of_dead_heat_horse_races +
, http://dbpedia.org/resource/Weak_ordering +
, http://dbpedia.org/resource/Stirling_numbers_of_the_second_kind +
, http://dbpedia.org/resource/Total_order +
, http://dbpedia.org/resource/Recurrence_relation +
, http://dbpedia.org/resource/Natural_language +
, http://dbpedia.org/resource/Binomial_coefficient +
, http://dbpedia.org/resource/Eulerian_number +
, http://dbpedia.org/resource/Eric_Temple_Bell +
, http://dbpedia.org/resource/Exponential_generating_function +
, http://dbpedia.org/resource/Factorial +
, http://dbpedia.org/resource/Number_theory +
, http://dbpedia.org/resource/Lowest_common_ancestor +
, http://dbpedia.org/resource/Partition_of_a_set +
, http://dbpedia.org/resource/Category:Integer_sequences +
, http://dbpedia.org/resource/Baseball +
, http://dbpedia.org/resource/Enumerative_combinatorics +
, http://dbpedia.org/resource/Category:Enumerative_combinatorics +
, http://dbpedia.org/resource/Photo_finish +
, http://dbpedia.org/resource/Horse_race +
, http://dbpedia.org/resource/Infinite_matrix +
, http://dbpedia.org/resource/Tree_%28graph_theory%29 +
, http://dbpedia.org/resource/Bijective_proof +
, http://dbpedia.org/resource/Squarefree +
, http://dbpedia.org/resource/Truncated_octahedron +
, http://dbpedia.org/resource/Finitary_relation +
, http://dbpedia.org/resource/Summation +
, http://dbpedia.org/resource/Multiplicative_partition +
, http://dbpedia.org/resource/File:13-Weak-Orders.svg +
, http://dbpedia.org/resource/Bell_number +
, http://dbpedia.org/resource/Identity_matrix +
, http://dbpedia.org/resource/Pascal%27s_triangle +
, http://dbpedia.org/resource/Tie_%28draw%29 +
, http://dbpedia.org/resource/Infinite_series +
, http://dbpedia.org/resource/Contour_integration +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:OEIS +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Classes_of_natural_numbers +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Enumerative_combinatorics +
, http://dbpedia.org/resource/Category:Integer_sequences +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Ordered_Bell_number?oldid=1122565116&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Cayley_ordered_Bell_trees.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/13-Weak-Orders.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Ordered_Bell_number +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q7100706 +
, http://fr.dbpedia.org/resource/Nombre_de_Fubini +
, http://dbpedia.org/resource/Ordered_Bell_number +
, http://yago-knowledge.org/resource/Ordered_Bell_number +
, https://global.dbpedia.org/id/4snkK +
, http://rdf.freebase.com/ns/m.0rphffc +
|
| rdf:type |
http://dbpedia.org/class/yago/Arrangement107938773 +
, http://dbpedia.org/class/yago/Ordering108456993 +
, http://dbpedia.org/class/yago/Series108457976 +
, http://dbpedia.org/class/yago/WikicatIntegerSequences +
, http://dbpedia.org/class/yago/Sequence108459252 +
, http://dbpedia.org/class/yago/Group100031264 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
|
| rdfs:comment |
En mathématiques, et plus particulièrement … En mathématiques, et plus particulièrement en combinatoire, les nombres de Fubini ou nombres de Bell ordonnés dénombrent les partitions ordonnées d'un ensemble E à n éléments, c'est-à-dire les familles finies de parties non vides disjointes de E dont la réunion est égale à E. Par exemple, pour n = 3, il y a 13 partitions ordonnées de : 6 du type , 3 du type , 3 du type , plus .6 du type , 3 du type , 3 du type , plus .
, In number theory and enumerative combinato … In number theory and enumerative combinatorics, the ordered Bell numbers or Fubini numbers count the number of weak orderings on a set of n elements (orderings of the elements into a sequence allowing ties, such as might arise as the outcome of a horse race). Starting from n = 0, these numbers are 1, 1, 3, 13, 75, 541, 4683, 47293, 545835, 7087261, 102247563, ... (sequence in the OEIS).61, 102247563, ... (sequence in the OEIS).
|
| rdfs:label |
Ordered Bell number
, Nombre de Fubini
|
