Related papers: Perfect cuboids and irreducible polynomials
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
The problem of constructing a perfect Euler cuboid is reduced to a single Diophantine equation of the degree 12.
In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…
The perfect cuboid problem is an old famous unsolved problem in mathematics concerning the existence or non-existence of a rectangular parallelepiped whose edges, face diagonals, and space diagonal are of integer lengths. Recently Walter…
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…
A perfect cuboid (PC) is a rectangular parallelepiped with rational sides $a,b,c$ whose face diagonals $d_{ab}$, $d_{bc}$, $d_{ac}$ and space (body) diagonal $d_s$ are rationals. The existence or otherwise of PC is a problem known since at…
We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…
Two cubic equations and three auxiliary equations for edges and face diagonals of a rational perfect cuboid have been recently derived. They constitute a background for two inverse problems. The coefficients of cubic equations and the right…
A perfect cuboid is a rectangular parallelepiped. Its edges, its face diagonals, and its space diagonal are of integer lengths. None of such cuboids is known thus far, though the system of Diophantine equations describing them is easily…
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 $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
Nobody has discovered any perfect cuboid and there is no formula to deliver all possible Euler bricks. During investigations of famous open problems regarding the perfect cuboid and Euler brick; I have found new important conjectures on…
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…
We consider nearly-perfect cuboids (NPC), where the only irrational is one of the face diagonals. Obtained are three rational parametrizations for NPC with one parameter.
We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. It is described by a system of four equations with respect to six variables.…
Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…
In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…
Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…
Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…