Related papers: The Cayley-Menger determinant is irreducible for $…

If $S$ is a given regular $n$-simplex, $n \ge 2$, of edge length $a$, then the distances $a_1$, $\cdots$, $a_{n+1}$ of an arbitrary point in its affine hull to its vertices are related by the fairly known elegant relation $\phi_{n+1}…

We show that, for generic bihomogeneous polynomials, the determinant of the matrix of moving planes is irreducible.

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 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…

In this paper, we show that for each $n\geq 1$, the generalised Hermite-Laguerre Polynomials $G_{\frac{1}{4}}$ and $G_{\frac{3}{4}}$ are either irreducible or linear polynomial times an irreducible polynomial of degree $n-1$.

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

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…

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.

Conditionally on the Riemann hypothesis for certain Dedekind zeta functions, we show that the characteristic polynomial of a class of random tridiagonal matrices of large dimension is irreducible, with probability exponentially close to…

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

A conjecture of Kac states that the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field with given dimension vector has positive coefficients and furthermore that its constant term is…

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…