Related Experiment Video
Updated: Dec 8, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
A graph-theoretic criterion for absolute irreducibility of integer-valued polynomials with square-free denominator
1Institut für Analysis und Zahlentheorie Graz University of Technology, Graz, Austria.
Abstract:
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring of integer-valued polynomials on a principal ideal domain D with quotient field K, we give an easy to verify graph-theoretic sufficient condition for an element to be absolutely irreducible and show a partial converse: the condition is necessary and sufficient for polynomials with square-free denominator.
More Related Videos
09:17Reductive Electropolymerization of a Vinyl-containing Poly-pyridyl Complex on Glassy Carbon and Fluorine-doped Tin Oxide Electrodes
Published on: January 30, 2015
13:44Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Related Concept Videos
Fundamental Theorem of Algebra
Real Zeros of Polynomials
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Introduction to Polynomial Functions
Complex Zeros
Synthetic Disvision of Polynomials