Issuu on Google+


gen· er·at· e, e, er·at· gen·

gen· gen· gen· gen· gen· er·at· er·at· er·at· er·at· er·at· e, e,e, e, e,

gen·

er·at·

{

}

gen· er·at· e,

e, 3

e, er·at· gen·


“

it is a

verb.

4


5


6


fo r rr

7

m.

a

LINE


Generating functions are not functions in the for-

mal sense of a mapping from a domain to a codomain;

the name is merely traditional, and they are sometimes more correctly called generating series.

times more correctly called generating series. the name is merely traditional, and they are somemal sense of a mapping from a domain to a codomain; Generating functions are not functions in the for-

eee

E

eee

called generating series.

aditional, and they are some-

g from a domain to a codomain;

-rof eht ni snoitcnuf ton era snoitcnuf gnitar

;niamodoc a ot niamod a morf gnippam a fo esnes

.seires gnitareneg dellac yltcerroc erom s

-emos era yeht dna ,lanoitidart ylerem si eman

are not functions in the for-

NER

8


9


10


11

In mathematics, a indices to start at 1 generating function is rather than 0), but the a formal power series ease with which they can in one indeterminate, be handled may differ whose coefficients encode considerably. The particinformation about a ular generating function, sequence of numbers if any, that is most useful an that is indexed by in a given context will the natural numbers. depend upon the nature Generating functions of the sequence and the were first introduced by details of the problem Abraham de Moivre in being addressed. 1730, in order to solve the Generating functions are general linear recurrence often expressed in closed In mathematics, a indices to start at 1 problem.[1] One can genform (rather than as a generating function is rather than 0), but the eralize to formal power series), by some expresa formal power series ease with which they can series in more than one sion involving operations in one indeterminate, be handled may differ indeterminate, to encode defined for formal whose coefficients encode considerably. The particinformation about arrays power series. These information about a ular generating function, of numbers indexed by expressions in terms of sequence of numbers if any, that is most useful several natural numbers. the indeterminate x may an that is indexed by in a given context will There are various types involve arithmetic operthe natural numbers. depend upon the nature of generating functions, ations, differentiation Generating functions of the sequence and the including ordinary with respect to x and were first introduced by details of the problem generating functions, composition with (i.e., Abraham de Moivre in being addressed. exponential generating substitution into) other 1730, in order to solve the Generating functions are functions, Lambert generating functions; general linear recurrence often expressed in closed series, Bell series, and Disince these operations problem.[1] One can genform (rather than as a richlet series; definitions are also defined for eralize to formal power series), by some expresand examples are given functions, the result series in more than one sion involving operations below. Every sequence in looks like a function of x. indeterminate, to encode defined for formal principle has a generatIndeed, the closed form information about arrays power series. These ing function of each type expression can often be of numbers indexed by expressions in terms of (except that Lambert and interpreted as a function several natural numbers. the indeterminate x may Dirichlet series require that can be evaluated There are various types involve arithmetic operof generating functions, ations, differentiation including ordinary with respect to x and generating functions, composition with (i.e., exponential generating substitution into) other functions, Lambert generating functions; series, Bell series, and Disince these operations richlet series; definitions are also defined for and examples are given functions, the result below. Every sequence in looks like a function of x. principle has a generatIndeed, the closed form ing function of each type expression can often be (except that Lambert and interpreted as a function Dirichlet series require that can be evaluated


eta·re·neg /tar,enej’/ brev  ;etareneg :brev  ;setareneg :tneserp nosrep dr3  ;detareneg :esnet tsap  ;detareneg :elpicitrap tsap :elpicitrap tneserp ro dnureg gnitareneg gen·er·ate /’jene,rat/ verb verb: generate;  3rd person present: generates;  past tense: generated;  past participle: generated;  gerund or present participle: generating

12

gen·er·ate /’jene,rat/ verb verb: generate;  3rd person present: generates;  past tense: generated;  past participle: generated;  gerund or present participle: generating


2. produce (a set or sequence of items) by performing specified mathematical or logical operations on an initial set.

synonyms:cause, give rise to, lead to, result in, bring about, create, make, produce, engender, spawn, precipitate, prompt, provoke, trigger, spark off, stir up, induce, promote, foster 1. cause (something, esp. an emotion or situation) to arise or come about. “changes that are likely to generate controversy�

13

In mathematics, a indices to start at 1 generating function is rather than 0), but the a formal power series ease with which they can in one indeterminate, be handled may differ whose coefficients encode considerably. The particinformation about a ular generating function, sequence of numbers if any, that is most useful an that is indexed by in a given context will the natural numbers. depend upon the nature Generating functions of the sequence and the were first introduced by details of the problem Abraham de Moivre in being addressed. 1730, in order to solve the Generating functions are general linear recurrence often expressed in closed In mathematics, a indices to start at 1 problem.[1] One can genform (rather than as a generating function is rather than 0), but the eralize to formal power series), by some expresa formal power series ease with which they can series in more than one sion involving operations in one indeterminate, be handled may differ indeterminate, to encode defined for formal whose coefficients encode considerably. The particinformation about arrays power series. These information about a ular generating function, of numbers indexed by expressions in terms of sequence of numbers if any, that is most useful several natural numbers. the indeterminate x may an that is indexed by in a given context will There are various types involve arithmetic operthe natural numbers. depend upon the nature of generating functions, ations, differentiation Generating functions of the sequence and the including ordinary with respect to x and were first introduced by details of the problem generating functions, composition with (i.e., Abraham de Moivre in being addressed. exponential generating substitution into) other 1730, in order to solve the Generating functions are functions, Lambert generating functions; general linear recurrence often expressed in closed series, Bell series, and Disince these operations problem.[1] One can genform (rather than as a richlet series; definitions are also defined for eralize to formal power series), by some expresand examples are given functions, the result series in more than one sion involving operations below. Every sequence in looks like a function of x. indeterminate, to encode defined for formal principle has a generatIndeed, the closed form information about arrays power series. These ing function of each type expression can often be of numbers indexed by expressions in terms of (except that Lambert and interpreted as a function several natural numbers. the indeterminate x may Dirichlet series require that can be evaluated There are various types involve arithmetic operof generating functions, ations, differentiation including ordinary with respect to x and generating functions, composition with (i.e., exponential generating substitution into) other functions, Lambert generating functions; series, Bell series, and Disince these operations richlet series; definitions are also defined for and examples are given functions, the result below. Every sequence in looks like a function of x. principle has a generatIndeed, the closed form ing function of each type expression can often be (except that Lambert and interpreted as a function Dirichlet series require that can be evaluated


{ {

t o

t h a t

g e n e r a t e

a r e

l i k e l y

c o n t r o v e r s y �

to bring into existence; cause to be; produce.

“ c h a n g e s

In mathematics, a generating function is a formal power series in one indeterminate, whose coefficients encode information about a sequence of numbers an that is indexed by the natural numbers. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about arrays of numbers indexed by several natural numbers.

14


Generating functions are often expressed in closed form (rather than as a series), by so sion involving operations defined for formal power series. These expressions in terms of t minate x may involve arithmetic operations, differentiation with respect to x and compo (i.e., substitution into) other generating functions; since these operations are also define tions, the result looks like a function of x. Indeed, the closed form expression can ofte preted as a function that can be evaluated at (sufficiently small) concrete values of x, and the formal power series as its Taylor series; this explains the designation “generating fu

(1-)

(2-)

15

(3-)


LINGUISTICS produce (a sentence or other unit,) by the application of a finite set of rules to lexical or other linguistic input.

16


17

generate g

n

t

7

e

5

r

r

2

e

9

e

4

e

t

e

8

0

a

r

g

9

e

6

n

e

t

a

0

1

e

1


repro 18


oduce 19


1 2

9

3

8

0

9

8

1

2

7

4

9

7

8

1

6

3

9

7

8

4

6

1

9

2

8

7

6

9

7

6

1

2

9

8

7

3

4

6

9

2 a G

x

20

, A generating function is a clothesline on which we hang up a sequence of numbers for display.

3

2 9 4 6 9 3 8 0 9 8 7 3 2 9 8 1 1 2 9 3 8 2 7 9 7 6 6 0 9 4 7 9 7 8 1 9 2 8 8 1 2 7 4 6 1 6 3 4 9 99 77 8 7 8 8 4 1 6 3 6 1 9 7 81 6 3 9 4 7 9 7 8 2 8 8 1 2 4 6 7 6 8 0 9 1 9 9 7 2 8 2 9 3 6 1 7 6 2 9 9 7 8 7 6 1 3 4 2 9 6 9 8 7 3 4 6 9


n I M

N a

T

H

e

M

a

T i

C

S

form a line,

21

surface, or solid

G (an;x)

=

an

a point, line, or surface.


symm etric group

1

2

3

In mathematics, the symmet22 set of symbols to itself. ric group Sn on a finite set of bijective functions from the n symbols is the group whose tations, which are treated as elements are all the permucomposition of such permutations of the n symbols, and whose group operation is the whose group operation is the tations of the n symbols, and composition of such permuelements are all the permutations, which are treated as n symbols is the group whose bijective functions from the ric group Sn on a finite set of


The group operation in a symmetric group is function com-

position, denoted by the symbol ∘ or simply by juxtaposition of

the permutations. The composition f ∘ g of permutations f and g,

1 1 23

The group operation in a symmetric group

F=(13)(45)

( position, denoted by the symbol ∘ or simply by

the permutations. The composition f ∘ g of permu-

12345 32154

)


GENERATING FUNCTION.

a probability-generating function. ordinary generating function is called of a discrete random variable, then its If an is the probability mass function

24

generate

g n 21

t

7

e

5

r

9

e

4

e

t

r e

0

a

r

g

9

e

0

e

6

n

e

t

a

1


25


generate g

n

t

7

e

5

r

r

2

e

9

e

e

t

e

8

0

a

g

e

0

1

e

6

a

1

e

26

Generating functions are not functions in the formal

sense of a mapping from a domain to a codomain; the

name is merely traditional, and they are sometimes

G(anxn)=∑ anxn n=0

more correctly called generating series


∑ am, n; xm, ym G(am, n; x, y) = n=0

27

m

am ,

a

n;

x m,

x , n; m

,y


28


gen路 er路at路 e,

29


Polynomials are a special case of ordinary generating functions, corresponding to finite sequenc alently sequences that vanish after a certain point. These are important in that many finite seq usefully be interpreted as generating functions, such as the PoincarĂŠ polynomial, and others.

12345 67890

Polynomials are a special case of ordinary generating functions, corresponding to finite sequences, or equivalently sequences that vanish after a certain point. These are important in that many finite sequences can usefully be interpreted as generating functions, such as the PoincarĂŠ polynomial, and others.

2 3

4 5 6 7 8

9 0

{

1

30

(A) g e n e r a t e

(B) p r o d u c e

}


31

{

} generate

g

n

t

7

e

5

r

r

2

e

9

e

4

e

t

e

8

0

a

9

e

0

1

e

6

n

g e

t

a

1


32


33

gen路 er路at路 e,

{

}


34

gen路 er路at路 e,

3. form (a line, surface, or solid) by notionally moving a point, line, or surface.

2. produce by performing specified mathematical or logical operations on an initial set.

1. cause (something, esp. an emotion or situation) to arise or come about.

{ {



Generate