Related papers: An algorithm for producing F-pure ideals

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

Let $\mathscr{R}$ denote the ring of real polynomials on $\mathbb{R}^{n}$. Fix $m\geq 0$, and let $A_{1},\cdots ,A_{M}\in \mathscr{R}$. The $ C^{m}$-closure of $\left( A_{1},\cdots ,A_{M}\right) $, denoted here by $ \left[ A_{1},\cdots…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

Let $R$ be a ring of prime characteristic $p$, and let $F^e_* R$ denote $R$ viewed as an $R$-module via the $e$th iterated Frobenius map. Given a surjective map $\phi : F^e_* R \to R$ (for example a Frobenius splitting), we exhibit an…

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…

A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given. This solution, an algorithm computing approximate zeros of complex polynomial systems in average polynomial time, assumed infinite…

Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…

This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.

We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

Let f_1,...,f_r be homogeneous polynomials in K[x_1,...,x_n], K a field. Put F=y_1f_1+...+y_rf_r in K[x,y] and let I be the ideal of K[x,y] generated by the partials of F relative to the x_i and y_j. The Jacobian ring of F is the quotient…

We provide a formula for $F$-thresholds of a Thom-Sebastiani type polynomial over a perfect field of prime characteristic. This result extends the formula for the $F$-pure threshold of a diagonal hypersurface. We also compute the first test…

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

Suppose $R$ is a $\mathbb{Q}$-Gorenstein $F$-finite and $F$-pure ring of prime characteristic $p>0$. We show that if $I\subseteq R$ is a compatible ideal (with all $p^{-e}$-linear maps) then there exists a module finite extension $R\to S$…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

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. We propose a general algebraic framework to find the solutions and to…

A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…

Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…