Bialgebras of Recursive Sequences and Combinatorial Identities
✍ Scribed by Carl A. Futia; Eric F. Müller; Earl J. Taft
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 194 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
✦ Synopsis
A recursive sequence is an infinite sequence of elements of some fixed ground field which satisfies a recursion relation of finite order. We shall investigate certain bialgebra structures on linear spaces of recursive sequences. By choosing appropriate bases for these bialgebras we show how an explicit formula for the coproduct can imply interesting combinatorial identities. 2002 Elsevier Science (USA)
📜 SIMILAR VOLUMES
## Abstract For a recursively defined sequence __u__ : = (__u~n~__) of integers, we describe the subgroup __t~u~__ (𝕋) of the elements __x__ of the circle group 𝕋 satisfying lim~__n__~ __u~n~x__ = 0. More attention is dedicated to the sequences satisfying a secondorder recurrence relation. In this
Spectroscopic and calorimetric melting studies of 28 DNA hairpins were performed. These hairpins form by intramolecular folding of 16 base self-complementary DNA oligomer sequences. Sequence design dictated that the hairpin structures have a six base pair duplex linked by a four base loop and that t
The chemotactic potential of SXWS peptides and the components of the extracellular domain of cytokine receptors were investigated in __Tetrahymena__ as a functional index of substitution with different amino acids in the position ‘X’ of the tetrapeptide. Data obtained demonstrate that position X pla