Related papers: On Ideal Lattices, Gr\"obner Bases and Generalized…
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
Lattice-based cryptography relies on generating random bases which are difficult to fully reduce. Given a lattice basis (such as the private basis for a cryptosystem), all other bases are related by multiplication by matrices in…
Vanishing polynomials are polynomials over a ring which output $0$ for all elements in the ring. In this paper, we study the ideal of vanishing polynomials over specific types of rings, along with the closely related ring of polynomial…
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…
Associated to any vector configuration A is a toric ideal encoded by vectors in the kernel of A. Each toric ideal has two special generating sets: the universal Gr\"obner basis and the Graver basis. While the former is generally a proper…
In his Ph.D. thesis, Sean Griffin introduced a family of ideals and found monomial bases for their quotient rings. These rings simultaneously generalize the Delta Conjecture coinvariant rings of Haglund-Rhoades-Shimozono and the cohomology…
Multiview ideals arise from the geometry of image formation in pinhole cameras, and universal multiview ideals are their analogs for unknown cameras. We prove that a natural collection of polynomials form a universal Gr\"obner basis for…
The purpose of this paper is to introduce different types of operations on fuzzy ideals of $\Gamma$-semirings and to prove subsequently that these oprations give rise to different structures such as complete lattice, modular lattice on some…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…
The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced…
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 the following problem in computer vision from the perspective of algebraic geometry: Using $m$ pinhole cameras we take $m$ pictures of a line in $\mathbb P^3$. This produces $m$ lines in $\mathbb P^2$ and the question is which…
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
In this paper, two kinds of generalizations of ideal matrices, generalized ideal matrices and double ideal matrices. are obtained and studied, The concepts of generalized ideal matrices and double ideal matrices are proposed, and their…
We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…
In this paper, based on ideals, we investigate residuated lattices from fuzzy set theory and lattice theory point of view. Ideals are important concepts in the theory of algebraic structures used for formal fuzzy logic and first, we…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…