Related papers: Polynomial systems admitting a simultaneous soluti…
This chapter combines an introduction and research survey about Schubert varieties. The theme is to combinatorially classify their singularities using a family of polynomial ideals generated by determinants.
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…
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…
Consider a complete intersection I of type (d_1,..., d_r) in a polynomial ring over a field of characteristic 0. We study the graded system of ideals {gin(I^n)}_n obtained by taking the reverse lexicographic generic initial ideals of the…
We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field. Suppose that $I$ is generated by one squarefree monomial of degree $ d>0$, and other squarefree monomials of degrees $\geq d+1$. If the Stanley…
The degree excess function $\epsilon(I;n)$ is the difference between the maximal generating degree $d(I^n)$ of a homogeneous ideal $I$ of a polynomial ring and $p(I)n$, where $p(I)$ is the leading coefficient of the asymptotically linear…
In this paper, we investigate the structure of the saturation of ideals generated by sparse homogeneous polynomials over a projective toric variety $X$ with respect to the irrelevant ideal of $X$. As our main results, we establish a duality…
Mayr and Meyer found ideals $J(n,d)$ (in a polynomial ring in $10n+2$ variables over a field $k$ and generators of degree at most $d+2$) with ideal membership property which is doubly exponential in $n$. This paper is a first step in…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
Let $\mathbf{k}$ be a field which is either finite or algebraically closed and let $R = \mathbf{k}[x_1,\ldots,x_n].$ We prove that any $g_1,\ldots,g_s\in R$ homogeneous of positive degrees $\le d$ are contained in an ideal generated by an…
This paper defines the Euler-Poincar\'{e} characteristic of joint reductions of ideals which concerns the maximal terms in the Hilbert polynomial; characterizes the positivity of mixed multiplicities in terms of minimal joint reductions;…
Let R be a complete discrete valuation ring with maximal ideal generated by pi. Let f(X) in R[X] be a monic polynomial with nonzero discriminant Delta(f). Let s >= v_pi(Delta(f)) + 1. Suppose given a factorisation of f(X) in (R/pi^s R)[X]…
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…
The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…
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…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…