Related papers: Desingularization of binomial varieties in arbitra…

In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales…

Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing…

The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…

Based on the partition of parameter space, two algorithms for computing the rational univariate representation of zero-dimensional ideals with parameters are presented in the paper. Unlike the rational univariate representation of…

Building upon work of Villamayor and Bierstone-Milman we give a proof of the canonical Hironaka principalization and desingularization. The idea of "homogenized ideals" introduced in the paper gives {\it a priori} the canonicity of…

In this paper, we study renormalization, that is, the procedure for eliminating singularities, for a special model using both combinatorial techniques in the framework of working with formal series, and using a limit transition in a…

In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

We present SPEC-RE, a new algorithm to sort complex eigenvalues, generated as the solutions to algebraic equations, whose coefficients are analytic functions of one or many, possibly complex parameters. The fact that the eigenvalues are…

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…

We show that a version of the desingularization theorem of Hironaka holds for certain classes of infinitely differentiable functions (essentially, for subrings that exclude flat functions and are closed under differentiation and the…

Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…

The aim of this paper is to unveil an unexpected relationship between the normal form of a polynomial with respect to a polynomial ideal and the more geometric concept of orthogonality. We present a new way to calculate the normal form of a…

In this paper we simplify and otherwise improve the local resolution of singularities algorithm of [G1]-[G3], providing a local resolution of singularities method that works for functions with convergent power series over an arbitrary local…

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.…

We compare some algebras appeared in the recent attempts to prove resolution of singularities in positive characteristic. We also construct an algebra which encodes the same information and it is equivalent, up to integral closure, to the…

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

The main result of the present paper is the construction of fundamental solutions for a class of multidimensional elliptic equations with several singular coefficients. These fundamental solutions are directly connected with multiple…