Absolute irreducibility of polynomials via Newton polytopes (Q5936184): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4847920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the graph structure of convex polyhedra in \(n\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The irreducibility of all but finitely many Bessel polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel absolute irreducibility testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic irreducibility testing of polynomials over large finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Noether irreducibility forms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Eisenstein's irreducibility criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton polyhedra and irreducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication and factorization of polynomials. II: Irreducibility discussion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations over finite fields. An elementary approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An indecomposable polytope all of whose facets are decomposable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposability of polytopes and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic function fields and codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal polynomials and distinctness of Kloosterman sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton polygons of zeta functions and \(L\) functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eisenstein's Criteria for Absolute Irreducibility Over a Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 18:08, 3 June 2024

scientific article; zbMATH DE number 1616312
Language Label Description Also known as
English
Absolute irreducibility of polynomials via Newton polytopes
scientific article; zbMATH DE number 1616312

    Statements

    Absolute irreducibility of polynomials via Newton polytopes (English)
    0 references
    0 references
    11 November 2002
    0 references
    The author studies the absolute irreducibility of polynomials through properties of Newton polytopes. His methods are related to the classical use of Newton polygons in the study of irreducibility of polynomials over the integers [see \textit{G. Dumas}, J. Math. Pures Appl. (6) 2, 191-258 (1906; JFM 37.0096.01) and \textit{A. Lipkovski}, Math. Z. 199, 119-127 (1988; Zbl 0632.14005)]. He proves that absolute irreducibility of a polynomial \(f\) in \(n\) indeterminates over a field \(F\) is assured if the Newton polytope of \(f\) is integrally indecomposable. He constructs several families of absolutely irreducible polynomials in three indeterminates with coefficients in a field. This study has been continued by the author and \textit{A. Lauder} [Discrete Comput. Geom. 26, 89-104 (2001; Zbl 0973.68264)].
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducibility of polynomials
    0 references
    Newton polytopes
    0 references
    multivariable polynomials
    0 references
    Eisenstein criterion
    0 references
    Minkowski sums
    0 references
    JFM 37.0096.01
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references