On Generating function associated to patterns

Simple item page
dc.contributor.authorHessas, Fatima
dc.date.accessioned2024-10-09T09:55:40Z
dc.date.available2024-10-09T09:55:40Z
dc.date.issued2024
dc.description71 f. ; 30 cm.
dc.description.abstractThe notion of pattern is widely studied in the literature. In this paper we focus our attention on patterns appearing in language theory, perfect matchings and set partitions. Algebraic generating functions of sequences of numbers are the main tools used in our contribution. We explain how the Bell, Fibonacci, and generalised Fibonacci numbers and polynomials can be used in the theory of patterns that provide enumeration formulae. In the first part of our work we are interested in the enumeration of words of arbitrary length containing patterns from a finite alphabet. Recurrence relations and explicit formulae are extracted and proposed. Furthermore, we revisit the work of Bloom and Elizalde on the enumeration of pattern avoidance in perfect matchings and partitions in order to complete it with some recurrence relations and explicite formulae.
dc.identifier.urihttps://dspace.ummto.dz/handle/ummto/24643
dc.language.isoen
dc.publisherUNIVERSITEĀ“MOULOUD MAMMERI DE TIZIā€“OUZOU
dc.subjectGenerating fonctions
dc.subjectFormule de bell
dc.subjectNotion of patterns
dc.titleOn Generating function associated to patterns
dc.typeThesis

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ON GENERATING FUNCTIONS ASSOCIATED TO PATTERNS.pdf
Size:
696.6 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

DƩpartement de MathƩmatiques