We gratefully acknowledge support from
the Simons Foundation
and member institutions

Symbolic Computation

Authors and titles for recent submissions

[ total of 8 entries: 1-8 ]
[ showing up to 25 entries per page: fewer | more ]

Tue, 21 Nov 2017

[1]  arXiv:1711.06865 (cross-list from q-bio.BM) [pdf, ps, other]
Title: Decoupled molecules with binding polynomials of bidegree (n,2)
Comments: 18 pages, 8 figures
Subjects: Biomolecules (q-bio.BM); Symbolic Computation (cs.SC); Algebraic Geometry (math.AG); Chemical Physics (physics.chem-ph)

Tue, 7 Nov 2017

[2]  arXiv:1711.01348 [pdf, ps, other]
Title: Automatic Differentiation for Tensor Algebras
Comments: Technical Report
Subjects: Symbolic Computation (cs.SC); Machine Learning (stat.ML)
[3]  arXiv:1711.01355 (cross-list from math.NT) [pdf, ps, other]
Title: Counting Roots of Polynomials Over Prime Power Rings
Comments: title page, plus 11 pages, no illustrations, submitted to a conference
Subjects: Number Theory (math.NT); Computational Complexity (cs.CC); Symbolic Computation (cs.SC)

Thu, 2 Nov 2017

[4]  arXiv:1711.00312 [pdf, ps, other]
Title: The Potential and Challenges of CAD with Equational Constraints for SC-Square
Comments: Accepted into proceedings of MACIS 2017
Subjects: Symbolic Computation (cs.SC)

Wed, 25 Oct 2017

[5]  arXiv:1710.08566 [pdf, other]
Title: Definite Sums of Hypergeometric Terms and Limits of P-Recursive Sequences
Authors: Hui Huang
Comments: PhD thesis
Subjects: Symbolic Computation (cs.SC)

Tue, 24 Oct 2017

[6]  arXiv:1710.08225 [pdf, ps, other]
Title: Symbolic Computations of First Integrals for Polynomial Vector Fields
Authors: Guillaume Chèze (IMT), Thierry Combot (IMB)
Subjects: Symbolic Computation (cs.SC); Computational Complexity (cs.CC); Classical Analysis and ODEs (math.CA); Dynamical Systems (math.DS); Exactly Solvable and Integrable Systems (nlin.SI)
[7]  arXiv:1710.07731 [pdf, ps, other]
Title: On the Annihilator Ideal of an Inverse Form
Authors: Graham H. Norton
Comments: We have corrected some typos in the published version. We also show that our ideal generators yield a maximal regular sequence
Journal-ref: J. AAECC (2017) 28: 31-78
Subjects: Symbolic Computation (cs.SC)
[8]  arXiv:1710.08237 (cross-list from math.CO) [pdf, ps, other]
Title: Lower bounds on the number of realizations of rigid graphs
Subjects: Combinatorics (math.CO); Computational Geometry (cs.CG); Symbolic Computation (cs.SC)
[ total of 8 entries: 1-8 ]
[ showing up to 25 entries per page: fewer | more ]

Disable MathJax (What is MathJax?)