全部文献期刊会议图书|学者科研项目
中外文文献  中文文献  外文文献
作者:Zeyu Guo
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.96, pp.22-61Elsevier
摘要:Abstract(#br)We introduce a family of combinatorial objects called P -schemes , where P is a collection of subgroups of a finite group G . A P -scheme is a collection of partitions of right coset spaces H \ G , indexed by H ∈ P , that satisfies a list of axioms. These object...
作者:Zoltán Kovács , Tomás Recio , M. Pilar Vélez
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.97, pp.16-30Elsevier
摘要:Abstract(#br)We illustrate an on-going work on the crossroad of mechanical linkages, dynamic geometry and automated reasoning. In particular, we exemplify how some automated reasoning tools (ART) based on symbolic computation and recently implemented in GeoGebra, can be used for ...
作者:Russell Bradford , James H. Davenport , Matthew England ...
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.98, pp.84-119Elsevier
摘要:Abstract(#br)We consider a problem from biological network analysis of determining regions in a parameter space over which there are multiple steady states for positive real values of variables and parameters. We describe multiple approaches to address the problem using tools fro...
作者:Mark Giesbrecht , Joseph Haraldson , George Labahn
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.98, pp.225-245Elsevier
摘要:Abstract(#br)Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest matrix polynomial that is alge...
作者:Thierry Dana-Picard
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.97, pp.56-68Elsevier
摘要:Abstract(#br)Learning mathematics in a technology rich environment enables to revive classical topics which have been removed from the curriculum a long time ago. Theoretical issues and their applications can be studied within an experimental process, using automated proofs....
作者:Michael Clausen
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.98, pp.319-357Elsevier
摘要:Abstract(#br)This paper introduces new techniques for the efficient computation of discrete Fourier transforms (DFTs) of S n − k -invariant functions on the symmetric group S n . We uncover diamond- and leaf-rake-like structures in Young's seminormal and orthogonal represent...
作者:Milica Selaković , Vesna Marinković , Predrag Janičić
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.97, pp.3-15Elsevier
摘要:Abstract(#br)Dynamic Geometry Software (DGS) is present for more than three decades: it found its way to classrooms worldwide and it is now an irreplaceable component of mathematical education. From the very beginning and still, DGS tools are built around one central scenari...
作者:Takafumi Shibuta , Shinichi Tajima
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.96, pp.108-121Elsevier
摘要:Abstract(#br)In this paper, we present an algorithm for computing the minimal reductions of m -primary ideals of Cohen–Macaulay local rings. Using this algorithm, we are able to compute the Hilbert–Samuel multiplicities and solve the membership problem for the integral closu...
作者:Parisa Alvandi , Masoud Ataei , Mahsa Kazemi ...
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.98, pp.120-162Elsevier
摘要:Abstract(#br)The Extended Hensel Construction (EHC) is a procedure which, for an input bivariate polynomial with complex coefficients, can serve the same purpose as the Newton-Puiseux algorithm, and, for the multivariate case, can be seen as an effective variant of Jung-Abhy...
来源:[J].Journal of Symbolic Computation(IF 0.391), 2020, Vol.96, pp.ii-iiElsevier

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×