Related papers: Universal Gr\"obner Bases of (Universal) Multiview…
The study of Mutually Unbiased Bases continues to be developed vigorously, and presents several challenges in the Quantum Information Theory. Two orthonormal bases in $\mathbb C^d, B {and} B'$ are said mutually unbiased if $\forall b\in B,…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
We will study monomial ideals $I$ in the exterior algebra as well as in the polynomial ring whose generic initial ideal is constant for all term orders up to permutations of variables. First, in the exterior algebra, we determine all graphs…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
We study ideals which are generated by monomials of degree $d$ in the polynomial ring in $n$ variables and which satisfy certain numerical side conditions regarding their exponents. Typical examples of such ideals are the ideals of Veronese…
In modeling physical systems it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases,…
Border bases are traditionally restricted to 0-dimensional ideals due to the finiteness of the underlying order ideal. In this paper we extend the theory to homogeneous ideals of positive Krull dimension by introducing homogeneous border…
Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…
We consider ideals of polynomials vanishing on the W-orbits of the intersections of mirrors of a finite reflection group W. We determine all such ideals which are invariant under the action of the corresponding rational Cherednik algebra…
The classical "generalized principal ideal theorems" of Macaulay, Eagon-Northcott, and others give sharp bounds on the heights of determinantal ideals in arbitrary rings. But in regular local rings (or graded polynomial rings) these are far…
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…
The multiview variety from computer vision is generalized to images by $n$ cameras of points linked by a distance constraint. The resulting five-dimensional variety lives in a product of $2n$ projective planes. We determine defining…
Let I be either the ideal of maximal minors or the ideal of 2-minors of a row graded or column graded matrix of linear forms L. In two previous papers we showed that I is a Cartwright-Sturmfels ideal, that is, the multigraded generic…
Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…
The rational camera model recently introduced in [19] provides a general methodology for studying abstract nonlinear imaging systems and their multi-view geometry. This paper builds on this framework to study "physical realizations" of…
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…
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…
In this paper, we show that if $I$ is a matroidal ideal, then the ideal generated by the $i$-th multigraded shifts is also a matroidal ideal for every $i=0,\ldots,\text{pd}(I)$.
The multiview variety associated to a collection of $N$ cameras records which sequences of image points in $\mathbb{P}^{2N}$ can be obtained by taking pictures of a given world point $x\in\mathbb{P}^3$ with the cameras. In order to…