2026-10-19T01:09:12Zhttps://ebyu-rdlopen.rawdatalibrary.net/oai/request

oai:ebyu-rdlopen.rawdatalibrary.net:ebyu/131982026-10-18T20:43:13Zopenairedrivercom_ebyu_10000col_ebyu_10001

K-Narayana sequence self-Similarity. flip graph views of k-Narayana self-SimilarityÖzkan, EnginKuloǧlu, BaharPeters, James F.Flip graphsK-Narayana sequencePascal 3-trianglePlanar graphSelf-SimilarityFlip graphFree groupsGroup presentationK-narayanum sequenceSelf-similarSelf-similaritiesSpanning subgraphsGraphic methodsThis paper introduces self-similarity inherent in planar Milich-Jennings centered flip graphs derived from the Narayana sequence. We show that self-similarity found in a Narayana sequence yields a connected spanning subgraph with a centered flip. This paper has several main results (1) Every Narayana sequence constructs a flip graph, (2) Every Narayana sequence is self-similar and (3) Every Pascal 3-triangle has a free group presentation. © 2021Elsevier Ltd2021Articlehttps://rdlopen.rawdatalibrary.net/r/ebyu/13198https://doi.org/10.1016/j.chaos.2021.1114730960-0779enChaos, Solitons and Fractalsinfo:eu-repo/semantics/openAccessinfo:eu-repo/semantics/articlehttps://ebyu-rdlopen.rawdatalibrary.net/tr/items/ebyu/13198