相关论文: On a factorization result of \c{S}tef\u{a}nescu

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

The Newton polytope $P_f$ of a polynomial $f$ is well known to have a strong impact on its zeros, as in the Kouchnirenko-Bernstein theorem on the number of simultaneous zeros of $m$ polynomials with given Newton polytopes. In this article,…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

It is known that many (upper) cluster algebras are not unique factorization domains. We exhibit the local factorization properties with respect to any given seed $t$: any non-zero element in a full rank upper cluster algebra can be uniquely…

In this note we generalize the definition of partial permutations of Ivanov and Kerov and we build a universal algebra which projects onto the m-centraliser algebra defined by Creedon. We use it to present a new proof for the polynomiality…

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

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…

We prove two formulae which express the Alexander polynomial $\Delta^C$ of several variables of a plane curve singularity $C$ in terms of the ring ${\cal O}_{C}$ of germs of analytic functions on the curve. One of them expresses $\Delta^C$…

A new transparent proof of the well known good compactification theorem for the complex torus $(\Bbb C^*)^n$ is presented. This theorem provides a powerful tool in enumerative geometry for subvarieties in the complex torus. The paper also…

We prove a strong factorization property of interpolation Macdonald polynomials when $q$ tends to $1$. As a consequence, we show that Macdonald polynomials have a strong factorization property when $q$ tends to $1$, which was posed as an…

We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of covariant…

Function theory on the unit disc proved key to a range of problems in statistics, probability theory, signal processing literature, and applications, and in this, a special place is occupied by trigonometric functions and the Fejer-Riesz…

A semidomain is an additive submonoid of an integral domain that is closed under multiplication and contains the identity element. Although atomicity and divisibility in integral domains have been systematically investigated for more than…

This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view.