Zobrazeno 1 - 10
of 3 650
pro vyhledávání: '"Symbolic Computation (cs.SC)"'
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2022, ⟨10.1016/j.jsc.2022.08.012⟩
Journal of Symbolic Computation, 2022, ⟨10.1016/j.jsc.2022.08.012⟩
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space. Our method
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::156d289af4e0ead91ef4752a4ea5a047
https://doi.org/10.1016/j.jsc.2022.08.012
https://doi.org/10.1016/j.jsc.2022.08.012
Publikováno v:
Journal of Symbolic Computation. 117:15-50
The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now been open for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c0e672c98838e755cdc0a31c2adc0e1
https://doi.org/10.1016/j.jsc.2022.11.002
https://doi.org/10.1016/j.jsc.2022.11.002
Autor:
Ruyong Feng, Wei Lu
Publikováno v:
Journal of Algebra. 622:742-776
We study the relation between the Galois group $G$ of a linear difference-differential system and two classes $\mathcal{C}_1$ and $\mathcal{C}_2$ of groups that are the Galois groups of the specializations of the linear difference equation and the li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56c4730fa871e92d848b0a03e62f159f
https://doi.org/10.1016/j.jalgebra.2023.02.017
https://doi.org/10.1016/j.jalgebra.2023.02.017
Publikováno v:
Journal of Symbolic Computation. 116:146-182
A Las Vegas randomized algorithm is given to compute the Smith multipliers for a nonsingular integer matrix $A$, that is, unimodular matrices $U$ and $V$ such that $AV=US$, with $S$ the Smith normal form of $A$. The expected running time of the algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db31b86da3a0544782d89a8b225bbb6d
https://doi.org/10.1016/j.jsc.2022.09.002
https://doi.org/10.1016/j.jsc.2022.09.002
Autor:
Shirokov, Ilya
Publikováno v:
Programming and Computer Software. 49:122-130
We propose a new symbolic algorithm and a C++ program for generating and calculating supersymmetric Feynman diagrams for ${\cal N}=1$ supersymmetric electrodynamics regularized by higher derivatives in four dimensions. According to standard rules, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34cd505f535cfbaabd560516edecafe2
https://doi.org/10.1134/s0361768823020147
https://doi.org/10.1134/s0361768823020147
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2023, ⟨10.1016/j.jsc.2022.08.014⟩
Journal of Symbolic Computation, 2023, ⟨10.1016/j.jsc.2022.08.014⟩
International audience; An interpolation problem is defined by a set of linear forms on the (multivariate) polynomial ring and values to be achieved by an interpolant. For Lagrange interpolation the linear forms consist of evaluations at some nodes,w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80ec7f28314e29a3e529eebbcd8b7067
https://doi.org/10.1016/j.jsc.2022.08.014
https://doi.org/10.1016/j.jsc.2022.08.014
Autor:
Magron, Victor, Wang, Jie
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2023, 115, pp.346-370. ⟨10.1016/j.jsc.2022.08.002⟩
Journal of Symbolic Computation, Elsevier, In press
Journal of Symbolic Computation, 2023, 115, pp.346-370. ⟨10.1016/j.jsc.2022.08.002⟩
Journal of Symbolic Computation, Elsevier, In press
The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a represe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b56444b9a2413bb075b4185398f952ec
https://doi.org/10.1016/j.jsc.2022.08.002
https://doi.org/10.1016/j.jsc.2022.08.002
Publikováno v:
ISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation, Jul 2023, Tromsø, Norway. ⟨10.1145/3597066.3597081⟩
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation, Jul 2023, Tromsø, Norway. ⟨10.1145/3597066.3597081⟩
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The query points
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5616b14b8ec08d08b9531443060b6b3
https://hal.science/hal-04000614v2/file/algcurves-merged.pdf
https://hal.science/hal-04000614v2/file/algcurves-merged.pdf
We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for $F$ and alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f31717f70d5712a8e33c7656eb6c823
https://hal.science/hal-04116621/file/Isolating_roots_in_a_multiple_field_extension__HAL_.pdf
https://hal.science/hal-04116621/file/Isolating_roots_in_a_multiple_field_extension__HAL_.pdf
We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity assumptions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1876197885acd992788edc3143a5390
http://arxiv.org/abs/2305.07439
http://arxiv.org/abs/2305.07439