Finding:

1. close

   Symbolic combinatorics

   In mathematics, symbolic combinatorics is a technique of counting combinatorial objects by using the internal structure of the objects to derive formulas for their generating functions.
2. close

   Outline of combinatorics

   A few decades ago it might have been said that combinatorics is little more than a way to classify poorly-understood problems, and some standard remedies. ... Symbolic combinatorics
3. close

   Analytic combinatorics

   Analytic combinatorics is a branch of combinatorics that describes combinatorial classes using generating functions, which formal power series that often correspond to analytic functions. ... An important technique for deriving generating functions is symbolic combinatorics.
4. close

   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. ... For an introduction to the symbolic method, consult the page on symbolic combinatorics.
5. close

   Stirling numbers and exponential generating functions

   The use of exponential generating functions or EGFs to study the properties of Stirling numbers is a classical exercise in combinatorics and possibly the canonical example of how symbolic combinatorics, the method that encapsulates the fundamental theorem of combinatorial enumeration, is used. It also illustrates the parallels in the construction of these two types of numbers, lending support to the binomial-style notation that is used for them.
6. close

   Index of mathematics articles (S)

   Mathematics articles: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ... ... differential operator -- Symbolic Cholesky decomposition -- Symbolic combinatorics -- Symbolic computation -- Symbolic dynamics -- Symbolic integration -- Symbolic logic -- Symbolic method -- Symbolic-numeric computation --...
7. close

   List of mathematics articles (S)

   Mathematics articles: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ... ... differential operator -- Symbolic Cholesky decomposition -- Symbolic combinatorics -- Symbolic computation -- Symbolic dynamics -- Symbolic integration -- Symbolic logic -- Symbolic method -- Symbolic-numeric computation --...
8. close

   Iterated monodromy group

   In geometric group theory and dynamical systems the iterated monodromy group of a covering map is a group describing the monodromy action of the fundamental group on all iterations of the covering. It encodes the combinatorics and symbolic dynamics of the covering and is an example of a self-similar group.
9. close

   Symbolic dynamics

   In mathematics, symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator. ... Combinatorics on words
10. close

    Combinatorics and dynamical systems

    The mathematical disciplines of combinatorics and dynamical systems interact in a number of ways. ... Symbolic dynamics

Explore the following pages on Powerset:

• Symbolic combinatorics,
• Outline of combinatorics,
• Analytic combinatorics,
• Fundamental theorem of combinatorial enumeration,
• Stirling numbers and exponential generating functions,
• Index of mathematics articles (S),
• List of mathematics articles (S),
• Iterated monodromy group,
• Symbolic dynamics,
• Combinatorics and dynamical systems

Try this on Bing Research

Bing