首页 > 最新文献

Journal of Algebra Combinatorics Discrete Structures and Applications最新文献

英文 中文
On commuting probabilities in finite groups and rings 有限群和环上的交换概率
Q3 Mathematics Pub Date : 2020-10-02 DOI: 10.13069/jacodesmath.1056492
Martin Jur'avs, M. Ursul
We show that the set of all commuting probabilities in finite rings is a subset of the set of all commuting probabilities in finite nilpotent groups of class $le2$. We believe that these two sets are equal; we prove they are equal, when restricted to groups and rings with odd number of elements.
证明了有限环中所有交换概率的集合是类$le2$的有限幂零群中所有交换概率集合的一个子集。我们相信这两个集合是相等的;我们证明了它们在限定为奇数元的群和环时是相等的。
{"title":"On commuting probabilities in finite groups and rings","authors":"Martin Jur'avs, M. Ursul","doi":"10.13069/jacodesmath.1056492","DOIUrl":"https://doi.org/10.13069/jacodesmath.1056492","url":null,"abstract":"We show that the set of all commuting probabilities in finite rings is a subset of the set of all commuting probabilities in finite nilpotent groups of class $le2$. We believe that these two sets are equal; we prove they are equal, when restricted to groups and rings with odd number of elements.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46943101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Some results on relative dual Baer property 关于相对对偶Baer性质的一些结果
Q3 Mathematics Pub Date : 2020-09-04 DOI: 10.13069/jacodesmath.790751
T. Amouzegar, R. Tribak
Let $R$ be a ring. In this article, we introduce and study relative dual Baer property. We characterize $R$-modules $M$ which are $R_R$-dual Baer, where $R$ is a commutative principal ideal domain. It is shown that over a right noetherian right hereditary ring $R$, an $R$-module $M$ is $N$-dual Baer for all $R$-modules $N$ if and only if $M$ is an injective $R$-module. It is also shown that for $R$-modules $M_1$, $M_2$, $ldots$, $M_n$ such that $M_i$ is $M_j$-projective for all $i > j in {1,2,ldots, n}$, an $R$-module $N$ is $bigoplus_{i=1}^nM_i$-dual Baer if and only if $N$ is $M_i$-dual Baer for all $iin {1,2,ldots,n}$. We prove that an $R$-module $M$ is dual Baer if and only if $S=End_R(M)$ is a Baer ring and $IM=r_M(l_S(IM))$ for every right ideal $I$ of $S$.
设R是一个环。本文介绍并研究了相对对偶贝尔性质。我们刻画了$R$-模$M$,它们是$R_R$-对偶Baer,其中$R$是交换主理想定义域。证明了在右noether右遗传环$R$上,对于所有$R$-模$N$, $R$-模$M$是$N$-对偶Baer,当且仅当$M$是内射$R$-模。还证明了对于$R$-modules $M_1$, $M_2$, $ldots$, $M_n$,使得$M_i$对所有$i > j in {1,2,ldots,n}$是$M_j$-投影,并且$R$-module $ n$是$ bigoplus_{i=1}^nM_i$-对偶Baer当且仅当$ n$为$M_i$-对偶Baer对所有$iin {1,2,ldots,n}$。证明了$R$-模$M$是对偶贝尔环当且仅当$S=End_R(M)$是贝尔环且$IM=r_M(l_S(IM))$对于$S$的每一个右理想$I$证明了$R$-模$M$是对偶贝尔环。
{"title":"Some results on relative dual Baer property","authors":"T. Amouzegar, R. Tribak","doi":"10.13069/jacodesmath.790751","DOIUrl":"https://doi.org/10.13069/jacodesmath.790751","url":null,"abstract":"Let $R$ be a ring. In this article, we introduce and study relative dual Baer property. We characterize $R$-modules $M$ which are $R_R$-dual Baer, where $R$ is a commutative principal ideal domain. It is shown that over a right noetherian right hereditary ring $R$, an $R$-module $M$ is $N$-dual Baer for all $R$-modules $N$ if and only if $M$ is an injective $R$-module. It is also shown that for $R$-modules $M_1$, $M_2$, $ldots$, $M_n$ such that $M_i$ is $M_j$-projective for all $i > j in {1,2,ldots, n}$, an $R$-module $N$ is $bigoplus_{i=1}^nM_i$-dual Baer if and only if $N$ is $M_i$-dual Baer for all $iin {1,2,ldots,n}$. We prove that an $R$-module $M$ is dual Baer if and only if $S=End_R(M)$ is a Baer ring and $IM=r_M(l_S(IM))$ for every right ideal $I$ of $S$.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43669327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Degree distance and Gutman index of two graph products 两个图乘积的度距离和Gutman指数
Q3 Mathematics Pub Date : 2020-05-01 DOI: 10.13069/jacodesmath.729422
S. Sedghi, N. Shobe
The degree distance was introduced by Dobrynin, Kochetova and Gutman as a weighted version of the Wiener index. In this paper, we investigate the degree distance and Gutman index of complete, and strong product graphs by using the adjacency and distance matrices of a graph.
度距离是由Dobrynin, Kochetova和Gutman作为Wiener指数的加权版本引入的。本文利用图的邻接矩阵和距离矩阵研究了完全积图和强积图的度距离和Gutman指数。
{"title":"Degree distance and Gutman index of two graph products","authors":"S. Sedghi, N. Shobe","doi":"10.13069/jacodesmath.729422","DOIUrl":"https://doi.org/10.13069/jacodesmath.729422","url":null,"abstract":"The degree distance was introduced by Dobrynin, Kochetova and Gutman as a weighted version of the Wiener index. In this paper, we investigate the degree distance and Gutman index of complete, and strong product graphs by using the adjacency and distance matrices of a graph.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47149618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Trace forms of certain subfields of cyclotomic fields and applications 分圆场某些子场的迹形式及其应用
Q3 Mathematics Pub Date : 2020-05-01 DOI: 10.13069/jacodesmath.729440
A. J. Ferrari, A. A. Andrade, R. R. Araujo, J. Interlando
In this work, we present a explicit trace forms for maximal real subfields of cyclotomic fields as tools for constructing algebraic lattices in Euclidean space with optimal center density. We also obtain a closed formula for the Gram matrix of algebraic lattices obtained from these subfields. The obtained lattices are rotated versions of the lattices Λ9,Λ10Lambda_9, Lambda_{10}Λ​9​​,Λ​10​​ and Λ11Lambda_{11}Λ​11​​ and they are images of Zmathbb{Z}Z-submodules of rings of integers under the twisted homomorphism, and these constructions, as algebraic lattices, are new in the literature. We also obtain algebraic lattices in odd dimensions up to 777 over real subfields, calculate their minimum product distance and compare with those known in literatura, since lattices constructed over real subfields have full diversity.
在这项工作中,我们提出了环切分场的极大实子域的显式迹形式,作为在欧几里德空间中构造具有最优中心密度的代数格的工具。我们还得到了由这些子域得到的代数格的格伦矩阵的一个封闭公式。所得到的格是格Λ9,Λ10Lambda_9, Lambda_{10}Λ 9,Λ10和Λ11Lambda_{11}Λ 11的旋转版本,它们是整数环在扭曲同态下的Zmathbb{Z}Z子模的像,这些结构作为代数格在文献中是新的。由于在实子域上构造的格具有完全的多样性,我们还得到了实子域上奇维数不超过777的代数格,计算了它们的最小积距离,并与文献中已知的代数格进行了比较。
{"title":"Trace forms of certain subfields of cyclotomic fields and applications","authors":"A. J. Ferrari, A. A. Andrade, R. R. Araujo, J. Interlando","doi":"10.13069/jacodesmath.729440","DOIUrl":"https://doi.org/10.13069/jacodesmath.729440","url":null,"abstract":"In this work, we present a explicit trace forms for maximal real subfields of cyclotomic fields as tools for constructing algebraic lattices in Euclidean space with optimal center density. We also obtain a closed formula for the Gram matrix of algebraic lattices obtained from these subfields. The obtained lattices are rotated versions of the lattices Λ9,Λ10Lambda_9, Lambda_{10}Λ​9​​,Λ​10​​ and Λ11Lambda_{11}Λ​11​​ and they are images of Zmathbb{Z}Z-submodules of rings of integers under the twisted homomorphism, and these constructions, as algebraic lattices, are new in the literature. We also obtain algebraic lattices in odd dimensions up to 777 over real subfields, calculate their minimum product distance and compare with those known in literatura, since lattices constructed over real subfields have full diversity.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42166522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A generalization of the Mignotte’s scheme over Euclidean domains and applications to secret image sharing Mignotte方案在欧氏域上的推广及其在秘密图像共享中的应用
Q3 Mathematics Pub Date : 2019-09-13 DOI: 10.13069/jacodesmath.617239
Ibrahim Ozbek, F. Temiz, I. Siap
Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakley independently. After these initial studies, Asmuth-Bloom and Mignotte have proposed a different $(k,n)$ threshold modular secret sharing scheme by using the Chinese remainder theorem. In this study, we explore the generalization of Mignotte's scheme to Euclidean domains for which we obtain some promising results. Next, we propose new algorithms to construct threshold secret image sharing schemes by using Mignotte's scheme over polynomial rings. Finally, we compare our proposed scheme to the existing ones and we show that this new method is more efficient and it has higher security.
秘密共享方案是一种有效的隐藏密钥或秘密图像的方法,通过将其划分为多个部分,使得分区的一些预定子集可以恢复秘密,而其余子集不能。1979年,Shamir和Blakley独立完成了该地区的先锋建设。在这些初步研究之后,Asmuth Bloom和Mignotte利用中国余数定理提出了一种不同的$(k,n)$阈值模块秘密共享方案。在这项研究中,我们探索了Mignotte方案对欧几里得域的推广,并获得了一些有希望的结果。接下来,我们提出了在多项式环上使用Mignotte方案构造阈值秘密图像共享方案的新算法。最后,我们将我们提出的方案与现有方案进行了比较,结果表明这种新方法更有效,安全性更高。
{"title":"A generalization of the Mignotte’s scheme over Euclidean domains and applications to secret image sharing","authors":"Ibrahim Ozbek, F. Temiz, I. Siap","doi":"10.13069/jacodesmath.617239","DOIUrl":"https://doi.org/10.13069/jacodesmath.617239","url":null,"abstract":"Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakley independently. After these initial studies, Asmuth-Bloom and Mignotte have proposed a different $(k,n)$ threshold modular secret sharing scheme by using the Chinese remainder theorem. In this study, we explore the generalization of Mignotte's scheme to Euclidean domains for which we obtain some promising results. Next, we propose new algorithms to construct threshold secret image sharing schemes by using Mignotte's scheme over polynomial rings. Finally, we compare our proposed scheme to the existing ones and we show that this new method is more efficient and it has higher security.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44925293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Bijective S-boxes of different sizes obtained from quasi-cyclic codes 从拟循环码中得到不同尺寸的双射s盒
Q3 Mathematics Pub Date : 2019-09-13 DOI: 10.13069/jacodesmath.617232
D. Bikov, I. Bouyukliev, S. Bouyuklieva
The aim of this paper is to construct S-boxes of different sizes with good cryptographic properties. An algebraic construction for bijective S-boxes is described. It uses quasi-cyclic representations of the binary simplex code. Good S-boxes of sizes 4, 6, 8, 9, 10, 11, 12, 14, 15, 16 and 18 are obtained.
本文的目的是构造具有良好密码学性质的不同大小的S盒。描述了双射S-盒的代数构造。它使用二进制单纯形码的准循环表示。获得尺寸为4、6、8、9、10、11、12、14、15、16和18的良好S盒。
{"title":"Bijective S-boxes of different sizes obtained from quasi-cyclic codes","authors":"D. Bikov, I. Bouyukliev, S. Bouyuklieva","doi":"10.13069/jacodesmath.617232","DOIUrl":"https://doi.org/10.13069/jacodesmath.617232","url":null,"abstract":"The aim of this paper is to construct S-boxes of different sizes with good cryptographic properties. An algebraic construction for bijective S-boxes is described. It uses quasi-cyclic representations of the binary simplex code. Good S-boxes of sizes 4, 6, 8, 9, 10, 11, 12, 14, 15, 16 and 18 are obtained.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41735656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A note on constacyclic and skew constacyclic codes over the ring $mathbb{Z}_{p} [u,v]/langle u^2-u,v^2-v,uv-vurangle$ 关于环$mathbb上的常循环码和斜常循环码的一个注记{Z}_{p} [u,v]/langle u^2-u,v^2-v,uv-vulangle$
Q3 Mathematics Pub Date : 2019-09-13 DOI: 10.13069/jacodesmath.617244
Tushar Bag, H. Islam, O. Prakash, A. Upadhyay
For odd prime $p$, this paper studies $(1+(p-2)u)$-constacyclic codes over the ring $R= mathbb{Z}_{p} [u,v]/langle u^2-u,v^2-v,uv-vurangle$. We show that the Gray images of $(1+(p-2)u)$-constacyclic codes over $R$ are cyclic and permutation equivalent to a quasi cyclic code over $mathbb{Z}_{p}$. We derive the generators for $(1+(p-2)u)$-constacyclic and principally generated $(1+(p-2)u)$-constacyclic codes over $R$. Among others, we extend our results for skew $(1+(p-2)u)$-constacyclic codes over $R$ and exhibit the relation between skew $(1+(p-2)u)$-constacyclic codes with the other linear codes. Finally, as an application of our study, we compute several non trivial linear codes by using the Gray images of $(1+(p-2)u)$-constacyclic codes over this ring $R$.
对于奇素数$p$,本文研究了环$R= mathbb{Z}_{p} [u,v]/langle u^2-u,v^2-v,uv-vurangle$上的$(1+(p-2)u)$-常环码。证明了$R$上$(1+(p-2)u)$-常循环码的Gray图像是循环的,置换等价于$mathbb{Z}_{p}$上的拟循环码。我们推导了$(1+(p-2)u)$-constacyclic的生成器,并在$R$上生成了$(1+(p-2)u)$-constacyclic码。其中,我们推广了斜$(1+(p-2)u)$-常环码在$R$上的结果,并展示了斜$(1+(p-2)u)$-常环码与其他线性码之间的关系。最后,作为我们研究的一个应用,我们利用环R上$(1+(p-2)u)$-常环码的灰度图像计算了几个非平凡线性码。
{"title":"A note on constacyclic and skew constacyclic codes over the ring $mathbb{Z}_{p} [u,v]/langle u^2-u,v^2-v,uv-vurangle$","authors":"Tushar Bag, H. Islam, O. Prakash, A. Upadhyay","doi":"10.13069/jacodesmath.617244","DOIUrl":"https://doi.org/10.13069/jacodesmath.617244","url":null,"abstract":"For odd prime $p$, this paper studies $(1+(p-2)u)$-constacyclic codes over the ring $R= mathbb{Z}_{p} [u,v]/langle u^2-u,v^2-v,uv-vurangle$. We show that the Gray images of $(1+(p-2)u)$-constacyclic codes over $R$ are cyclic and permutation equivalent to a quasi cyclic code over $mathbb{Z}_{p}$. We derive the generators for $(1+(p-2)u)$-constacyclic and principally generated $(1+(p-2)u)$-constacyclic codes over $R$. Among others, we extend our results for skew $(1+(p-2)u)$-constacyclic codes over $R$ and exhibit the relation between skew $(1+(p-2)u)$-constacyclic codes with the other linear codes. Finally, as an application of our study, we compute several non trivial linear codes by using the Gray images of $(1+(p-2)u)$-constacyclic codes over this ring $R$.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44264437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Asymptotically good homological error correcting codes 渐近好同源纠错码
Q3 Mathematics Pub Date : 2019-09-13 DOI: 10.13069/jacodesmath.617235
J. McCullough, Heather Newman
Let $Delta$ be an abstract simplicial complex. We study classical homological error correcting codes associated to $Delta$, which generalize the cycle codes of simple graphs. It is well-known that cycle codes of graphs do not yield asymptotically good families of codes. We show that asymptotically good families of codes do exist for homological codes associated to simplicial complexes of dimension at least $2$. We also prove general bounds and formulas for (co-)cycle and (co-)boundary codes for arbitrary simplicial complexes over arbitrary fields.
设$Delta$是一个抽象的简单复合体。我们研究了与$Delta$相关的经典同调纠错码,它推广了简单图的循环码。众所周知,图的循环码不能产生渐近好的码族。我们证明了与维数至少为$2$的简单复形相关的同调码确实存在渐近好的码族。我们还证明了任意域上任意简单复合体的(共)环和(共)边界码的一般界和公式。
{"title":"Asymptotically good homological error correcting codes","authors":"J. McCullough, Heather Newman","doi":"10.13069/jacodesmath.617235","DOIUrl":"https://doi.org/10.13069/jacodesmath.617235","url":null,"abstract":"Let $Delta$ be an abstract simplicial complex. We study classical homological error correcting codes associated to $Delta$, which generalize the cycle codes of simple graphs. It is well-known that cycle codes of graphs do not yield asymptotically good families of codes. We show that asymptotically good families of codes do exist for homological codes associated to simplicial complexes of dimension at least $2$. We also prove general bounds and formulas for (co-)cycle and (co-)boundary codes for arbitrary simplicial complexes over arbitrary fields.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42373426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some explicit expressions for the structure coefficients of the center of the symmetric group algebra involving cycles of length three 长度为3的环对称群代数中心结构系数的若干显式表达式
Q3 Mathematics Pub Date : 2019-05-08 DOI: 10.13069/JACODESMATH.560404
Omar Tout
We use the combinatorial way to give an explicit expression for the product of the class of cycles of length three with an arbitrary class of cycles. In addition, an explicit formula for the coefficient of an arbitrary class in the expansion of the product of an arbitrary class by the class of cycles of length three is given.
我们用组合的方法给出了长度为3的循环类与任意一类循环的乘积的显式表达式。此外,在任意类的乘积由长度为3的循环类展开时,给出了任意类的系数的显式。
{"title":"Some explicit expressions for the structure coefficients of the center of the symmetric group algebra involving cycles of length three","authors":"Omar Tout","doi":"10.13069/JACODESMATH.560404","DOIUrl":"https://doi.org/10.13069/JACODESMATH.560404","url":null,"abstract":"We use the combinatorial way to give an explicit expression for the product of the class of cycles of length three with an arbitrary class of cycles. In addition, an explicit formula for the coefficient of an arbitrary class in the expansion of the product of an arbitrary class by the class of cycles of length three is given.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47319163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Fibonacci numbers and resolutions of domino ideals 斐波那契数和多米诺骨牌理想的决议
Q3 Mathematics Pub Date : 2019-05-08 DOI: 10.13069/JACODESMATH.561316
Rachelle R. Bouchat, Tricia Muldoon Brown
This paper considers a class of monomial ideals, called domino ideals, whose generating sets correspond to the sets of domino tilings of a $2times n$ tableau. The multi-graded Betti numbers are shown to be in one-to-one correspondence with equivalence classes of sets of tilings. It is well-known that the number of domino tilings of a $2times n$ tableau is given by a Fibonacci number. Using the bijection, this relationship is further expanded to show the relationship between the Fibonacci numbers and the graded Betti numbers of the corresponding domino ideal.
本文考虑了一类单理想,称为多米诺理想,其生成集对应于$2timesn$表的多米诺图集。多级Betti数与tilings集的等价类一一对应。众所周知,一个$2times n$表的多米诺骨牌tilings数是由斐波那契数给出的。使用双射,这种关系被进一步扩展,以显示相应多米诺理想的斐波那契数和分级贝蒂数之间的关系。
{"title":"Fibonacci numbers and resolutions of domino ideals","authors":"Rachelle R. Bouchat, Tricia Muldoon Brown","doi":"10.13069/JACODESMATH.561316","DOIUrl":"https://doi.org/10.13069/JACODESMATH.561316","url":null,"abstract":"This paper considers a class of monomial ideals, called domino ideals, whose generating sets correspond to the sets of domino tilings of a $2times n$ tableau. The multi-graded Betti numbers are shown to be in one-to-one correspondence with equivalence classes of sets of tilings. It is well-known that the number of domino tilings of a $2times n$ tableau is given by a Fibonacci number. Using the bijection, this relationship is further expanded to show the relationship between the Fibonacci numbers and the graded Betti numbers of the corresponding domino ideal.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44540466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Journal of Algebra Combinatorics Discrete Structures and Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1