Zobrazeno 1 - 10
of 2 032
pro vyhledávání: '"Factorization of polynomials"'
Autor:
L. R. Vermani
Publikováno v:
Elements of Algebraic Coding Theory ISBN: 9780412573804
Elements of Algebraic Coding Theory
Elements of Algebraic Coding Theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df856588dad3d674c4ece1e1d94f6e9e
https://doi.org/10.1201/9780203758533-7
https://doi.org/10.1201/9780203758533-7
Autor:
N. S. Astapov
Publikováno v:
Programmnaya Ingeneria. 12:200-208
For polynomials of the third degree of a special type, expansions into linear factors are found. Various methods of factorization of fourth-degree polynomials of general and particular types are proposed. For polynomials of the sixth degree of a spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03cb55a93342d0dc53a66a3e2ec33b44
https://doi.org/10.17587/prin.12.200-208
https://doi.org/10.17587/prin.12.200-208
Autor:
Boris M. Bekker, Oleg Podkopaev
Publikováno v:
Aequationes mathematicae. 96:349-360
The aim of this paper is to fill in the gaps in the formulation and the proof of a theorem contained in the paper by K.Ozeki (Aequ Math 25:247–252, 1982) published in this journal. We also give a short proof of this theorem and use it to obtain cer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55e47999d2aa2b772d3c76b9ff103415
https://doi.org/10.1007/s00010-021-00833-7
https://doi.org/10.1007/s00010-021-00833-7
Autor:
Hemar Godinho, Victor G. L. Neumann
Publikováno v:
International Journal of Number Theory. 17:2113-2130
In this paper, we consider the Diophantine equation in the title, where [Formula: see text] are distinct odd prime numbers and [Formula: see text] are natural numbers. We present many results given conditions for the existence of integers solutions f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::723a058f0d63067c929d307b596d0ee9
https://doi.org/10.1142/s1793042121500792
https://doi.org/10.1142/s1793042121500792
Publikováno v:
Programming and Computer Software. 47:108-118
Polynomial factorization is a classical algorithmic algebra problem with a wide range of applications. Of particular interest is factorization over finite fields, among which fields of order two are probably the most important ones when representing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5527c30ed84e05253de4adeaaa06fe24
https://doi.org/10.1134/s0361768821020043
https://doi.org/10.1134/s0361768821020043
Autor:
Enver Ozdemir
Publikováno v:
International Journal of Number Theory. 17:1517-1536
In this paper, we describe a new polynomial factorization algorithm over finite fields with odd characteristics. The main ingredient of the algorithm is special singular curves. The algorithm relies on the extension of the Mumford representation and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01b75177954ffaa0cdb2b51de742c604
https://doi.org/10.1142/s1793042121500469
https://doi.org/10.1142/s1793042121500469
Publikováno v:
International Journal of Advanced Engineering Research and Science. 8:101-111
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd7fabfe76ebe8f017100bf0da7d2f7b
https://doi.org/10.22161/ijaers.86.11
https://doi.org/10.22161/ijaers.86.11
Publikováno v:
Quantum Chemistry and Dynamics of Excited States
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89d3251fb1a56e0c8e228f063ce75a59
https://doi.org/10.1002/9781119417774.ch17
https://doi.org/10.1002/9781119417774.ch17
Autor:
Francesco Laudano
Publikováno v:
International Journal of Mathematical Education in Science and Technology. 52:1113-1123
We propose an algorithm that allows calculating the remainder and the quotient of division between polynomials over commutative coefficient rings, without polynomial long division. We use the previ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66ca16228644404444e8a6eb783b6680
https://doi.org/10.1080/0020739x.2020.1821108
https://doi.org/10.1080/0020739x.2020.1821108
Autor:
Joris van der Hoeven, Michael Monagan
Publikováno v:
ACM Communications in Computer Algebra
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2021, 54 (3), pp.65-85. ⟨10.1145/3457341.3457342⟩
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2021, 54 (3), pp.65-85. ⟨10.1145/3457341.3457342⟩
Let p be a prime of the form p = σ2 k + 1 with σ small and let F p denote the finite field with p elements. Let P ( z ) be a polynomial of degree d in F p [ z ] with d distinct roots in F p . For p =5 · 2 55 + 1 we can compute the roots of such po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d042849789048c2f79c6e33c0ab1b0e9
https://doi.org/10.1145/3457341.3457342
https://doi.org/10.1145/3457341.3457342