Related papers: On binomials and algebraic closure of some pseudof…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
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…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
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…
A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…
We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Let G be a semisimple group over an algebraically closed field of characteristic p>0. We give a (partly conjectural) simple, closed formula for the character of many indecomposable tilting rational G-modules, assuming that p is large.
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.
The concept of a skew root of a skew polynomial is used to introduce notions of algebraic closedness for $\sigma$-fields, that is, a field equipped with an endomorphism. It is shown that every $\sigma$-field can be embedded in algebraically…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…
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…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…