首页 > 最新文献

Groups Complexity Cryptology最新文献

英文 中文
Amenability problem for Thompson's group $F$: state of the art 汤普森集团的适应性问题$F$:最先进的
Q4 MATHEMATICS Pub Date : 2023-10-19 DOI: 10.46298/jgcc.2023.15.1.11315
Guba, Victor
This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the group ring of $F$. We also discuss possible approaches to solve the problem in both directions.
这是我们最近对汤普森组$F$的适应性问题的调查结果。它们主要涉及估计F$的Cayley图中的有限子图的密度,以及F$群环中的方程。我们还讨论了从两个方向解决问题的可能方法。
{"title":"Amenability problem for Thompson's group $F$: state of the art","authors":"Guba, Victor","doi":"10.46298/jgcc.2023.15.1.11315","DOIUrl":"https://doi.org/10.46298/jgcc.2023.15.1.11315","url":null,"abstract":"This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the group ring of $F$. We also discuss possible approaches to solve the problem in both directions.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135666569","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
Bounding conjugacy depth functions for wreath products of finitely generated abelian groups 有限生成阿贝尔群环积的边界共轭深度函数
Q4 MATHEMATICS Pub Date : 2023-09-28 DOI: 10.46298/jgcc.2023.15.1.11728
Michal Ferov, Mark Pengitore
In this article, we study the asymptotic behaviour of conjugacy separability for wreath products of abelian groups. We fully characterise the asymptotic class in the case of lamplighter groups and give exponential upper and lower bounds for generalised lamplighter groups. In the case where the base group is infinite, we give superexponential lower and upper bounds. We apply our results to obtain lower bounds for conjugacy depth functions of various wreath products of groups where the acting group is not abelian.
本文研究了阿贝尔群环积共轭可分性的渐近性质。我们充分刻画了点灯群的渐近类,并给出了广义点灯群的指数上界和下界。在基群无限的情况下,给出了超指数下界和上界。我们应用我们的结果得到了作用群不是阿贝尔的各种环积群的共轭深度函数的下界。
{"title":"Bounding conjugacy depth functions for wreath products of finitely generated abelian groups","authors":"Michal Ferov, Mark Pengitore","doi":"10.46298/jgcc.2023.15.1.11728","DOIUrl":"https://doi.org/10.46298/jgcc.2023.15.1.11728","url":null,"abstract":"In this article, we study the asymptotic behaviour of conjugacy separability for wreath products of abelian groups. We fully characterise the asymptotic class in the case of lamplighter groups and give exponential upper and lower bounds for generalised lamplighter groups. In the case where the base group is infinite, we give superexponential lower and upper bounds. We apply our results to obtain lower bounds for conjugacy depth functions of various wreath products of groups where the acting group is not abelian.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135387425","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
An axiomatization for the universal theory of the Heisenberg group 海森堡群宇宙理论的公理化
Q4 MATHEMATICS Pub Date : 2023-08-28 DOI: 10.46298/jgcc.2023..12200
A. Gaglione, D. Spellman
The Heisenberg group, here denoted $H$, is the group of all $3times 3$ upperunitriangular matrices with entries in the ring $mathbb{Z}$ of integers. A.G.Myasnikov posed the question of whether or not the universal theory of $H$, inthe language of $H$, is axiomatized, when the models are restricted to$H$-groups, by the quasi-identities true in $H$ together with the assertionthat the centralizers of noncentral elements be abelian. Based on earlierpublished partial results we here give a complete proof of a slightly strongerresult.
Heisenberg群,这里记作$H$,是所有$3乘以3$上酉三角形矩阵的群,这些矩阵的元在环$mathbb{Z}$中。A.G.Myasnikov用H$的语言提出了一个问题:当模型被限定为H$-群时,H$的准恒等式和非中心元素的中心中心是阿贝尔的命题是否公化了H$的全称理论。在先前发表的部分结果的基础上,我们给出了一个稍强的结果的完整证明。
{"title":"An axiomatization for the universal theory of the Heisenberg group","authors":"A. Gaglione, D. Spellman","doi":"10.46298/jgcc.2023..12200","DOIUrl":"https://doi.org/10.46298/jgcc.2023..12200","url":null,"abstract":"The Heisenberg group, here denoted $H$, is the group of all $3times 3$ upper\u0000unitriangular matrices with entries in the ring $mathbb{Z}$ of integers. A.G.\u0000Myasnikov posed the question of whether or not the universal theory of $H$, in\u0000the language of $H$, is axiomatized, when the models are restricted to\u0000$H$-groups, by the quasi-identities true in $H$ together with the assertion\u0000that the centralizers of noncentral elements be abelian. Based on earlier\u0000published partial results we here give a complete proof of a slightly stronger\u0000result.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"28 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89856287","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
Geodesic Growth of Numbered Graph Products 编号图积的测地线生长
Q4 MATHEMATICS Pub Date : 2022-08-27 DOI: 10.46298/jgcc.2023.14.2.10019
Lindsay Marjanski, Vincent Solon, Frank Zheng, Kathleen Zopff
In this paper, we study geodesic growth of numbered graph products; these area generalization of right-angled Coxeter groups, defined as graph products offinite cyclic groups. We first define a graph-theoretic condition calledlink-regularity, as well as a natural equivalence amongst link-regular numberedgraphs, and show that numbered graph products associated to link-regularnumbered graphs must have the same geodesic growth series. Next, we derive aformula for the geodesic growth of right-angled Coxeter groups associated tolink-regular graphs. Finally, we find a system of equations that can be used tosolve for the geodesic growth of numbered graph products corresponding tolink-regular numbered graphs that contain no triangles and have constant vertexnumbering.
本文研究了带编号图积的测地线生长;这些直角Coxeter群的面积推广,定义为无限循环群的图积。我们首先定义了一个图论条件——链接正则性,以及链接正则编号图之间的自然等价,并证明了链接正则编号图的编号图积必须具有相同的测地线生长级数。其次,我们导出了与链正则图相关的直角Coxeter群的测地线生长公式。最后,我们找到了一个可用于求解不包含三角形且具有恒定顶点编号的链接正则编号图对应的带编号图积的测地线生长的方程组。
{"title":"Geodesic Growth of Numbered Graph Products","authors":"Lindsay Marjanski, Vincent Solon, Frank Zheng, Kathleen Zopff","doi":"10.46298/jgcc.2023.14.2.10019","DOIUrl":"https://doi.org/10.46298/jgcc.2023.14.2.10019","url":null,"abstract":"In this paper, we study geodesic growth of numbered graph products; these are\u0000a generalization of right-angled Coxeter groups, defined as graph products of\u0000finite cyclic groups. We first define a graph-theoretic condition called\u0000link-regularity, as well as a natural equivalence amongst link-regular numbered\u0000graphs, and show that numbered graph products associated to link-regular\u0000numbered graphs must have the same geodesic growth series. Next, we derive a\u0000formula for the geodesic growth of right-angled Coxeter groups associated to\u0000link-regular graphs. Finally, we find a system of equations that can be used to\u0000solve for the geodesic growth of numbered graph products corresponding to\u0000link-regular numbered graphs that contain no triangles and have constant vertex\u0000numbering.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"72 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83545543","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
The Axiomatics of Free Group Rings 自由群环的公理化
Q4 MATHEMATICS Pub Date : 2021-12-02 DOI: 10.46298/jgcc.2021.13.2.8796
B. Fine, A. Gaglione, M. Kreuzer, G. Rosenberger, D. Spellman
In [FGRS1,FGRS2] the relationship between the universal and elementary theoryof a group ring $R[G]$ and the corresponding universal and elementary theory ofthe associated group $G$ and ring $R$ was examined. Here we assume that $R$ isa commutative ring with identity $1 ne 0$. Of course, these are relative to anappropriate logical language $L_0,L_1,L_2$ for groups, rings and group ringsrespectively. Axiom systems for these were provided in [FGRS1]. In [FGRS1] itwas proved that if $R[G]$ is elementarily equivalent to $S[H]$ with respect to$L_{2}$, then simultaneously the group $G$ is elementarily equivalent to thegroup $H$ with respect to $L_{0}$, and the ring $R$ is elementarily equivalentto the ring $S$ with respect to $L_{1}$. We then let $F$ be a rank $2$ freegroup and $mathbb{Z}$ be the ring of integers. Examining the universal theoryof the free group ring ${mathbb Z}[F]$ the hazy conjecture was made that theuniversal sentences true in ${mathbb Z}[F]$ are precisely the universalsentences true in $F$ modified appropriately for group ring theory and theconverse that the universal sentences true in $F$ are the universal sentencestrue in ${mathbb Z}[F]$ modified appropriately for group theory. In this paperwe show this conjecture to be true in terms of axiom systems for ${mathbbZ}[F]$.
在[FGRS1,FGRS2]中,研究了群环$R[G]$的全称和初等理论与相应群$G$和环$R$的全称和初等理论之间的关系。这里我们假设$R$是具有单位元$1 ne0 $的交换环。当然,这些都是相对于适当的逻辑语言$L_0,L_1,L_2$,分别适用于群,环和群环。这些公理系统在[FGRS1]中提供。在[FGRS1]中证明了如果$R[G]$对$L_{2}$初等等价于$S[H]$,则同时群$G$对$L_{0}$初等等价于群$H$,环$R$对$L_{1}$初等等价于环$S$。然后设$F$为秩$2$ freegroup, $mathbb{Z}$为整数环。考察了自由群环${mathbb Z}[F]$的全称命题,提出了${mathbb Z}[F]$中的全称命题为真,即${mathbb Z}[F]$中的全称命题为真,即${mathbb Z}[F]$中全称命题为真,即${mathbb Z}[F]$中全称命题为真,即${mathbb Z}[F]$中全称命题为真,即${mathbb Z}[F]$中全称命题为真,即${mathbb Z}[F]$中全称命题为真。在本文中,我们用${mathbbZ}[F]$的公理系统证明了这个猜想的成立。
{"title":"The Axiomatics of Free Group Rings","authors":"B. Fine, A. Gaglione, M. Kreuzer, G. Rosenberger, D. Spellman","doi":"10.46298/jgcc.2021.13.2.8796","DOIUrl":"https://doi.org/10.46298/jgcc.2021.13.2.8796","url":null,"abstract":"In [FGRS1,FGRS2] the relationship between the universal and elementary theory\u0000of a group ring $R[G]$ and the corresponding universal and elementary theory of\u0000the associated group $G$ and ring $R$ was examined. Here we assume that $R$ is\u0000a commutative ring with identity $1 ne 0$. Of course, these are relative to an\u0000appropriate logical language $L_0,L_1,L_2$ for groups, rings and group rings\u0000respectively. Axiom systems for these were provided in [FGRS1]. In [FGRS1] it\u0000was proved that if $R[G]$ is elementarily equivalent to $S[H]$ with respect to\u0000$L_{2}$, then simultaneously the group $G$ is elementarily equivalent to the\u0000group $H$ with respect to $L_{0}$, and the ring $R$ is elementarily equivalent\u0000to the ring $S$ with respect to $L_{1}$. We then let $F$ be a rank $2$ free\u0000group and $mathbb{Z}$ be the ring of integers. Examining the universal theory\u0000of the free group ring ${mathbb Z}[F]$ the hazy conjecture was made that the\u0000universal sentences true in ${mathbb Z}[F]$ are precisely the universal\u0000sentences true in $F$ modified appropriately for group ring theory and the\u0000converse that the universal sentences true in $F$ are the universal sentences\u0000true in ${mathbb Z}[F]$ modified appropriately for group theory. In this paper\u0000we show this conjecture to be true in terms of axiom systems for ${mathbb\u0000Z}[F]$.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83076767","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
Finitely generated subgroups of free groups as formal languages and their cogrowth 作为形式语言的自由群的有限生成子群及其共生
Q4 MATHEMATICS Pub Date : 2021-06-22 DOI: 10.46298/jgcc.2021.13.2.7617
A. Darbinyan, R. Grigorchuk, Asif Shaikh
For finitely generated subgroups $H$ of a free group $F_m$ of finite rank$m$, we study the language $L_H$ of reduced words that represent $H$ which is aregular language. Using the (extended) core of Schreier graph of $H$, weconstruct the minimal deterministic finite automaton that recognizes $L_H$.Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible andfor such groups explicitly construct ergodic automaton that recognizes $L_H$.This construction gives us an efficient way to compute the cogrowth series$L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the methodand a comparison is made with the method of calculation of $L_H(z)$ based onthe use of Nielsen system of generators of $H$.
对于秩$m$的自由群$F_m$的有限生成子群$H$,我们研究了表示$H$的约简词的正则语言$L_H$。利用$H$的Schreier图的(扩展)核,我们构造了识别$L_H$的最小确定性有限自动机。然后我们刻画了$L_H$不可约的fg子群$H$,并为这些子群显式构造了识别$L_H$的遍历自动机。这种构造为计算$H$的协生长级数$L_H(z)$和$L_H$的熵提供了一种有效的方法。实例说明了该方法,并与基于Nielsen $H$生成器的$L_H(z)$计算方法进行了比较。
{"title":"Finitely generated subgroups of free groups as formal languages and\u0000 their cogrowth","authors":"A. Darbinyan, R. Grigorchuk, Asif Shaikh","doi":"10.46298/jgcc.2021.13.2.7617","DOIUrl":"https://doi.org/10.46298/jgcc.2021.13.2.7617","url":null,"abstract":"For finitely generated subgroups $H$ of a free group $F_m$ of finite rank\u0000$m$, we study the language $L_H$ of reduced words that represent $H$ which is a\u0000regular language. Using the (extended) core of Schreier graph of $H$, we\u0000construct the minimal deterministic finite automaton that recognizes $L_H$.\u0000Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and\u0000for such groups explicitly construct ergodic automaton that recognizes $L_H$.\u0000This construction gives us an efficient way to compute the cogrowth series\u0000$L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method\u0000and a comparison is made with the method of calculation of $L_H(z)$ based on\u0000the use of Nielsen system of generators of $H$.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74748874","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
Groups with context-free Diophantine problem 具有上下文无关丢番图问题的组
Q4 MATHEMATICS Pub Date : 2021-02-01 DOI: 10.46298/jgcc.2021.13.1.7347
V. Yankovskiy
We find algebraic conditions on a group equivalent to the position of itsDiophantine problem in the Chomsky Hierarchy. In particular, we prove that afinitely generated group has a context-free Diophantine problem if and only ifit is finite.
我们找到了一个群的代数条件,等价于它的丢芬图问题在乔姆斯基层次中的位置。特别地,我们证明了当且仅当有限生成群是有限的,它具有无关上下文的Diophantine问题。
{"title":"Groups with context-free Diophantine problem","authors":"V. Yankovskiy","doi":"10.46298/jgcc.2021.13.1.7347","DOIUrl":"https://doi.org/10.46298/jgcc.2021.13.1.7347","url":null,"abstract":"We find algebraic conditions on a group equivalent to the position of its\u0000Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a\u0000finitely generated group has a context-free Diophantine problem if and only if\u0000it is finite.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86044712","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 fibering theorem for 3-manifolds 3流形的成纤维定理
Q4 MATHEMATICS Pub Date : 2021-01-04 DOI: 10.46298/jgcc.2021.13.2.7072
Jordan Sahattchieve
We generalize a result of Moon on the fibering of certain 3-manifolds overthe circle. Our main theorem is the following: Let $M$ be a closed 3-manifold.Suppose that $G=pi_1(M)$ contains a finitely generated group $U$ of infiniteindex in $G$ which contains a non-trivial subnormal subgroup $Nneq mathbb{Z}$of $G$, and suppose that $N$ has a composition series of length $n$ in which atleast $n-1$ terms are finitely generated. Suppose that $N$ intersectsnontrivially the fundamental groups of the splitting tori given by theGeometrization Theorem and that the intersections of $N$ with the fundamentalgroups of the geometric pieces are non-trivial and not isomorphic to$mathbb{Z}$. Then, $M$ has a finite cover which is a bundle over $mathbb{S}$with fiber a compact surface $F$ such that $pi_1(F)$ and $U$ arecommensurable.
我们推广了月亮关于某些3-流形在圆上的纤维化的结果。我们的主要定理如下:设$M$是一个封闭的3流形。假设$G=pi_1(M)$在$G$中包含一个有限生成的infiniteindex群$U$,其中包含一个$G$的非平凡次正规子群$Nneq mathbb{Z}$,并假设$N$有一个长度为$n$的组合序列,其中至少有$n-1$个项是有限生成的。假设$N$与由几何化定理给出的分裂环面的基群非平凡相交,并且$N$与几何块的基群的相交非平凡且与$mathbb{Z}$不同构。然后,$M$有一个有限的覆盖物,它是一束在$mathbb{S}$上的纤维,一个紧凑的表面$F$,这样$pi_1(F)$和$U$是可通约的。
{"title":"A fibering theorem for 3-manifolds","authors":"Jordan Sahattchieve","doi":"10.46298/jgcc.2021.13.2.7072","DOIUrl":"https://doi.org/10.46298/jgcc.2021.13.2.7072","url":null,"abstract":"We generalize a result of Moon on the fibering of certain 3-manifolds over\u0000the circle. Our main theorem is the following: Let $M$ be a closed 3-manifold.\u0000Suppose that $G=pi_1(M)$ contains a finitely generated group $U$ of infinite\u0000index in $G$ which contains a non-trivial subnormal subgroup $Nneq mathbb{Z}$\u0000of $G$, and suppose that $N$ has a composition series of length $n$ in which at\u0000least $n-1$ terms are finitely generated. Suppose that $N$ intersects\u0000nontrivially the fundamental groups of the splitting tori given by the\u0000Geometrization Theorem and that the intersections of $N$ with the fundamental\u0000groups of the geometric pieces are non-trivial and not isomorphic to\u0000$mathbb{Z}$. Then, $M$ has a finite cover which is a bundle over $mathbb{S}$\u0000with fiber a compact surface $F$ such that $pi_1(F)$ and $U$ are\u0000commensurable.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89686536","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
Equations in virtually class 2 nilpotent groups 虚2类幂零群中的方程
Q4 MATHEMATICS Pub Date : 2020-09-22 DOI: 10.46298/jgcc.2022.14.1.9776
A. Levine
We give an algorithm that decides whether a single equation in a group thatis virtually a class $2$ nilpotent group with a virtually cyclic commutatorsubgroup, such as the Heisenberg group, admits a solution. This generalises thework of Duchin, Liang and Shapiro to finite extensions.
我们给出了一种算法,用于判定具有虚循环对易子群(如Heisenberg群)的虚类$2$幂零群中的单个方程是否有解。这将Duchin, Liang和Shapiro的工作推广到有限扩展。
{"title":"Equations in virtually class 2 nilpotent groups","authors":"A. Levine","doi":"10.46298/jgcc.2022.14.1.9776","DOIUrl":"https://doi.org/10.46298/jgcc.2022.14.1.9776","url":null,"abstract":"We give an algorithm that decides whether a single equation in a group that\u0000is virtually a class $2$ nilpotent group with a virtually cyclic commutator\u0000subgroup, such as the Heisenberg group, admits a solution. This generalises the\u0000work of Duchin, Liang and Shapiro to finite extensions.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"1635 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76281044","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 new method for solving the elliptic curve discrete logarithm problem 求解椭圆曲线离散对数问题的一种新方法
Q4 MATHEMATICS Pub Date : 2020-05-11 DOI: 10.46298/jgcc.2020.12.2.6649
Ansari Abdullah, A. Mahalanobis, V. Mallick
The elliptic curve discrete logarithm problem is considered a securecryptographic primitive. The purpose of this paper is to propose a paradigmshift in attacking the elliptic curve discrete logarithm problem. In thispaper, we will argue that initial minors are a viable way to solve thisproblem. This paper will present necessary algorithms for this attack. We havewritten a code to verify the conjecture of initial minors using Schurcomplements. We were able to solve the problem for groups of order up to$2^{50}$.Comment: 13 pages; revised for publication
椭圆曲线离散对数问题被认为是一个安全密码原语。本文的目的是提出一种解决椭圆曲线离散对数问题的范式转换。在本文中,我们将论证初始未成年人是解决这一问题的可行方法。本文将给出这种攻击的必要算法。我们编写了一个代码来验证使用schur补语的初始次元猜想。我们能够求解到$2^{50}$的组的问题。评论:13页;修订后出版
{"title":"A new method for solving the elliptic curve discrete logarithm problem","authors":"Ansari Abdullah, A. Mahalanobis, V. Mallick","doi":"10.46298/jgcc.2020.12.2.6649","DOIUrl":"https://doi.org/10.46298/jgcc.2020.12.2.6649","url":null,"abstract":"The elliptic curve discrete logarithm problem is considered a secure\u0000cryptographic primitive. The purpose of this paper is to propose a paradigm\u0000shift in attacking the elliptic curve discrete logarithm problem. In this\u0000paper, we will argue that initial minors are a viable way to solve this\u0000problem. This paper will present necessary algorithms for this attack. We have\u0000written a code to verify the conjecture of initial minors using Schur\u0000complements. We were able to solve the problem for groups of order up to\u0000$2^{50}$.\u0000Comment: 13 pages; revised for publication","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"9 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75605887","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}
引用次数: 4
期刊
Groups Complexity Cryptology
全部 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