Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Some results on coun ...
Conference paper

Some results on counting roots of polynomials and the Sylvester resultant.

Michael Monagan (1), Baris Tuncer (1)
(1) Department of Mathematics [Burnaby]
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6371
License
https://about.hal.science/hal-authorisation-v1
Indicators
546
Views
1022
Downloads

Some results on counting roots of polynomials and the Sylvester resultant.

Michael Monagan (1), Baris Tuncer (1)
(1) Department of Mathematics [Burnaby]
Abstract
We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo n and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second result has application to polynomial GCD computation and solving polynomial diophantine equations.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Combinatorics
Preview
Loading PDF preview...