相关论文: On the Relation Between Pommaret and Janet Bases

Parametric Gr\"obner bases have been studied for more than 15 years and are now a further developed subject. Here we propose a general study of parametric standard bases, that is with local orders. We mainly focus on the commutative case…

Let $x_1,...,x_{n}$ be real numbers, $P(x)=p_n(x-x_1)...(x-x_n)$, and $Q(x)$ be a polynomial of degree less than or equal to $n$. Denote by $\Delta(Q)$ the matrix of generalized divided differences of $Q(x)$ with nodes $x_1,...,x_n$ and by…

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…

Let $(P_N)_{N\ge0}$ one of the classical sequences of orthogonal polynomials, i.e., Hermite, Laguerre or Jacobi polynomials. For the roots $z_{1,N},\ldots, z_{N,N}$ of $P_N$ we derive lower estimates for $\min_{i\ne j}|z_{i,N}-z_{j,N}|$ and…

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…

We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…

Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…

Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked…

We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular,…

The main ingredient to construct an O-border basis of an ideal I $\subseteq$ K[x1,. .., xn] is the order ideal O, which is a basis of the K-vector space K[x1,. .., xn]/I. In this paper we give a procedure to find all the possible order…

We introduce a two-parameter modification of the cofinality invariant of ideals. This allows us to include the interaction of a pair of ideals in the study of base-like structures. We find the values (cardinal numbers or well-known cardinal…

The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…

We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…

In this note we provide a counter-example to a conjecture of K. Pardue [Thesis, Brandeis University, 1994.], which asserts that if a monomial ideal is $p$-Borel-fixed, then its $\naturals$-graded Betti table, after passing to any field does…

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…