Journal of Symbolic Computation最新文献

筛选
英文 中文
Positive definiteness of infinite and finite dimensional generalized Hilbert tensors and generalized Cauchy tensor 无限维和有限维广义希尔伯特张量和广义考奇张量的正定性
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-04-02 DOI: 10.1016/j.jsc.2024.102326
Yujin Paek, Jinhyok Kim, Songryong Pak
{"title":"Positive definiteness of infinite and finite dimensional generalized Hilbert tensors and generalized Cauchy tensor","authors":"Yujin Paek,&nbsp;Jinhyok Kim,&nbsp;Songryong Pak","doi":"10.1016/j.jsc.2024.102326","DOIUrl":"https://doi.org/10.1016/j.jsc.2024.102326","url":null,"abstract":"<div><p>An Infinite and finite dimensional generalized Hilbert tensor with <em>a</em> is positive definite if and only if <span><math><mi>a</mi><mo>&gt;</mo><mn>0</mn></math></span>. The infinite dimensional generalized Hilbert tensor related operators <span><math><msub><mrow><mi>F</mi></mrow><mrow><mo>∞</mo></mrow></msub></math></span> and <span><math><msub><mrow><mi>T</mi></mrow><mrow><mo>∞</mo></mrow></msub></math></span> are bounded, continuous and positively homogeneous. A generalized Cauchy tensor of which generating vectors are <span><math><mi>c</mi><mo>,</mo><mi>d</mi></math></span> is positive definite if and only if every element of vector <em>d</em> is not zero and each element of vector <em>c</em> is positive and mutually distinct. The 4th order <em>n</em>-dimensional generalized Cauchy tensor is matrix positive semi-definite if and only if every element of generating vector <em>c</em> is positive. Finally, the other properties of generalized Cauchy tensor are presented.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102326"},"PeriodicalIF":0.7,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140548504","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
On parametric semidefinite programming with unknown boundaries 关于具有未知边界的参数半定量程序设计
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-04-02 DOI: 10.1016/j.jsc.2024.102324
Jonathan D. Hauenstein , Tingting Tang
{"title":"On parametric semidefinite programming with unknown boundaries","authors":"Jonathan D. Hauenstein ,&nbsp;Tingting Tang","doi":"10.1016/j.jsc.2024.102324","DOIUrl":"https://doi.org/10.1016/j.jsc.2024.102324","url":null,"abstract":"<div><p>In this paper, we study parametric semidefinite programs (SDPs) where the solution space of both the primal and dual problems change simultaneously. Given a bounded set, we aim to find the <em>a priori</em> unknown maximal permissible perturbation set within it where the semidefinite program problem has a unique optimum and is analytic with respect to the parameters. Our approach reformulates the parametric SDP as a system of partial differential equations (PDEs) where this maximal analytical permissible set (MAPS) is the set on which the system of PDEs is well-posed. A sweeping Euler scheme is developed to approximate this <em>a priori</em> unknown perturbation set. We prove local and global error bounds for this second-order sweeping Euler scheme and demonstrate the method in comparison to existing SDP solvers and its performance on several two-parameter and three-parameter SDPs for which the MAPS can be visualized.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102324"},"PeriodicalIF":0.7,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140540318","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
Short proofs of ideal membership 理想成员资格的简短证明
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-04-02 DOI: 10.1016/j.jsc.2024.102325
Clemens Hofstadler , Thibaut Verron
{"title":"Short proofs of ideal membership","authors":"Clemens Hofstadler ,&nbsp;Thibaut Verron","doi":"10.1016/j.jsc.2024.102325","DOIUrl":"https://doi.org/10.1016/j.jsc.2024.102325","url":null,"abstract":"<div><p>A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more complicated than others. In this work, we consider the problem of computing sparsest cofactor representations, i.e., representations with a minimal number of terms, of a given element in a polynomial ideal. While we focus on the more general case of noncommutative polynomials, all results also apply to the commutative setting.</p><p>We show that the problem of computing cofactor representations with a bounded number of terms is decidable and <span><math><mtext>NP</mtext></math></span>-complete. Moreover, we provide a practical algorithm for computing sparse (not necessarily optimal) representations by translating the problem into a linear optimization problem and by exploiting properties of signature-based Gröbner basis algorithms. We show that, for a certain class of ideals, representations computed by this method are actually optimal, and we present experimental data illustrating that it can lead to noticeably sparser cofactor representations.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102325"},"PeriodicalIF":0.7,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0747717124000294/pdfft?md5=fc06471a76a7e331737ea355a494162b&pid=1-s2.0-S0747717124000294-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140540319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the connectedness of multistationarity regions of small reaction networks 论小型反应网络多稳态区域的连通性
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-03-15 DOI: 10.1016/j.jsc.2024.102323
Allison McClure, Anne Shiu
{"title":"On the connectedness of multistationarity regions of small reaction networks","authors":"Allison McClure,&nbsp;Anne Shiu","doi":"10.1016/j.jsc.2024.102323","DOIUrl":"10.1016/j.jsc.2024.102323","url":null,"abstract":"<div><p>A multistationarity region is the part of a reaction network's parameter space that gives rise to multiple steady states. Mathematically, this region consists of the positive parameters for which a parametrized family of polynomial equations admits two or more positive roots. Much recent work has focused on analyzing multistationarity regions of biologically significant reaction networks and determining whether such regions are connected; indeed, a better understanding of the topology and geometry of such regions may help elucidate how robust multistationarity is to perturbations. Here we focus on the multistationarity regions of small networks, those with few species and few reactions. For two families of such networks – those with one species and up to three reactions, and those with two species and up to two reactions – we prove that the resulting multistationarity regions are connected. We also give an example of a network with one species and six reactions for which the multistationarity region is disconnected. Our proofs rely on the formula for the discriminant of a trinomial, a classification of small multistationary networks, and a recent result of Feliu and Telek that partially generalizes Descartes' rule of signs.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102323"},"PeriodicalIF":0.7,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140196310","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
The integral closure of a primary ideal is not always primary 原初理想的积分封闭并不总是原初的
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-03-06 DOI: 10.1016/j.jsc.2024.102315
Nan Li , Zijia Li , Zhi-Hong Yang , Lihong Zhi
{"title":"The integral closure of a primary ideal is not always primary","authors":"Nan Li ,&nbsp;Zijia Li ,&nbsp;Zhi-Hong Yang ,&nbsp;Lihong Zhi","doi":"10.1016/j.jsc.2024.102315","DOIUrl":"10.1016/j.jsc.2024.102315","url":null,"abstract":"<div><p>In <span>1936</span>, Krull asked if the integral closure of a primary ideal is still primary. Fifty years later, Huneke partially answered this question by giving a primary polynomial ideal whose integral closure is not primary in a regular local ring of characteristic <span><math><mi>p</mi><mo>=</mo><mn>2</mn></math></span>. We provide counterexamples to Krull's question regarding polynomial rings over any fields. We also find that the Jacobian ideal <em>J</em> of the polynomial <span><math><mi>f</mi><mo>=</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>6</mn></mrow></msup><mo>+</mo><msup><mrow><mi>y</mi></mrow><mrow><mn>6</mn></mrow></msup><mo>+</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>4</mn></mrow></msup><mi>z</mi><mi>t</mi><mo>+</mo><msup><mrow><mi>z</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span> given by <span>Briançon and Speder (1975)</span> is a counterexample to Krull's question.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102315"},"PeriodicalIF":0.7,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140071563","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
Solving polynomial systems over non-fields and applications to modular polynomial factoring 求解非域上的多项式系统及其在模态多项式因式分解中的应用
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-03-05 DOI: 10.1016/j.jsc.2024.102314
Sayak Chakrabarti, Ashish Dwivedi, Nitin Saxena
{"title":"Solving polynomial systems over non-fields and applications to modular polynomial factoring","authors":"Sayak Chakrabarti,&nbsp;Ashish Dwivedi,&nbsp;Nitin Saxena","doi":"10.1016/j.jsc.2024.102314","DOIUrl":"10.1016/j.jsc.2024.102314","url":null,"abstract":"&lt;div&gt;&lt;p&gt;We study the problem of solving a system of &lt;em&gt;m&lt;/em&gt; polynomials in &lt;em&gt;n&lt;/em&gt; variables over the ring of integers modulo a prime-power &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt;. The problem over finite fields is well studied in varied parameter settings. For small characteristic &lt;span&gt;&lt;math&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;, Lokshtanov et al. (SODA'17) initiated the study, for degree &lt;span&gt;&lt;math&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; systems, to improve the exhaustive search complexity of &lt;span&gt;&lt;math&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mtext&gt;poly&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; to &lt;span&gt;&lt;math&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;0.8765&lt;/mn&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mtext&gt;poly&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;; which currently is improved to &lt;span&gt;&lt;math&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;0.6943&lt;/mn&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;⋅&lt;/mo&gt;&lt;mtext&gt;poly&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; in Dinur (SODA'21). For large &lt;em&gt;p&lt;/em&gt; but constant &lt;em&gt;n&lt;/em&gt;, Huang and Wong (FOCS'96) gave a randomized &lt;span&gt;&lt;math&gt;&lt;mtext&gt;poly&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;log&lt;/mi&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; time algorithm. Note that for growing &lt;em&gt;n&lt;/em&gt;, system-solving is known to be &lt;em&gt;intractable&lt;/em&gt; even with &lt;span&gt;&lt;math&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; and degree &lt;span&gt;&lt;math&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;.&lt;/p&gt;&lt;p&gt;We devise a randomized &lt;span&gt;&lt;math&gt;&lt;mtext&gt;poly&lt;/mtext&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;d&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;log&lt;/mi&gt;&lt;mo&gt;⁡&lt;/mo&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-time algorithm to find a root of a given system of &lt;em&gt;m&lt;/em&gt; integral polynomials of degrees bounded by &lt;em&gt;d&lt;/em&gt;, in &lt;em&gt;n&lt;/em&gt; variables, modulo a prime power &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt;; when &lt;span&gt;&lt;math&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; is constant. In a way, we extend the efficient algorithm of Huang and Wong (FOCS'96) for system-solving over Galois fields (i.e., characteristic &lt;em&gt;p&lt;/em&gt;) to system-solving over Galois &lt;em&gt;rings&lt;/em&gt; (i.e., characteristic &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt;); when &lt;span&gt;&lt;math&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;&gt;&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; is constant. The challenge here is to find a lift of &lt;em&gt;singular&lt;/em&gt; &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;-roots (exponentially many); as there is no efficient general way known in algebraic-geometry for resolving singularities.&lt;/p&gt;&lt;p&gt;Our algorithm has applications to factoring univariate polynomials over Galois rings. Given &lt;span&gt;&lt;math&gt;&lt;mi&gt;f&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;Z&lt;/mi&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;]","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102314"},"PeriodicalIF":0.7,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140071367","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 computational approach to almost-inner derivations 几乎是内推导的计算方法
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-03-04 DOI: 10.1016/j.jsc.2024.102312
Heiko Dietrich , Willem A. de Graaf
{"title":"A computational approach to almost-inner derivations","authors":"Heiko Dietrich ,&nbsp;Willem A. de Graaf","doi":"10.1016/j.jsc.2024.102312","DOIUrl":"https://doi.org/10.1016/j.jsc.2024.102312","url":null,"abstract":"<div><p>We present a computational approach to determine the space of almost-inner derivations of a finite dimensional Lie algebra given by a structure constant table. We also present an example of a Lie algebra for which the quotient algebra of the almost-inner derivations modulo the inner derivations is non-abelian. This answers a question of Kunyavskii and Ostapenko.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102312"},"PeriodicalIF":0.7,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0747717124000166/pdfft?md5=158ca0ceced5645dd3d6b5c19e5bfa5f&pid=1-s2.0-S0747717124000166-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140051681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stabilized recovery and model reduction for multivariate exponential polynomials 多变量指数多项式的稳定恢复和模型还原
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-03-01 DOI: 10.1016/j.jsc.2024.102313
Juan Manuel Peña , Tomas Sauer
{"title":"Stabilized recovery and model reduction for multivariate exponential polynomials","authors":"Juan Manuel Peña ,&nbsp;Tomas Sauer","doi":"10.1016/j.jsc.2024.102313","DOIUrl":"https://doi.org/10.1016/j.jsc.2024.102313","url":null,"abstract":"<div><p>Recovery of multivariate exponential polynomials, i.e., the multivariate version of Prony's problem, can be stabilized by using more than the minimally needed multiinteger samples of the function. We present an algorithm that takes into account this extra information and prove a backward error estimate for the algebraic recovery method SMILE. In addition, we give a method to approximate data by an exponential polynomial sequence of a given structure as a step in the direction of multivariate model reduction.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102313"},"PeriodicalIF":0.7,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0747717124000178/pdfft?md5=a03807abfc64e6721e202a9e27a5dbdf&pid=1-s2.0-S0747717124000178-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140051680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing a group action from the class field theory of imaginary hyperelliptic function fields 从类场论计算虚超椭圆函数场的群作用
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-03-01 DOI: 10.1016/j.jsc.2024.102311
Antoine Leudière, Pierre-Jean Spaenlehauer
{"title":"Computing a group action from the class field theory of imaginary hyperelliptic function fields","authors":"Antoine Leudière,&nbsp;Pierre-Jean Spaenlehauer","doi":"10.1016/j.jsc.2024.102311","DOIUrl":"https://doi.org/10.1016/j.jsc.2024.102311","url":null,"abstract":"<div><p>We explore algorithmic aspects of a simply transitive commutative group action coming from the class field theory of imaginary hyperelliptic function fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> acts on a subset of isomorphism classes of Drinfeld modules. We describe an algorithm to compute the group action efficiently. This is a function field analog of the Couveignes-Rostovtsev-Stolbunov group action. We report on an explicit computation done with our proof-of-concept C++/NTL implementation; it took a fraction of a second on a standard computer. We prove that the problem of inverting the group action reduces to the problem of finding isogenies of fixed <em>τ</em>-degree between Drinfeld <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>[</mo><mi>X</mi><mo>]</mo></math></span>-modules, which is solvable in polynomial time thanks to an algorithm by Wesolowski. We give asymptotic complexity bounds for all algorithms presented in this paper.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102311"},"PeriodicalIF":0.7,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140051678","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
Matrix factorizations of the discriminant of Sn S 判别式的矩阵因式分解
IF 0.7 4区 数学
Journal of Symbolic Computation Pub Date : 2024-02-23 DOI: 10.1016/j.jsc.2024.102310
Eleonore Faber , Colin Ingalls , Simon May , Marco Talarico
{"title":"Matrix factorizations of the discriminant of Sn","authors":"Eleonore Faber ,&nbsp;Colin Ingalls ,&nbsp;Simon May ,&nbsp;Marco Talarico","doi":"10.1016/j.jsc.2024.102310","DOIUrl":"10.1016/j.jsc.2024.102310","url":null,"abstract":"<div><p>Consider the symmetric group <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> acting as a reflection group on the polynomial ring <span><math><mi>k</mi><mo>[</mo><msub><mrow><mi>x</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>]</mo></math></span> where <em>k</em> is a field, such that Char(<em>k</em>) does not divide <em>n</em>!. We use Higher Specht polynomials to construct matrix factorizations of the discriminant of this group action: these matrix factorizations are indexed by partitions of <em>n</em> and respect the decomposition of the coinvariant algebra into isotypical components. The maximal Cohen–Macaulay modules associated to these matrix factorizations give rise to a noncommutative resolution of the discriminant and they correspond to the nontrivial irreducible representations of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. All our constructions are implemented in Macaulay2 and we provide several examples. We also discuss extensions of these results to Young subgroups of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and indicate how to generalize them to the reflection groups <span><math><mi>G</mi><mo>(</mo><mi>m</mi><mo>,</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>)</mo></math></span>.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"125 ","pages":"Article 102310"},"PeriodicalIF":0.7,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0747717124000142/pdfft?md5=688baaec9b10f27e6369b86c65d8e101&pid=1-s2.0-S0747717124000142-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术官方微信