Related papers: Generalised Hilbert Numerators II
This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…
We propose a general study of standard bases of polynomial ideals with parameters in the case where the monomial order is arbitrary. We give an application to the computation of the stratification by the local Hilbert-Samuel function.…
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,…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…
We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…
A general integral expression to transform power series is applied to $\arcsin{x}$ and its positive integer powers. We concentrate on the first to the fourth powers and obtain infinite classes of new power series involving central binomial…
Let $R$ be a Cohen-Macaulay local ring of dimension $d$ with infinite residue field. Let $I$ be an $R$-ideal that has analytic spread $\ell(I)=d$, $G_d$ condition and the Artin-Nagata property $AN^-_{d-2}$. We provide a formula relating the…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
In this paper, we recover the characteristic polynomial of an arrangement of hyperplanes by computing the rational equivalence class of the variety defined by the logarithmic ideal of the arrangement. The logarithmic ideal was introduced in…
We present a homological characterisation of those chain complexes of modules over a Laurent polynomial ring in several indeterminates which are finitely dominated over the ground ring (that is, are a retract up to homotopy of a bounded…
We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…
The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…
In this article, we study binomial ideals generated by an arbitrary collection of corner-interval $2$-minors of a generic matrix. We determine the minimal prime ideals of such ideals and characterize their radicality in the special case of…
Let $\Bbbk$ be a field and let $I$ be a monomial ideal in the polynomial ring $Q=\Bbbk[x_1,\ldots,x_n]$. In her thesis, Taylor introduced a complex which provides a finite free resolution for $Q/I$ as a $Q$-module. Later, Gemeda constructed…
We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…
Let k be an arbitrary field (of arbitrary characteristic) and let X = [x_{i,j}] be a generic m x n matrix of variables. Denote by I_2(X) the ideal in k[X] = k[x_{i,j}: i = 1, ..., m; j = 1, ..., n] generated by the 2 x 2 minors of X. We…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…
To a multi-index filtration (say, on the ring of germs of functions on a germ of a complex analytic variety) one associates several invariants: the Hilbert function, the Poincar\'e series, the generalized Poincar\'e series, and the…