About: Ordered Bell number

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Ordered Bell number Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Series108457976, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FOrdered_Bell_number&invfp=IFP_OFF&sas=SAME_AS_OFF

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).

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Arrangement107938773 yago:Group100031264 yago:Ordering108456993 yago:WikicatIntegerSequences yago:Sequence108459252 yago:Series108457976
rdfs:label	Nombre de Fubini (fr) Ordered Bell number (en)
rdfs:comment	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 . (fr) 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). (en)
foaf:depiction
dcterms:subject	Enumerative combinatorics Integer sequences
Wikipage page ID	6992164 (xsd:integer)
Wikipage revision ID	1122565116 (xsd:integer)
Link from a Wikipage to another Wikipage	Bell number Election Enumerative combinatorics Multiplicative partition Baseball Binomial coefficient Enumerative combinatorics Horse racing Permutohedron Combination lock Contour integration Modular arithmetic Lowest common ancestor Fubini's theorem Identity matrix Photo finish Total order Tree (graph theory) Truncated octahedron Preference relation Linguistics Integer sequences Eric Temple Bell Exponential generating function Finitary relation Number theory Partition of a set Pascal's triangle List of dead heat horse races Recurrence relation Guido Fubini Bijective proof Summation Tie (draw) Optimality Theory Set (mathematics) Horse race Infinite matrix Eulerian number Factorial Natural language Stirling numbers of the second kind Infinite series Squarefree
sameAs	Ordered Bell number Ordered Bell number Ordered Bell number Ordered Bell number Ordered Bell number
dbp:wikiPageUsesTemplate	dbt:Harvtxt dbt:OEIS dbt:Reflist dbt:Short_description dbt:Classes_of_natural_numbers
thumbnail	wiki-commons:Special:FilePath/13-Weak-Orders.svg?width=300
has abstract	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). (en) 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 . (fr)
prov:wasDerivedFrom	wikipedia-en:Ordered_Bell_number?oldid=1122565116&ns=0
page length (characters) of wiki page	17311 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Ordered_Bell_number
is Link from a Wikipage to another Wikipage of	Bell number Permutohedron 13 (number) Optimality Theory 1886 in science 500 (number) 75 (number) Preference relation Eric Temple Bell Schröder–Hipparchus number Stirling numbers of the second kind William Allen Whitworth Fubini number Fubini numbers
is Wikipage redirect of	Fubini number Fubini numbers
is known for of	Eric Temple Bell
is foaf:primaryTopic of	wikipedia-en:Ordered_Bell_number

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software