VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/962| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nguyen Le Thien Ha | en_US |
| dc.date.accessioned | 2020-07-16T03:58:47Z | - |
| dc.date.available | 2020-07-16T03:58:47Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.uri | http://epub.vgu.edu.vn/handle/dlibvgu/962 | - |
| dc.description.abstract | In this thesis, we enumerate and show closed formulas for the number of restricted growth functions which avoid a set of vincular patterns and multiple patterns. In specific, we try to enumerate on every cases for the vincular pattern of length 2, 3 and 4; however, a minority of that leads to an interesting result. These patterns are: 21, 121, 121, 1212, 1221, and (1212,213), (1221,213). More precisely, with these patterns, we revisit classical sequences, such as the Bell numbers, binary sequences and other interesting sequences in Sloane. To do that, we mainly use ECO method to construct generating trees, form succession rules and find the generating functions | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Vietnamese-German University | - |
| dc.rights | Attribution-NonCommercial 4.0 International | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc/4.0/ | * |
| dc.subject | Restricted growth functions | en_US |
| dc.subject | Vincular patterns | en_US |
| dc.subject | Binary sequences | en_US |
| dc.title | Combinatorial enumerations on restricted growth function avoiding patterns | en_US |
| dc.type | Thesis | en_US |
| item.grantfulltext | restricted | - |
| item.fulltext | With Fulltext | - |
| item.languageiso639-1 | other | - |
| Appears in Collections: | Computer Science (CS) | |
Files in This Item:
| File | Description | Size | Format | Existing users please Login |
|---|---|---|---|---|
| Combinatorial enumerations on restricted growth function avoiding patterns.pdf | 1.13 MB | Adobe PDF |
Page view(s)
136
checked on Aug 23, 2025
Download(s)
41
checked on Aug 23, 2025
Google ScholarTM
Check
This item is licensed under a Creative Commons License