发布求助
文献互助 智能选刊 最新文献

Journal of Symbolic Computation最新文献

筛选
英文 中文
Exact moment representation in polynomial optimization
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-11-26 DOI: 10.1016/j.jsc.2024.102403
Lorenzo Baldi, Bernard Mourrain
{"title":"Exact moment representation in polynomial optimization","authors":"Lorenzo Baldi,&nbsp;Bernard Mourrain","doi":"10.1016/j.jsc.2024.102403","DOIUrl":"10.1016/j.jsc.2024.102403","url":null,"abstract":"<div><div>We investigate the problem of representing moment sequences by measures in the context of Polynomial Optimization Problems, that consist in finding the infimum of a real polynomial on a real semialgebraic set defined by polynomial inequalities. We analyze the exactness of Moment Matrix (MoM) hierarchies, dual to the Sum of Squares (SoS) hierarchies, which are sequences of convex cones introduced by Lasserre to approximate measures and positive polynomials. We investigate in particular flat truncation properties, which allow testing effectively when MoM exactness holds and recovering the minimizers.</div><div>We show that the dual of the MoM hierarchy coincides with the SoS hierarchy extended with the real radical of the support of the defining quadratic module <em>Q</em>. We deduce that flat truncation happens if and only if the support of the quadratic module associated with the minimizers is of dimension zero. We also bound the order of the hierarchy at which flat truncation holds.</div><div>As corollaries, we show that flat truncation and MoM exactness hold when regularity conditions, known as Boundary Hessian Conditions, hold (and thus that MoM exactness holds generically); and when the support of the quadratic module <em>Q</em> is zero-dimensional. Effective numerical computations illustrate these flat truncation properties.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"129 ","pages":"Article 102403"},"PeriodicalIF":0.6,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143159663","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
Sections of Dupin cyclides and their focal properties
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-11-26 DOI: 10.1016/j.jsc.2024.102402
Eriola Hoxhaj , Jean Michel Menjanahary , Rimvydas Krasauskas
{"title":"Sections of Dupin cyclides and their focal properties","authors":"Eriola Hoxhaj ,&nbsp;Jean Michel Menjanahary ,&nbsp;Rimvydas Krasauskas","doi":"10.1016/j.jsc.2024.102402","DOIUrl":"10.1016/j.jsc.2024.102402","url":null,"abstract":"<div><div>The cyclographic model of Laguerre geometry is utilized to clarify and generalize the focal properties of curves appearing as torus sections. Based on these findings, all Dupin cyclides with a given planar or spherical section are characterized as several surface families having unique extensions to certain three-orthogonal coordinate systems.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"129 ","pages":"Article 102402"},"PeriodicalIF":0.6,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143159652","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
Computing the homology of universal covers via effective homology and discrete vector fields 通过有效同源性和离散向量场计算普遍盖的同源性
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-11-14 DOI: 10.1016/j.jsc.2024.102401
Miguel A. Marco-Buzunáriz , Ana Romero
{"title":"Computing the homology of universal covers via effective homology and discrete vector fields","authors":"Miguel A. Marco-Buzunáriz ,&nbsp;Ana Romero","doi":"10.1016/j.jsc.2024.102401","DOIUrl":"10.1016/j.jsc.2024.102401","url":null,"abstract":"<div><div>Effective homology techniques allow us to compute homology groups of a wide family of topological spaces. By the Whitehead tower method, this can also be used to compute higher homotopy groups. However, some of these techniques (in particular, the Whitehead tower) rely on the assumption that the starting space is simply connected. For some applications, this problem could be circumvented by replacing the space by its universal cover, which is a simply connected space that shares the higher homotopy groups of the initial space. In this paper, we formalize a simplicial construction for the universal cover, and represent it as a twisted Cartesian product.</div><div>As we show with some examples, the universal cover of a space with effective homology does not necessarily have effective homology in general. We show two independent sufficient conditions that can ensure it: one is based on a nilpotency property of the fundamental group, and the other one on discrete vector fields.</div><div>Some examples showing our implementation of these constructions in both SageMath and Kenzo are shown, together with an approach to compute the homology of the universal cover when the group is Abelian even in some cases where there is no effective homology, using the twisted homology of the space.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102401"},"PeriodicalIF":0.6,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142698004","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
Local dual spaces and primary decomposition 局部对偶空间和一级分解
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-11-13 DOI: 10.1016/j.jsc.2024.102400
Justin Chen, Marc Härkönen, Anton Leykin
{"title":"Local dual spaces and primary decomposition","authors":"Justin Chen,&nbsp;Marc Härkönen,&nbsp;Anton Leykin","doi":"10.1016/j.jsc.2024.102400","DOIUrl":"10.1016/j.jsc.2024.102400","url":null,"abstract":"<div><div>Generalizing the concept of the Macaulay inverse system, we introduce a way to describe localizations of an ideal in a polynomial ring. This leads to an approach to the differential primary decomposition as a description of the affine scheme defined by the ideal.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102400"},"PeriodicalIF":0.6,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142651925","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 the existence and convergence of formal power series solutions of nonlinear Mahler equations 论非线性马勒方程的形式幂级数解的存在性和收敛性
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-11-08 DOI: 10.1016/j.jsc.2024.102399
Renat Gontsov , Irina Goryuchkina
{"title":"On the existence and convergence of formal power series solutions of nonlinear Mahler equations","authors":"Renat Gontsov ,&nbsp;Irina Goryuchkina","doi":"10.1016/j.jsc.2024.102399","DOIUrl":"10.1016/j.jsc.2024.102399","url":null,"abstract":"<div><div>As known, any formal power series solution <span><math><mi>φ</mi><mo>∈</mo><mi>C</mi><mo>[</mo><mo>[</mo><mi>x</mi><mo>]</mo><mo>]</mo></math></span> of an algebraic equation is convergent, as well as that of an analytic one. We study the convergence of formal power series solutions of Mahler functional equations <span><math><mi>F</mi><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>,</mo><mi>y</mi><mo>(</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>ℓ</mi></mrow></msup><mo>)</mo><mo>,</mo><mo>…</mo><mo>,</mo><mi>y</mi><mo>(</mo><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mi>ℓ</mi></mrow><mrow><mi>n</mi></mrow></msup></mrow></msup><mo>)</mo><mo>)</mo><mo>=</mo><mn>0</mn></math></span>, where <span><math><mi>ℓ</mi><mo>⩾</mo><mn>2</mn></math></span> is an integer and <em>F</em> is a holomorphic function near <span><math><mn>0</mn><mo>∈</mo><msup><mrow><mi>C</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>2</mn></mrow></msup></math></span>. Extending Bézivin's theorem from the polynomial case to the case under consideration we prove that all such solutions are also convergent. The Newton polygonal method for finding them is explained.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102399"},"PeriodicalIF":0.6,"publicationDate":"2024-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142651941","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
Absolute concentration robustness: Algebra and geometry 绝对浓度稳健性代数与几何
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-10-30 DOI: 10.1016/j.jsc.2024.102398
Luis David García Puente , Elizabeth Gross , Heather A. Harrington , Matthew Johnston , Nicolette Meshkat , Mercedes Pérez Millán , Anne Shiu
{"title":"Absolute concentration robustness: Algebra and geometry","authors":"Luis David García Puente ,&nbsp;Elizabeth Gross ,&nbsp;Heather A. Harrington ,&nbsp;Matthew Johnston ,&nbsp;Nicolette Meshkat ,&nbsp;Mercedes Pérez Millán ,&nbsp;Anne Shiu","doi":"10.1016/j.jsc.2024.102398","DOIUrl":"10.1016/j.jsc.2024.102398","url":null,"abstract":"<div><div>Motivated by the question of how biological systems maintain homeostasis in changing environments, Shinar and Feinberg introduced in 2010 the concept of absolute concentration robustness (ACR). A biochemical system exhibits ACR in some species if the steady-state value of that species does not depend on initial conditions. Thus, a system with ACR can maintain a constant level of one species even as the initial condition changes. Despite a great deal of interest in ACR in recent years, the following basic question remains open: How can we determine quickly whether a given biochemical system has ACR? Although various approaches to this problem have been proposed, we show that they are incomplete. Accordingly, we present new methods for deciding ACR, which harness computational algebra. We illustrate our results on several biochemical signaling networks.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102398"},"PeriodicalIF":0.6,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142698003","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
Persistent components in Canny's generalized characteristic polynomial 坎尼广义特征多项式中的持久成分
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-10-30 DOI: 10.1016/j.jsc.2024.102397
Gleb Pogudin
{"title":"Persistent components in Canny's generalized characteristic polynomial","authors":"Gleb Pogudin","doi":"10.1016/j.jsc.2024.102397","DOIUrl":"10.1016/j.jsc.2024.102397","url":null,"abstract":"<div><div>When using resultants for elimination, one standard issue is that the resultant vanishes if the variety contains components of dimension larger than the expected dimension. J. Canny proposed an elegant construction, generalized characteristic polynomial, to address this issue by symbolically perturbing the system before the resultant computation. Such perturbed resultant would typically involve artefact components only loosely related to the geometry of the variety of interest. For removing these components, J.M. Rojas proposed to take the greatest common divisor of the results of two different perturbations. In this paper, we investigate this construction, and show that the extra components persistent under taking different perturbations must come either from singularities or from positive-dimensional fibers.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102397"},"PeriodicalIF":0.6,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578233","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
Mixed volumes of networks with binomial steady-states 具有二项稳定状态的网络混合体积
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-10-11 DOI: 10.1016/j.jsc.2024.102395
Jane Ivy Coons , Maize Curiel , Elizabeth Gross
{"title":"Mixed volumes of networks with binomial steady-states","authors":"Jane Ivy Coons ,&nbsp;Maize Curiel ,&nbsp;Elizabeth Gross","doi":"10.1016/j.jsc.2024.102395","DOIUrl":"10.1016/j.jsc.2024.102395","url":null,"abstract":"<div><div>The steady-state degree of a chemical reaction network is the number of complex steady-states for generic rate constants and initial conditions. One way to bound the steady-state degree is through the mixed volume of an associated steady-state system. In this work, we show that for partitionable binomial chemical reaction systems, whose resulting steady-state systems are given by a set of binomials and a set of linear (not necessarily binomial) conservation equations, computing the mixed volume is equivalent to finding the volume of a single mixed cell that is the translate of a parallelotope. Additionally, we give a coloring condition on cycle networks to identify reaction systems with binomial steady-state ideals. We highlight both of these theorems using a class of networks referred to as species-overlapping networks and give a formula for the mixed volume of these networks.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102395"},"PeriodicalIF":0.6,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142532191","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
Coupled cluster degree of the Grassmannian 格拉斯曼的耦合群集度
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-10-11 DOI: 10.1016/j.jsc.2024.102396
Viktoriia Borovik , Bernd Sturmfels , Svala Sverrisdóttir
{"title":"Coupled cluster degree of the Grassmannian","authors":"Viktoriia Borovik ,&nbsp;Bernd Sturmfels ,&nbsp;Svala Sverrisdóttir","doi":"10.1016/j.jsc.2024.102396","DOIUrl":"10.1016/j.jsc.2024.102396","url":null,"abstract":"<div><div>We determine the number of complex solutions to a nonlinear eigenvalue problem on the Grassmannian in its Plücker embedding. This is motivated by quantum chemistry, where it represents the truncation to single electrons in coupled cluster theory. We prove the formula for the Grassmannian of lines which was conjectured in earlier work with Fabian Faulstich. This rests on the geometry of the graph of a birational parametrization of the Grassmannian. We present a squarefree Gröbner basis for this graph, and we develop connections to toric degenerations from representation theory.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102396"},"PeriodicalIF":0.6,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142437932","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
Creative telescoping for hypergeometric double sums 超几何双和的创造性伸缩
IF 0.6 4区 数学
Journal of Symbolic Computation Pub Date : 2024-10-10 DOI: 10.1016/j.jsc.2024.102394
Peter Paule , Carsten Schneider
{"title":"Creative telescoping for hypergeometric double sums","authors":"Peter Paule ,&nbsp;Carsten Schneider","doi":"10.1016/j.jsc.2024.102394","DOIUrl":"10.1016/j.jsc.2024.102394","url":null,"abstract":"<div><div>We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute rational solutions of parameterized linear recurrences.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"128 ","pages":"Article 102394"},"PeriodicalIF":0.6,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142437933","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学术官方微信