About: Symbolic method (combinatorics)

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

About: Symbolic method (combinatorics) Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, 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%2FSymbolic_method_%28combinatorics%29

In combinatorics, the symbolic method is a technique for counting combinatorial objects. It uses the internal structure of the objects to derive formulas for their generating functions. The method is mostly associated with Philippe Flajolet and is detailed in Part A of his book with Robert Sedgewick, Analytic Combinatorics, while the rest of the book explains how to use complex analysis in order to get asymptotic and probabilistic results on the corresponding generating functions.

Attributes	Values
rdfs:label	Combinatòria analítica (ca) Combinatoire analytique (fr) Combinatoria analitica (it) Symbolic method (combinatorics) (en)
rdfs:comment	La Combinatòria analítica és una branca de la combinatòria que descriu fent servir funcions generadores, les de les quals sovint corresponen a funcions analítiques. Donada una funció generadora, la combinatòria analítica intenta descriure el d'una successió de fent servir tècniques algebraiques. Això sovint implica l'anàlisi de les singularitats de la funció analítica associada. Dos tipus de funcions generadores s'utilitzen comunament — i . Una tècnica important per obtenir funcions generadores és la . (ca) En mathématiques, et plus précisément en combinatoire, la combinatoire analytique (en anglais : analytic combinatorics) est un ensemble de techniques décrivant des problèmes combinatoires dans le langage des séries génératrices, et s'appuyant en particulier sur l'analyse complexe pour obtenir des résultats asymptotiques sur les objets combinatoires initiaux. Les résultats de combinatoire analytique permettent notamment une analyse fine de la complexité de certains algorithmes. (fr) La combinatoria analitica può definirsi come il settore della combinatoria che affronta i problemi delle configurazioni discrete mediante le tecniche ed il linguaggio delle serie generatrici; in particolare si utilizzano acquisizioni dell'analisi complessa per ottenere dei risultati sul comportamento asintotico delle cardinalità di configurazioni combinatorie. Molti risultati della combinatoria analitica forniscono strumenti efficaci per lo studio della complessità di vari algoritmi. (it) In combinatorics, the symbolic method is a technique for counting combinatorial objects. It uses the internal structure of the objects to derive formulas for their generating functions. The method is mostly associated with Philippe Flajolet and is detailed in Part A of his book with Robert Sedgewick, Analytic Combinatorics, while the rest of the book explains how to use complex analysis in order to get asymptotic and probabilistic results on the corresponding generating functions. (en)
dcterms:subject	Combinatorics
Wikipage page ID	986932 (xsd:integer)
Wikipage revision ID	1059232078 (xsd:integer)
Link from a Wikipage to another Wikipage	Cartesian product Robert Sedgewick (computer scientist) Enumerative combinatorics Euler totient function John Riordan (mathematician) Cycle index Random permutation statistics Computer algebra Analytic Combinatorics Ordinary generating function Generating function George Pólya Graph (discrete mathematics) Multiset Daniel Bernoulli Labelled enumeration theorem André Joyal Leonhard Euler Combinatorial class Combinatorial species Combinatorics Embedding Pólya enumeration theorem Algebra Combinatorics Ernst Schröder (mathematician) Exponential generating function Recurrence relation Recursion Asymptotic distribution Arthur Cayley Disjoint union Dominique Foata Donald Knuth Marcel-Paul Schützenberger Philippe Flajolet Srinivasa Ramanujan Random generation Sequence Set (mathematics) Set theory Umbral calculus Union (set theory) Stirling numbers and exponential generating functions in symbolic combinatorics Stirling numbers of the second kind Stirling numbers of the first kind Tree (graph) Integer partition
Link from a Wikipage to an external page	http://algo.inria.fr/flajolet/Publications/book.pdf)
sameAs	Symbolic method (combinatorics) Symbolic method (combinatorics) Symbolic method (combinatorics) Symbolic method (combinatorics) Symbolic method (combinatorics)
dbp:wikiPageUsesTemplate	dbt:About dbt:Ill dbt:Math dbt:Reflist dbt:Sub dbt:Nobold dbt:Mathcal
has abstract	La Combinatòria analítica és una branca de la combinatòria que descriu fent servir funcions generadores, les de les quals sovint corresponen a funcions analítiques. Donada una funció generadora, la combinatòria analítica intenta descriure el d'una successió de fent servir tècniques algebraiques. Això sovint implica l'anàlisi de les singularitats de la funció analítica associada. Dos tipus de funcions generadores s'utilitzen comunament — i . Una tècnica important per obtenir funcions generadores és la . (ca) En mathématiques, et plus précisément en combinatoire, la combinatoire analytique (en anglais : analytic combinatorics) est un ensemble de techniques décrivant des problèmes combinatoires dans le langage des séries génératrices, et s'appuyant en particulier sur l'analyse complexe pour obtenir des résultats asymptotiques sur les objets combinatoires initiaux. Les résultats de combinatoire analytique permettent notamment une analyse fine de la complexité de certains algorithmes. (fr) In combinatorics, the symbolic method is a technique for counting combinatorial objects. It uses the internal structure of the objects to derive formulas for their generating functions. The method is mostly associated with Philippe Flajolet and is detailed in Part A of his book with Robert Sedgewick, Analytic Combinatorics, while the rest of the book explains how to use complex analysis in order to get asymptotic and probabilistic results on the corresponding generating functions. During two centuries, generating functions were popping up via the corresponding recurrences on their coefficients (as can be seen in the seminal works of Bernoulli, Euler, Arthur Cayley, Schröder, Ramanujan, Riordan, Knuth, , etc.).It was then slowly realized that the generating functions were capturing many other facets of the initial discrete combinatorial objects, and that this could be done in a more direct formal way: The recursive nature of some combinatorial structures translates, via some isomorphisms, into noteworthy identities on the corresponding generating functions. Following the works of Pólya, further advances were thus done in this spirit in the 1970s with generic uses of languages for specifying combinatorial classes and their generating functions, as found in works by Foata and Schützenberger on permutations, Bender and Goldman on prefabs, and Joyal on combinatorial species. Note that this symbolic method in enumeration is unrelated to "Blissard's symbolic method", which is just another old name for umbral calculus. The symbolic method in combinatorics constitutes the first step of many analyses of combinatorial structures, which can then lead to fast computation schemes, to asymptotic properties and limit laws, to random generation, all of them being suitable to automatization via computer algebra. (en) La combinatoria analitica può definirsi come il settore della combinatoria che affronta i problemi delle configurazioni discrete mediante le tecniche ed il linguaggio delle serie generatrici; in particolare si utilizzano acquisizioni dell'analisi complessa per ottenere dei risultati sul comportamento asintotico delle cardinalità di configurazioni combinatorie. Molti risultati della combinatoria analitica forniscono strumenti efficaci per lo studio della complessità di vari algoritmi. (it)
prov:wasDerivedFrom	wikipedia-en:Symbolic_method_(combinatorics)?oldid=1059232078&ns=0
page length (characters) of wiki page	28730 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Symbolic_method_(combinatorics)
is Link from a Wikipage to another Wikipage of	Ptolemaic graph Analytic Combinatorics Analytic combinatorics Fundamental Theorem of Combinatorial Enumeration Fundamental theorem of combinatorial enumeration Fibonacci number Flajolet-Sedgewick fundamental theorem Boltzmann sampler Asymptotic combinatorics Flajolet–Sedgewick fundamental theorem Symbolic combinatorics Constructible combinatorial class Specifiable combinatorial class
is Wikipage redirect of	Analytic combinatorics Fundamental Theorem of Combinatorial Enumeration Fundamental theorem of combinatorial enumeration Flajolet-Sedgewick fundamental theorem Asymptotic combinatorics Flajolet–Sedgewick fundamental theorem Symbolic combinatorics Constructible combinatorial class

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