Results 21 to 30 of about 170 (40)

Nearly irreducibility of polynomials and the Newton diagrams

, 2019
Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero.
Masternak, Mateusz
core  

Integer-valued polynomials on valuation rings of global fields with prescribed lengths of factorizations. [PDF]

Mon Hefte Math, 2023
Fadinger-Held V, Frisch S, Windisch D.
europepmc   +1 more source

Cycles of polynomial mappings in two variables over rings of integers in quadratic fields

Open Mathematics, 2004
Pezda T.
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Non-absolutely irreducible elements in the ring of integer-valued polynomials

Communications in Algebra, 2020
Sarah Nakato
exaly  

Factorization in additive monoids of evaluation polynomial semirings

Communications in Algebra, 2023
exaly  

Schönemann–Eisenstein–Dumas-Type Irreducibility Conditions that Use Arbitrarily Many Prime Numbers

Communications in Algebra, 2015
Nicolae Ciprian Bonciocat
exaly  

Some Pólya-Type Irreducibility Criteria for Multivariate Polynomials

Communications in Algebra, 2012
Nicolae Ciprian Bonciocat, Yann Bugeaud, Mihai Cipu   +2 more
exaly  

Irreducibility criteria for factorial modules

Communications in Algebra, 2023
exaly  

Algebraic integers with small absolute size

Quaestiones Mathematicae, 2017
Artūras Dubickas
exaly  

On the irreducible factors of a polynomial II

Journal of Algebra, 2020
Srinivas Kotyada
exaly