{"title":"Dyck-Eulerian标识","authors":"Pietro Codara , Ottavio M. D'Antona","doi":"10.1016/j.endm.2018.06.041","DOIUrl":null,"url":null,"abstract":"<div><p>We introduce a family of Eulerian digraphs, <span><math><mi>E</mi></math></span>, associated with Dyck words. We provide the algorithms implementing the bijection between <span><math><mi>E</mi></math></span> and <span><math><mi>W</mi></math></span>, the set of Dyck words. To do so, we exploit a binary matrix, that we call <em>Dyck matrix</em>, representing the cycles of an Eulerian digraph.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.041","citationCount":"0","resultStr":"{\"title\":\"Dyck-Eulerian digraphs\",\"authors\":\"Pietro Codara , Ottavio M. D'Antona\",\"doi\":\"10.1016/j.endm.2018.06.041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We introduce a family of Eulerian digraphs, <span><math><mi>E</mi></math></span>, associated with Dyck words. We provide the algorithms implementing the bijection between <span><math><mi>E</mi></math></span> and <span><math><mi>W</mi></math></span>, the set of Dyck words. To do so, we exploit a binary matrix, that we call <em>Dyck matrix</em>, representing the cycles of an Eulerian digraph.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.06.041\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S157106531830132X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S157106531830132X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
We introduce a family of Eulerian digraphs, , associated with Dyck words. We provide the algorithms implementing the bijection between and , the set of Dyck words. To do so, we exploit a binary matrix, that we call Dyck matrix, representing the cycles of an Eulerian digraph.
期刊介绍:
Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.