相关论文: Closed polynomials and their applications for comp…

We present a new formula of Cauchy type for the nonsymmetric Macdonald polynomials which are joint eigenfunctions of q-Dunkl operators. This gives the explicit formula for a reproducing kernel on the polynomial ring of n variables.

Kopparty and Wang studied in [3] the relation between the roots of a univariate polhynomial over GF(q) and the zero-nonzero pattern of its coefficients. We generalize their results to polynomials in more variables.

In this paper, we introduce two new non-singular kernel fractional derivatives and present a class of other fractional derivatives derived from the new formulations. We present some important results of uniformly convergent sequences of…

The operational calculus associated with special polynomials has proven to be a powerful tool for analyzing and simplifying their properties. This article examines the bivariate degenerate Hermite polynomials with a focus on their…

To study the zeros of octonionic polynomials, we generalize the well-known Enestrom-Kakeya Theorem to the case of octonions. In this paper, we first deal with octonionic polynomials with nonnegative and monotonic coefficients, and prove…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We complete the study of some periods of polynomials in (n+1) variables with (n+2) monomials in computing the behavior of these periods in the natural parameter for such a polynomial.

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

We study a map that sends a monic degree n complex polynomial f(x) without multiple roots to the collection of n values of its derivative at the roots of f(x). We give an answer to a question posed by Ju.S. Ilyashenko.

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…