相关论文: Subresultants and Generic Monomial Bases

We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

In this paper, we give some results on closed polynomials and factorially closed polynomial in $n$ variables. In particular, we give a characterization of factorially closed polynomials in $n$ variables over an algebraically closed field…

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

In this paper, we study first the relationship between Pommaret bases and Hilbert series. Given a finite Pommaret basis, we derive new explicit formulas for the Hilbert series and for the degree of the ideal generated by it which exhibit…

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

We provide fundamental results on positive solutions to parametrized systems of generalized polynomial $\textit{inequalities}$ (with real exponents and positive parameters), including generalized polynomial $\textit{equations}$. In doing…

We generalize the Bernstein-Sato polynomials of Budur, Mustata and Saito to ideals in normal semigroup rings. In the case of monomial ideals, we also relate the roots of the Bernstein-Sato polynomial to the jumping coefficients of the…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

We consider ideals in the ring $\mathbb{Z}_2[x_1,\ldots, x_n]$ that contain the polynomials $x_i^2 - x_i$ for $i = 1, \ldots, n$ and give various results related to the one-to-one correspondence between these ideals and the subsets of…

Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…

We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor.In particular, we show that the module of syzygies of polynomials…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Resultants are important special functions used in description of non-linear phenomena. Resultant $R_{r_1, ..., r_n}$ defines a condition of solvability for a system of $n$ homogeneous polynomials of degrees $r_1, ..., r_n$ in $n$…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…