Combinatorics, Probability & Computing最新文献

筛选
英文 中文
Investigation of Structural and Thermoelectric Properties of Bismuth Selenide Thin Films 硒化铋薄膜的结构与热电性能研究
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-02-24 DOI: 10.2174/1877946810999200831101239
H. Sharma, Y. Sharma
{"title":"Investigation of Structural and Thermoelectric Properties of Bismuth Selenide Thin Films","authors":"H. Sharma, Y. Sharma","doi":"10.2174/1877946810999200831101239","DOIUrl":"https://doi.org/10.2174/1877946810999200831101239","url":null,"abstract":"\u0000\u0000Thermoelectric material with high performance and low cost is\u0000the basic need of today. Bismuth selenide is a thermoelectric material. A set of bismuth\u0000selenide thin films having different stoichiometry ratios varying Bi/Se ratio from 0.123 to\u00000.309 have been prepared.\u0000\u0000\u0000\u0000The present work deals with the synthesis and characterization of various thin\u0000films of bismuth selenide. The thermoelectric properties of thin films were also investigated.\u0000The aim of this work is to investigate the effect of composition ratio on the structural\u0000and thermoelectric properties and to find out the best stoichiometry ratio of bismuth selenide\u0000thin films that can be used in the application of thermoelectric devices.\u0000\u0000\u0000\u0000A set of bismuth selenide thin films having different elemental compositions\u0000were prepared by employing the thermal evaporation technique. The crystal structure and\u0000elemental composition of thin films were investigated by XRD and EDAX, respectively.\u0000The roughness of films was analyzed by AFM. The thermoelectric properties of various\u0000thin films were also measured.\u0000\u0000\u0000\u0000XRD spectrum confirms the formation of phases formed in thin films which\u0000slightly matched with standard data. AFM results indicated that the surface of films was\u0000smooth and nanoparticles were generated on the surface. AFM results indicated that the\u0000surfaces of annealed thin films were smoother than as-deposited thin films. Seebeck coefficient\u0000was found negative throughout the temperature range. The power factor was also\u0000calculated by the Seebeck coefficient and results revealed the effect of composition ratio\u0000on Seebeck coefficient, electrical conductivity, and power factor. Thin films having a\u0000composition ratio of 0.182 exhibited the highest power factor.\u0000\u0000\u0000\u0000This study provides relevant basic information on the thermoelectric property\u0000of thin films, as well as presents the effect of compositional variation on thermoelectric\u0000measurements. From the application point of view in the thermoelectric devices, the best\u0000stoichiometric thin films out of four prepared thin films have been presented.\u0000","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48930853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function lsamvy面积近似的布朗桥展开式和Riemann zeta函数的特殊值
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-02-19 DOI: 10.1017/S096354832200030X
James Foster, Karen Habermann
{"title":"Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function","authors":"James Foster, Karen Habermann","doi":"10.1017/S096354832200030X","DOIUrl":"https://doi.org/10.1017/S096354832200030X","url":null,"abstract":"\u0000 We study approximations for the Lévy area of Brownian motion which are based on the Fourier series expansion and a polynomial expansion of the associated Brownian bridge. Comparing the asymptotic convergence rates of the Lévy area approximations, we see that the approximation resulting from the polynomial expansion of the Brownian bridge is more accurate than the Kloeden–Platen–Wright approximation, whilst still only using independent normal random vectors. We then link the asymptotic convergence rates of these approximations to the limiting fluctuations for the corresponding series expansions of the Brownian bridge. Moreover, and of interest in its own right, the analysis we use to identify the fluctuation processes for the Karhunen–Loève and Fourier series expansions of the Brownian bridge is extended to give a stand-alone derivation of the values of the Riemann zeta function at even positive integers.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84253468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
The chromatic profile of locally colourable graphs 局部可着色图的彩色轮廓
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-02-10 DOI: 10.1017/S0963548322000050
Freddie Illingworth
{"title":"The chromatic profile of locally colourable graphs","authors":"Freddie Illingworth","doi":"10.1017/S0963548322000050","DOIUrl":"https://doi.org/10.1017/S0963548322000050","url":null,"abstract":"\u0000 The classical Andrásfai-Erdős-Sós theorem considers the chromatic number of \u0000 \u0000 \u0000 \u0000$K_{r + 1}$\u0000\u0000 \u0000 -free graphs with large minimum degree, and in the case, \u0000 \u0000 \u0000 \u0000$r = 2$\u0000\u0000 \u0000 says that any n-vertex triangle-free graph with minimum degree greater than \u0000 \u0000 \u0000 \u0000$2/5 cdot n$\u0000\u0000 \u0000 is bipartite. This began the study of the chromatic profile of triangle-free graphs: for each k, what minimum degree guarantees that a triangle-free graph is k-colourable? The chromatic profile has been extensively studied and was finally determined by Brandt and Thomassé. Triangle-free graphs are exactly those in which each neighbourhood is one-colourable. As a natural variant, Luczak and Thomassé introduced the notion of a locally bipartite graph in which each neighbourhood is 2-colourable. Here we study the chromatic profile of the family of graphs in which every neighbourhood is b-colourable (locally b-partite graphs) as well as the family where the common neighbourhood of every a-clique is b-colourable. Our results include the chromatic thresholds of these families (extending a result of Allen, Böttcher, Griffiths, Kohayakawa and Morris) as well as showing that every n-vertex locally b-partite graph with minimum degree greater than \u0000 \u0000 \u0000 \u0000$(1 - 1/(b + 1/7)) cdot n$\u0000\u0000 \u0000 is \u0000 \u0000 \u0000 \u0000$(b + 1)$\u0000\u0000 \u0000 -colourable. Understanding these locally colourable graphs is crucial for extending the Andrásfai-Erdős-Sós theorem to non-complete graphs, which we develop elsewhere.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76062182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
On deficiency problems for graphs 关于图的不足性问题
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-02-08 DOI: 10.1017/s0963548321000389
Andrea Freschi, Joseph Hyde, Andrew Treglown
{"title":"On deficiency problems for graphs","authors":"Andrea Freschi, Joseph Hyde, Andrew Treglown","doi":"10.1017/s0963548321000389","DOIUrl":"https://doi.org/10.1017/s0963548321000389","url":null,"abstract":"\u0000\t <jats:p>Motivated by analogous questions in the setting of Steiner triple systems and Latin squares, Nenadov, Sudakov and Wagner [Completion and deficiency problems, Journal of Combinatorial Theory Series B, 2020] recently introduced the notion of <jats:italic>graph deficiency</jats:italic>. Given a global spanning property <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline1.png\" />\u0000\t\t<jats:tex-math>\u0000$mathcal P$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula> and a graph <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline2.png\" />\u0000\t\t<jats:tex-math>\u0000$G$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula>, the deficiency <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline3.png\" />\u0000\t\t<jats:tex-math>\u0000$text{def}(G)$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula> of the graph <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline4.png\" />\u0000\t\t<jats:tex-math>\u0000$G$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula> with respect to the property <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline5.png\" />\u0000\t\t<jats:tex-math>\u0000$mathcal P$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula> is the smallest non-negative integer <jats:italic>t</jats:italic> such that the join <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline6.png\" />\u0000\t\t<jats:tex-math>\u0000$G*K_t$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula> has property <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline7.png\" />\u0000\t\t<jats:tex-math>\u0000$mathcal P$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula>. In particular, Nenadov, Sudakov and Wagner raised the question of determining how many edges an <jats:italic>n</jats:italic>-vertex graph <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0963548321000389_inline8.png\" />\u0000\t\t<jats:tex-math>\u0000$G$\u0000</jats:tex-math>\u0000\t </jats:alternatives>\u0000\t </jats:inline-formula> needs to ensure <jats:inline-formula>\u0000\t <jats:alternatives>\u0000\t\t<jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73013752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tradução das Bucólicas, de Virgílio: Écloga I 维吉尔《布科利纳斯》的翻译:结语一
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-02-06 DOI: 10.17074/CPC.V1I39.34782
P. Barbieri
{"title":"Tradução das Bucólicas, de Virgílio: Écloga I","authors":"P. Barbieri","doi":"10.17074/CPC.V1I39.34782","DOIUrl":"https://doi.org/10.17074/CPC.V1I39.34782","url":null,"abstract":"Apresento uma traducao poetica da primeira ecloga das Bucolicas , de Virgilio, tomando por base o texto da OCT, editado por Mynors (1972). Teco ainda alguns comentarios preliminares acerca das minhas escolhas tradutologicas.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49578269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Композиционные материалы, упрочненные с углеродными нанотрубками и их применение в пиротехнических замедлительных смесях 碳纳米管强化复合材料及其在烟火慢化混合物中的应用
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-02-02 DOI: 10.18321/CPC381
Ш.Е. Габдрашова, М. И. Тулепов, Г.А. Спанова, М. А. Корчагин, B. Elouadi
{"title":"Композиционные материалы, упрочненные с углеродными нанотрубками и их применение в пиротехнических замедлительных смесях","authors":"Ш.Е. Габдрашова, М. И. Тулепов, Г.А. Спанова, М. А. Корчагин, B. Elouadi","doi":"10.18321/CPC381","DOIUrl":"https://doi.org/10.18321/CPC381","url":null,"abstract":"Был разработан замедлительный пиротехнический состав на основе модифицированных компонентов. Ti и углеродные нанотрубки были смешаны методом шаровой мельницы. Анализ размера частиц показал, что размер частиц экспоненциально уменьшился с увеличением времени измельчения. Результаты сканирующей электронной микроскопии показали, что углеродные нанотрубки были рассеяны в титановом порошке после 2 минут мехактивации. Ti/углеродные нанотрубки были использованы в качестве горючего замедлительного состава. Мы изучали скорость горения замедлительного состава BaCrO4/углеродные нанотрубки/Тi. Установлено, что определенное количество углеродных нанотрубок добавленного к замедлительному составу, может увеличить точность задержки.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41467351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
INCESTO, TORTURA E SILÊNCIO: UM CASO DE FAMÍLIA NA DECLAMAÇÃO MAIOR 18, DE PSEUDO-QUINTILIANO 乱伦、酷刑和沉默:伪昆提利亚诺的《主要宣言》第18章中的一个家庭案例
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-01-27 DOI: 10.17074/CPC.V1I39.35839
Ana Clara Borro Lopes, Charlene Martins Miotti
{"title":"INCESTO, TORTURA E SILÊNCIO: UM CASO DE FAMÍLIA NA DECLAMAÇÃO MAIOR 18, DE PSEUDO-QUINTILIANO","authors":"Ana Clara Borro Lopes, Charlene Martins Miotti","doi":"10.17074/CPC.V1I39.35839","DOIUrl":"https://doi.org/10.17074/CPC.V1I39.35839","url":null,"abstract":"O presente artigo propoe a traducao em portugues brasileiro da Declamacao Maior 18, sobre a acusacao de uma mae ante o silencio do marido em relacao a tortura e assassinato do filho unico, suspeito de incesto. E o penultimo texto do compendio das Declamacoes Maiores , atribuidas a Pseudo-Quintiliano, e antecede a defesa do pai, desenvolvida na decima nona, e ultima, declamacao. Alem da traducao do texto latino, abordam-se brevemente problemas de autoria e atribuicao desse conjunto de textos ao retor Marco Fabio Quintiliano (c. 30-96 EC), a construcao do genero literario declamatorio, suas relacoes com o universo mitologico romano, sua relevância para a formacao retorica dos jovens, alem de recursos de estilo mais proeminentes no discurso.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43895667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tacitus and C. Licinius Mucianus 塔西佗和C.李锡尼
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-01-27 DOI: 10.17074/CPC.V1I39.34563
W. Altman
{"title":"Tacitus and C. Licinius Mucianus","authors":"W. Altman","doi":"10.17074/CPC.V1I39.34563","DOIUrl":"https://doi.org/10.17074/CPC.V1I39.34563","url":null,"abstract":"Resumo:  Baseando-se nas ideias de Ronald Syme sobre a simpatia de Tacito por Marcelo Eprio, assim como no trabalho de Dylan Sailor, que revela a postura critica do historiador em relacao a Helvidio Prisco, este artigo mostra por que a descricao de Muciano e importante tanto para combinar quanto para confirmar essas duas vertentes interpretativas. Apresentado como “criador de reis” a Vespasiano, Muciano – ou melhor, o retrato que Tacito faz dele – revela-se um guia crucial, embora negligenciado, para os metodos e as simpatias do historiador cuja carreira dependia da Dinastia Flaviana e que decidiu contar seus feitos em suas  Historias.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45654818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A CONSTRUÇÃO DA PERSONA SATÍRICA NAS SÁTIRAS DE PÉRSIO 健康人身安全建设
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-01-27 DOI: 10.17074/CPC.V2I38.31810
Ruth Santos Fontes Silva, L. Leite
{"title":"A CONSTRUÇÃO DA PERSONA SATÍRICA NAS SÁTIRAS DE PÉRSIO","authors":"Ruth Santos Fontes Silva, L. Leite","doi":"10.17074/CPC.V2I38.31810","DOIUrl":"https://doi.org/10.17074/CPC.V2I38.31810","url":null,"abstract":"O presente artigo analisa a construcao da persona satirica na obra do poeta romano Aulo Persio Flaco. Nossa analise utiliza o conceito de persona a partir dos estudos de Paulo Sergio de Vasconcellos (2016) e Diskin Clay (1998), em que os estudiosos propoem a distincao entre a persona poetica e o autor empirico frente a leitura dos textos literarios que, por vezes, sao tomados pelo vies autobiografico. Alem disso, utilizamos o conceito de ethos proposto por Dominique Maingueneau, que considera que todo texto escrito possui um tom que confere autoridade ao que e dito e permite ao leitor a construcao da representacao de quem escreve. Desse modo, percebemos que a construcao da persona satirica de Persio, nas satiras em questao, apresenta um ethos conservador que se excede nos vulgarismos para criticar a sociedade romana e seus padroes, contrario a literatura contemporânea e ao helenismo, avesso ao apego material e defensor dos estudos da filosofia estoica.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42863751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A decapitação de Holofernes e as revoltas dos Macabeus: tradução alipogramática do Livro IX da De aetatibus mundi et hominis de Fulgêncio, o Mitógrafo 霍洛弗内斯的斩首和马加比起义:神话学家富尔根提乌斯的《世界与人》第九卷的阿里波语法翻译
IF 0.9 4区 数学
Combinatorics, Probability & Computing Pub Date : 2021-01-27 DOI: 10.17074/CPC.V1I39.34543
Cristóvão José dos Santos Júnior
{"title":"A decapitação de Holofernes e as revoltas dos Macabeus: tradução alipogramática do Livro IX da De aetatibus mundi et hominis de Fulgêncio, o Mitógrafo","authors":"Cristóvão José dos Santos Júnior","doi":"10.17074/CPC.V1I39.34543","DOIUrl":"https://doi.org/10.17074/CPC.V1I39.34543","url":null,"abstract":"Neste trabalho, realiza-se a primeira traducao alipogramatica para a lingua portuguesa do Livro IX da obra De aetatibus mundi et hominis , considerada o mais antigo lipograma que o passado nos legou. Esse escrito e atribuido ao compositor africano e tardio Fulgencio, o Mitografo, que teria vivido entre os seculos V e VI d.C. A  De aetatibus  encerra uma constricao linguistica de carater consecutivo, de modo que, em cada uma de suas 14 secoes, e evitada uma determinada letra. No nono Livro, ora traduzido, Fulgencio apresenta personagens como Jezabel, Manasses, Nabucodonosor, Nebuzarada e Mordecai, fazendo referencia a algumas narrativas cristas, com destaque para o episodio da decapitacao de Holofernes por Judite. Ocorre que Fulgencio, visando a empreender seu lipograma, nao emprega unidades lexicais que apresentem o grafema ‘i’, que e exatamente a oitava letra de seu alfabeto. Note-se, por fim, que esse feito nao foi cultivado no texto de chegada, na medida em que, neste momento, busca-se fornecer uma traducao que propicie um acesso mais fluido ao conteudo tematico do texto latino.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9,"publicationDate":"2021-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41882160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信