Related papers: Finite subsets of projective space, and their idea…

Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only…

Let C be an irreducible projective curve of degree d in Pn(K), where K is an algebraically closed field, and let I be the associated homogeneous prime ideal. We wish to compute generators for I, assuming we are given sufficiently many…

The set of all maximal ideals of the ring $\mathcal{M}(X,\mathcal{A})$ of real valued measurable functions on a measurable space $(X,\mathcal{A})$ equipped with the hull-kernel topology is shown to be homeomorphic to the set $\hat{X}$ of…

Explicit bases for the subfield subcodes of projective Reed-Muller codes over the projective plane and their duals are obtained. In particular, we provide a formula for the dimension of these codes. For the general case over the projective…

Given a nonincreasing function $f : \mathbb{Z}_{\geq 0} \setminus \{ 0 \} \to \mathbb{Z}_{\geq 0}$ such that (i) $f(k) - f(k+1) \leq 1$ for all $k \geq 1$ and (ii) if $a = f(1)$ and $b = \lim_{k \to \infty} f(k)$, then $|f^{-1}(a)| \leq…

We characterize the variety of compatible fundamental matrix triples by computing its multidegree and multihomogeneous vanishing ideal. This answers the first interesting case of a question recently posed by Br{\aa}telund and Rydell. Our…

Let X be a set of s points whose coordinates are known with only limited From the numerical point of view, given a set X of s real points whose coordinates are known with only limited precision, each set X* of real points whose elements…

For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…

We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…

We obtain several fundamental results on finite index ideals and additive subgroups of rings as well as on model-theoretic connected components of rings, which concern generating in finitely many steps inside additive groups of rings. Let…

We show that the ideal of an arrangement of d linear subspaces of projective space is d-regular in the sense of Castelnuovo and Mumford, answering a question of B. Sturmfels. In particular this implies that the ideal of an arrangement of d…

Let S be a polynomial ring in n variables, over an arbitrary field. We give the total, graded, and multigraded Betti numbers of S/M, for every monomial ideal M in S. We also give an explicit characterization of all monomial ideals M in S…

We construct monomial ideals with the property that their depth function has any given number of strict local maxima.

Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…

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…

A divisibility relation between the generators of a square-free monomial ideal formally encodes the situation when one generator divides the least common multiple of some other generators. The divisibility relations contribute to the…

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…