首页 > 最新文献

Journal of Computational Algebra最新文献

英文 中文
Symmetric perfect 2-colorings of J(10,3) J(10,3) 的对称完全 2 色
Pub Date : 2024-11-19 DOI: 10.1016/j.jaca.2024.100028
Paul Tricot
{"title":"Symmetric perfect 2-colorings of J(10,3)","authors":"Paul Tricot","doi":"10.1016/j.jaca.2024.100028","DOIUrl":"10.1016/j.jaca.2024.100028","url":null,"abstract":"","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100028"},"PeriodicalIF":0.0,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142700264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improved computation of polynomial roots over number fields when using complex embeddings 使用复嵌入时改进数域上多项式根的计算
Pub Date : 2024-10-21 DOI: 10.1016/j.jaca.2024.100026
Andrea Lesavourey , Thomas Plantard , Willy Susilo
We explore a fairly generic method to compute roots of polynomials over number fields through complex embeddings. Our main contribution is to show how to use a structure of a relative extension to decode in a subfield. Additionally we describe several heuristic options to improve practical efficiency. We provide experimental data from our implementation and compare our methods to the state of the art algorithm implemented in Pari/Gp.
我们探索了一种相当通用的方法,通过复嵌入计算数域上多项式的根。我们的主要贡献在于展示了如何利用相对扩展结构在子字段中解码。此外,我们还介绍了几种启发式方案,以提高实际效率。我们提供了实现过程中的实验数据,并将我们的方法与在 Pari/Gp 中实现的最先进算法进行了比较。
{"title":"Improved computation of polynomial roots over number fields when using complex embeddings","authors":"Andrea Lesavourey ,&nbsp;Thomas Plantard ,&nbsp;Willy Susilo","doi":"10.1016/j.jaca.2024.100026","DOIUrl":"10.1016/j.jaca.2024.100026","url":null,"abstract":"<div><div>We explore a fairly generic method to compute roots of polynomials over number fields through complex embeddings. Our main contribution is to show how to use a structure of a relative extension to decode in a subfield. Additionally we describe several heuristic options to improve practical efficiency. We provide experimental data from our implementation and compare our methods to the state of the art algorithm implemented in <span>Pari/Gp</span>.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100026"},"PeriodicalIF":0.0,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142538675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Signature-based algorithm under non-compatible term orders and its application to change of ordering 非相容词序下基于签名的算法及其在更改词序中的应用
Pub Date : 2024-10-21 DOI: 10.1016/j.jaca.2024.100027
Masayuki Noro
The notion of the compatibility between a term order in a polynomial ring R and a module term order in Rl is crucial to ensure the termination of a signature-based algorithm for general input ideals. However, it is shown experimentally that the compatibility does not necessarily imply efficient computation. Our experiments show that combining non-compatible term orders can improve performance for computing Gröbner bases with respect to some term orders. In such cases, we can use the Hilbert function to guarantee the termination. The Hilbert function can be computed by using a Gröbner basis with respect to some term order and thus the resulting algorithm is considered a change of ordering algorithm. In this paper, we give the details of the new change of ordering algorithm and we compare its performance with that of the usual Hilbert-driven Buchberger algorithm and the Gröbner walk algorithm.
多项式环 R 中的阶次与 Rl 中的模块阶次之间的兼容性概念对于确保基于签名的一般输入理想算法的终止至关重要。然而,实验表明,兼容性并不一定意味着高效计算。我们的实验表明,结合不兼容的项阶可以提高计算格罗伯纳基时某些项阶的性能。在这种情况下,我们可以使用希尔伯特函数来保证终止。希尔伯特函数可以通过使用相对于某些术语阶的格罗伯纳基计算出来,因此由此产生的算法被认为是一种改变阶算法。在本文中,我们给出了新的改序算法的细节,并将其性能与通常的希尔伯特驱动布赫伯格算法和格罗伯纳行走算法进行了比较。
{"title":"Signature-based algorithm under non-compatible term orders and its application to change of ordering","authors":"Masayuki Noro","doi":"10.1016/j.jaca.2024.100027","DOIUrl":"10.1016/j.jaca.2024.100027","url":null,"abstract":"<div><div>The notion of the compatibility between a term order in a polynomial ring <em>R</em> and a module term order in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>l</mi></mrow></msup></math></span> is crucial to ensure the termination of a signature-based algorithm for general input ideals. However, it is shown experimentally that the compatibility does not necessarily imply efficient computation. Our experiments show that combining non-compatible term orders can improve performance for computing Gröbner bases with respect to some term orders. In such cases, we can use the Hilbert function to guarantee the termination. The Hilbert function can be computed by using a Gröbner basis with respect to some term order and thus the resulting algorithm is considered a change of ordering algorithm. In this paper, we give the details of the new change of ordering algorithm and we compare its performance with that of the usual Hilbert-driven Buchberger algorithm and the Gröbner walk algorithm.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100027"},"PeriodicalIF":0.0,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rational Askey–Wilson Bernstein bases and a multirational Askey–Wilson blossom 有理阿斯基-威尔逊伯恩斯坦基和多有理阿斯基-威尔逊花
Pub Date : 2024-10-21 DOI: 10.1016/j.jaca.2024.100025
Plamen Simeonov , Ron Goldman
We introduce and study the properties of new negative degree rational Bernstein bases associated with the Askey–Wilson operator and we use these bases to define new types of rational Bernstein-Bézier curves. We also introduce a new type of blossom, the multirational Askey–Wilson blossom. We prove that four axioms uniquely characterize this blossom and we provide an explicit formula for this multirational blossom involving a right inverse of the Askey–Wilson operator. A formula for the coefficients of a function expanded in a rational Askey–Wilson Bernstein basis in terms of certain values of the Askey–Wilson operator is derived. We also establish a dual functional property that expresses the coefficients of these new types of rational Bernstein–Bézier curves in terms of values of their multirational Askey–Wilson blossom.
我们介绍并研究了与阿斯基-威尔逊算子相关的新负度有理伯恩斯坦基的性质,并利用这些基定义了新型有理伯恩斯坦-贝塞尔曲线。我们还引入了一种新的绽放,即多有理阿斯基-威尔逊绽放。我们证明了四条公理唯一地描述了这种绽放,并提供了涉及阿斯基-威尔逊算子右逆的多向绽放的明确公式。根据阿斯基-威尔逊算子的某些值,我们得出了在有理阿斯基-威尔逊伯恩斯坦基础上展开的函数系数公式。我们还建立了一个对偶函数性质,用它们的多ational Askey-Wilson 开花的值来表示这些新型有理伯恩斯坦-贝塞尔曲线的系数。
{"title":"Rational Askey–Wilson Bernstein bases and a multirational Askey–Wilson blossom","authors":"Plamen Simeonov ,&nbsp;Ron Goldman","doi":"10.1016/j.jaca.2024.100025","DOIUrl":"10.1016/j.jaca.2024.100025","url":null,"abstract":"<div><div>We introduce and study the properties of new negative degree rational Bernstein bases associated with the Askey–Wilson operator and we use these bases to define new types of rational Bernstein-Bézier curves. We also introduce a new type of blossom, the <em>multirational Askey–Wilson blossom</em>. We prove that four axioms uniquely characterize this blossom and we provide an explicit formula for this multirational blossom involving a right inverse of the Askey–Wilson operator. A formula for the coefficients of a function expanded in a rational Askey–Wilson Bernstein basis in terms of certain values of the Askey–Wilson operator is derived. We also establish a dual functional property that expresses the coefficients of these new types of rational Bernstein–Bézier curves in terms of values of their multirational Askey–Wilson blossom.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100025"},"PeriodicalIF":0.0,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142560843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Factoring perfect reconstruction filter banks into causal lifting matrices: A Diophantine approach 将完美重构滤波器组分解为因果提升矩阵:一种二阶方法
Pub Date : 2024-10-09 DOI: 10.1016/j.jaca.2024.100024
Christopher M. Brislawn
The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices and wavelet transforms. The Diophantine approach generates causal factorizations satisfying certain polynomial degree-reducing inequalities, enabling a new factorization strategy called the Causal Complementation Algorithm. This provides a causal (i.e., polynomial, hence realizable) alternative to the noncausal lifting scheme developed by Daubechies and Sweldens using the Extended Euclidean Algorithm for Laurent polynomials. The new approach replaces the Euclidean Algorithm with Gaussian elimination employing a slight generalization of polynomial division that ensures existence and uniqueness of quotients whose remainders satisfy user-specified divisibility constraints. The Causal Complementation Algorithm is shown to be more general than the causal version of the Euclidean Algorithm approach by generating additional causal lifting factorizations beyond those obtainable using the polynomial Euclidean Algorithm.
多项式环上的双变量线性二叉方程的基本理论被用于构建因果双通道 FIR 完美重构传递矩阵和小波变换的因果提升因式分解(基本矩阵分解)。Diophantine 方法生成的因果因数化满足某些多项式程度递减不等式,从而实现了一种名为 "因果补全算法 "的新因数化策略。这为道贝奇斯(Daubechies)和斯韦尔登斯(Sweldens)利用扩展欧几里得算法为劳伦多项式开发的非因果提升方案提供了因果(即多项式,因此可实现)替代方案。新方法用高斯消元法取代欧几里得算法,采用多项式除法的轻微广义化,确保余数满足用户指定的可分性约束的商的存在性和唯一性。因果互补算法比欧几里得算法的因果版本更具通用性,因为它可以生成多项式欧几里得算法所无法获得的因果提升因式。
{"title":"Factoring perfect reconstruction filter banks into causal lifting matrices: A Diophantine approach","authors":"Christopher M. Brislawn","doi":"10.1016/j.jaca.2024.100024","DOIUrl":"10.1016/j.jaca.2024.100024","url":null,"abstract":"<div><div>The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices and wavelet transforms. The Diophantine approach generates causal factorizations satisfying certain polynomial degree-reducing inequalities, enabling a new factorization strategy called the <em>Causal Complementation Algorithm</em>. This provides a causal (i.e., polynomial, hence <em>realizable</em>) alternative to the noncausal lifting scheme developed by Daubechies and Sweldens using the Extended Euclidean Algorithm for Laurent polynomials. The new approach replaces the Euclidean Algorithm with Gaussian elimination employing a slight generalization of polynomial division that ensures existence and uniqueness of quotients whose remainders satisfy user-specified divisibility constraints. The Causal Complementation Algorithm is shown to be more general than the causal version of the Euclidean Algorithm approach by generating additional causal lifting factorizations beyond those obtainable using the polynomial Euclidean Algorithm.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100024"},"PeriodicalIF":0.0,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142530144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New condensation methods with applications to the computation of Brauer character tables 应用于计算布劳尔字符表的新凝聚方法
Pub Date : 2024-10-02 DOI: 10.1016/j.jaca.2024.100023
Klaus Lux , A.J.E. Ryba
Condensation is a technique that can often predict a Brauer character table of a finite group with a very high degree of confidence, but without a proof of correctness. In this paper we describe a strategy that can give such a proof. We introduce and apply two novel condensation methods: virtual tensor condensation and the condensation of bilinear forms. We illustrate our strategy and new techniques with examples taken from our computation of the 5-modular Brauer character table of the sporadic simple Lyons group.
凝缩是一种技术,通常能以极高的置信度预测有限群的布劳尔特征表,但却无法证明其正确性。在本文中,我们描述了一种可以给出这种证明的策略。我们引入并应用了两种新颖的凝聚方法:虚拟张量凝聚和双线性形式凝聚。我们以计算零星简单里昂群的 5 模布劳尔特征表为例,说明我们的策略和新技术。
{"title":"New condensation methods with applications to the computation of Brauer character tables","authors":"Klaus Lux ,&nbsp;A.J.E. Ryba","doi":"10.1016/j.jaca.2024.100023","DOIUrl":"10.1016/j.jaca.2024.100023","url":null,"abstract":"<div><div>Condensation is a technique that can often predict a Brauer character table of a finite group with a very high degree of confidence, but without a proof of correctness. In this paper we describe a strategy that can give such a proof. We introduce and apply two novel condensation methods: virtual tensor condensation and the condensation of bilinear forms. We illustrate our strategy and new techniques with examples taken from our computation of the 5-modular Brauer character table of the sporadic simple Lyons group.</div></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"12 ","pages":"Article 100023"},"PeriodicalIF":0.0,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142419705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Monomial-agnostic computation of vanishing ideals 消失理想的一元对立计算
Pub Date : 2024-09-01 DOI: 10.1016/j.jaca.2024.100022
Hiroshi Kera , Yoshihiko Hasegawa

Approximate basis computation of vanishing ideals has recently been studied extensively in computational algebra and data-driven applications such as machine learning. However, symbolic computation and the dependency on term order remain essential gaps between the two fields. In this study, we present the first monomial-agnostic basis computation, which works fully numerically with proper normalization and without term order. This is realized by gradient normalization, a newly proposed data-dependent normalization that normalizes a polynomial with the magnitude of gradients at given points. Its data-dependent nature brings various advantages: i) efficient resolution of the spurious vanishing problem, the scale-variance issue of approximately vanishing polynomials, without accessing coefficients of terms, ii) scaling-consistent basis computation, ensuring that input scaling does not lead to an essential change in the output, and iii) robustness against input perturbations, where the upper bound of error is determined only by the magnitude of the perturbations. Existing studies did not achieve any of these. As further applications of gradient information, we propose a monomial-agnostic basis reduction method and a regularization method to manage positive-dimensional ideals.

近来,计算代数和数据驱动应用(如机器学习)对消失理想的近似基础计算进行了广泛研究。然而,符号计算和对项阶的依赖仍然是这两个领域之间的重要差距。在本研究中,我们首次提出了单项式无关基础计算,它可以通过适当的归一化实现完全数值计算,且无需项阶。这是通过梯度归一化实现的,梯度归一化是一种新提出的依赖数据的归一化,它根据给定点的梯度大小对多项式进行归一化。它与数据相关的特性带来了各种优势:i) 有效解决虚假消失问题,即近似消失多项式的尺度方差问题,而无需访问项的系数;ii) 与缩放一致的基础计算,确保输入缩放不会导致输出的本质变化;iii) 对输入扰动的鲁棒性,误差上限仅由扰动的大小决定。现有的研究并没有实现上述任何一点。作为梯度信息的进一步应用,我们提出了一种与单项式无关的基础缩减方法和一种管理正维理想的正则化方法。
{"title":"Monomial-agnostic computation of vanishing ideals","authors":"Hiroshi Kera ,&nbsp;Yoshihiko Hasegawa","doi":"10.1016/j.jaca.2024.100022","DOIUrl":"10.1016/j.jaca.2024.100022","url":null,"abstract":"<div><p>Approximate basis computation of vanishing ideals has recently been studied extensively in computational algebra and data-driven applications such as machine learning. However, symbolic computation and the dependency on term order remain essential gaps between the two fields. In this study, we present the first <em>monomial-agnostic</em> basis computation, which works fully numerically with proper normalization and without term order. This is realized by gradient normalization, a newly proposed data-dependent normalization that normalizes a polynomial with the magnitude of gradients at given points. Its data-dependent nature brings various advantages: i) efficient resolution of the spurious vanishing problem, the scale-variance issue of approximately vanishing polynomials, without accessing coefficients of terms, ii) scaling-consistent basis computation, ensuring that input scaling does not lead to an essential change in the output, and iii) robustness against input perturbations, where the upper bound of error is determined only by the magnitude of the perturbations. Existing studies did not achieve any of these. As further applications of gradient information, we propose a monomial-agnostic basis reduction method and a regularization method to manage positive-dimensional ideals.</p></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"11 ","pages":"Article 100022"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772827724000123/pdfft?md5=06e4502098d7758928fc1fb98de7de21&pid=1-s2.0-S2772827724000123-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Conjugacy class fusion from four maximal subgroups of the Monster 怪物的四个最大子群的共轭类融合
Pub Date : 2024-07-25 DOI: 10.1016/j.jaca.2024.100021
Anthony Pisani, Tomasz Popiel

We determine the conjugacy class fusion from certain maximal subgroups of the Monster to the Monster, to justify the addition of these data to the Character Table Library in the computational algebra system GAP. The maximal subgroups in question are (PSL2(11)×PSL2(11)):4, 112:(5×2A5), 72:SL2(7), and PSL2(19):2. Our proofs are supported by reproducible calculations carried out using the Python package mmgroup, a computational construction of the Monster recently developed by Seysen.

我们确定了从怪兽的某些最大子群到怪兽的共轭类融合,以证明将这些数据添加到计算代数系统 GAP 中的字符表库是合理的。这些最大子群是 (PSL2(11)×PSL2(11)):4, 112:(5×2A5), 72:SL2(7) 和 PSL2(19):2。我们的证明得到了使用 Python 软件包 mmgroup 进行的可重复计算的支持。
{"title":"Conjugacy class fusion from four maximal subgroups of the Monster","authors":"Anthony Pisani,&nbsp;Tomasz Popiel","doi":"10.1016/j.jaca.2024.100021","DOIUrl":"10.1016/j.jaca.2024.100021","url":null,"abstract":"<div><p>We determine the conjugacy class fusion from certain maximal subgroups of the Monster to the Monster, to justify the addition of these data to the Character Table Library in the computational algebra system <span>GAP</span>. The maximal subgroups in question are <span><math><mo>(</mo><msub><mrow><mi>PSL</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mn>11</mn><mo>)</mo><mo>×</mo><msub><mrow><mi>PSL</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mn>11</mn><mo>)</mo><mo>)</mo><mo>:</mo><mn>4</mn></math></span>, <span><math><msup><mrow><mn>11</mn></mrow><mrow><mn>2</mn></mrow></msup><mo>:</mo><mo>(</mo><mn>5</mn><mo>×</mo><mn>2</mn><msub><mrow><mtext>A</mtext></mrow><mrow><mn>5</mn></mrow></msub><mo>)</mo></math></span>, <span><math><msup><mrow><mn>7</mn></mrow><mrow><mn>2</mn></mrow></msup><mo>:</mo><msub><mrow><mtext>SL</mtext></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mn>7</mn><mo>)</mo></math></span>, and <span><math><msub><mrow><mi>PSL</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mn>19</mn><mo>)</mo><mo>:</mo><mn>2</mn></math></span>. Our proofs are supported by reproducible calculations carried out using the Python package <span>mmgroup</span>, a computational construction of the Monster recently developed by Seysen.</p></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"11 ","pages":"Article 100021"},"PeriodicalIF":0.0,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772827724000111/pdfft?md5=fd5301cf7429637c74f4589c0775b2d1&pid=1-s2.0-S2772827724000111-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141962951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Explicit construction of a plane sextic model for genus-five Howe curves, II 五属豪曲线平面六分模型的显式构建,II
Pub Date : 2024-07-17 DOI: 10.1016/j.jaca.2024.100019
Momonari Kudo

A Howe curve is defined as the normalization of the fiber product over a projective line of two hyperelliptic curves. Howe curves are very useful to produce important classes of curves over fields of positive characteristic, e.g., maximal, superspecial, or supersingular ones. Determining their feasible equations explicitly is a basic problem, and it has been solved in the hyperelliptic case and in the non-hyperelliptic case with genus not greater than 4. In this paper, we construct an explicit plane sextic model for non-hyperelliptic Howe curves of genus 5. We also determine the number and type of singularities on our sextic model, and prove that the singularities are generically 4 double points. Our results together with Moriya-Kudo's recent ones imply that for each s{2,3,4,5}, there exists a non-hyperelliptic curve H of genus 5 with Aut(H)V4 such that its associated plane sextic has s double points.

豪曲线的定义是两条超椭圆曲线在投影线上的纤维积的归一化。豪曲线对于产生正特征域上的重要曲线类别非常有用,例如最大曲线、超特殊曲线或超奇异曲线。明确地确定它们的可行方程是一个基本问题,在超椭圆情况和属不大于 4 的非超椭圆情况下,这个问题已经解决。我们还确定了六分模型上奇点的数量和类型,并证明奇点一般为 4 双点。我们的结果和森谷工藤的最新结果意味着,对于每个 s∈{2,3,4,5},都存在一条属 5 的非全椭圆曲线 H,其 Aut(H)⊃V4 使得其相关的平面六分仪有 s 个双点。
{"title":"Explicit construction of a plane sextic model for genus-five Howe curves, II","authors":"Momonari Kudo","doi":"10.1016/j.jaca.2024.100019","DOIUrl":"10.1016/j.jaca.2024.100019","url":null,"abstract":"<div><p>A <em>Howe curve</em> is defined as the normalization of the fiber product over a projective line of two hyperelliptic curves. Howe curves are very useful to produce important classes of curves over fields of positive characteristic, e.g., maximal, superspecial, or supersingular ones. Determining their feasible equations explicitly is a basic problem, and it has been solved in the hyperelliptic case and in the non-hyperelliptic case with genus not greater than 4. In this paper, we construct an explicit plane sextic model for non-hyperelliptic Howe curves of genus 5. We also determine the number and type of singularities on our sextic model, and prove that the singularities are generically 4 double points. Our results together with Moriya-Kudo's recent ones imply that for each <span><math><mi>s</mi><mo>∈</mo><mo>{</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>,</mo><mn>5</mn><mo>}</mo></math></span>, there exists a non-hyperelliptic curve <em>H</em> of genus 5 with <span><math><mrow><mi>Aut</mi></mrow><mo>(</mo><mi>H</mi><mo>)</mo><mo>⊃</mo><msub><mrow><mi>V</mi></mrow><mrow><mn>4</mn></mrow></msub></math></span> such that its associated plane sextic has <em>s</em> double points.</p></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"11 ","pages":"Article 100019"},"PeriodicalIF":0.0,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772827724000093/pdfft?md5=3625c91a9b897ff1d916dbfe0aef7474&pid=1-s2.0-S2772827724000093-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141962691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing superspecial hyperelliptic curves of genus 4 with automorphism group properly containing the Klein 4-group 计算属 4 的超特殊超椭圆曲线,其自形群适当包含克莱因 4 群
Pub Date : 2024-07-15 DOI: 10.1016/j.jaca.2024.100020
Ryo Ohashi , Momonari Kudo

In algebraic geometry or number theory, enumerating or finding superspecial curves in positive characteristic p is important both in theory and in computation. In this paper, we propose feasible algorithms to enumerate or find superspecial hyperelliptic curves of genus 4 with automorphism group properly containing the Klein 4-group. By executing the algorithms on Magma, we succeeded in enumerating such superspecial curves for all primes p with 19p<500, and in finding a single one for all primes p with 19p<7000.

在代数几何或数论中,枚举或寻找正特征 p 的超特曲线在理论和计算上都很重要。在本文中,我们提出了可行的算法来枚举或寻找属 4 的超特殊超椭圆曲线,其自形群正确地包含克莱因 4 群。通过在 Magma 上执行这些算法,我们成功地枚举了 19≤p<500 的所有素数 p 的超特殊曲线,并为 19≤p<7000 的所有素数 p 找到了一条超特殊曲线。
{"title":"Computing superspecial hyperelliptic curves of genus 4 with automorphism group properly containing the Klein 4-group","authors":"Ryo Ohashi ,&nbsp;Momonari Kudo","doi":"10.1016/j.jaca.2024.100020","DOIUrl":"10.1016/j.jaca.2024.100020","url":null,"abstract":"<div><p>In algebraic geometry or number theory, enumerating or finding superspecial curves in positive characteristic <em>p</em> is important both in theory and in computation. In this paper, we propose feasible algorithms to enumerate or find superspecial hyperelliptic curves of genus 4 with automorphism group properly containing the Klein 4-group. By executing the algorithms on Magma, we succeeded in enumerating such superspecial curves for all primes <em>p</em> with <span><math><mn>19</mn><mo>≤</mo><mi>p</mi><mo>&lt;</mo><mn>500</mn></math></span>, and in finding a single one for all primes <em>p</em> with <span><math><mn>19</mn><mo>≤</mo><mi>p</mi><mo>&lt;</mo><mn>7000</mn></math></span>.</p></div>","PeriodicalId":100767,"journal":{"name":"Journal of Computational Algebra","volume":"11 ","pages":"Article 100020"},"PeriodicalIF":0.0,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S277282772400010X/pdfft?md5=6a6ccd7910eddd0166ae65a5fd559961&pid=1-s2.0-S277282772400010X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141959415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Computational Algebra
全部 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