Related papers: A theorem of complete reducibility for exponential…

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…

This article presents two constructions motivated by a conjecture of L. van den Dries and C. Miller concerning the restricted analytic field with exponentiation. The first construction provides an example of two o-minimal expansions of a…

For a simple, normal and finite extension of a valued field, we prove that we can related the order of the ramification group of the field extension and the set of key polynomials associated to the extension of the valuation. More…

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

We compute the PI-exponent of the matrix ring with coefficients in an associative algebra. As a consequence, we prove the following. Let $\mathcal{R}$ be a PI-algebra with a positive PI-exponent. If $M_n(\mathcal{R})$ and $M_m(\mathcal{R})$…

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

In a rather straightforward manner, we develop the well-known formula for the Stirling numbers of the first kind in terms of the (exponential) complete Bell polynomials where the arguments include the generalised harmonic numbers. We also…

It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…

The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

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].

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…

Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…