![]() ![]() It is hoped that this exposition will encourage the use of Hopf algebraic ideas in the study of certain combinatorial areas of mathematics. We stress the classical connection (say over the real or complex numbers) with formal power series and the theory of linear homogeneous ordinary differential equations. The computation involves inverting the Hankel matrix of the sequence. Calculate f ( 7) for the recursive sequence f ( x) 2 f ( x 2) + 3. Whats an Arithmetic Sequence See a pattern in a sequence It might be an. In particular, we give an algorithm for diagonalizing a sequence in terms of the basis of the coalgebra it generates formed by its images under the difference-operator shift. Texas Algebra 1 Sequences Arithmetic Sequences in Recursive Form. ![]() We discuss possible bases for the solution space from the point of view of diagonalization. Such a sequence satisfies a minimal recursive relation, whose solution space is the subcoalgebra generated by the sequence. The algebra structure is that of divided-power sequences, so we concentrate on the perhaps lesser-known coalgebra (diagonalization) structure. We explain how the space of linearly recursive sequences over a field can be considered as a Hopf algebra.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |