Related papers: Deterministically Computing Reduction Numbers of P…

The ring of integer-valued polynomials on an arbitrary integral domain is well-studied. In this paper we initiate and provide motivation for the study of integer-valued polynomials on commutative rings and modules. Several examples are…

Let $R=k[x_1,\dots,x_n]$ be a ring of polynomials over a field $k$ of characteristic $p>0$. There is an algorithm due to Lyubeznik for deciding the vanishing of local cohomology modules $H^i_I(R)$ where $I\subset R$ is an ideal. This…

The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…

Program behavior may depend on parameters, which are either configured before compilation time, or provided at run-time, e.g., by sensors or other input devices. Parametric program analysis explores how different parameter settings may…

Let $(R,\frak{m})$ be a $d$-dimensional Cohen-Macaulay local ring, $I$ an $\frak{m}$-primary ideal and $J$ a minimal reduction of $I$. In this paper we study the independence of reduction ideals and the behavior of the higher Hilbert…

Let $(A, \mathfrak m)$ be a normal two-dimensional local ring and $I$ an $\mathfrak m$-primary integrally closed ideal with a minimal reduction $Q$. Then we calculate the numbers: $\mathrm{nr}(I) = \min\{n \;|\; \overline{I^{n+1}} =…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

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 consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite field $K=\mathbb{F}_q$ and the finite set of projective rational points $\mathbb{X}$ that it defines in the projective space…

We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…

Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…

In this paper, we study defining ideals of numerical semigroup rings. Let $H$ be a numerical semigroup with multiplicity $a_0$ and embedding dimension $n$. Assuming $a_0/2+1\leq n$, we prove that the defining ideal of $H$ is determinantal…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…

We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…

In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…

We show that a polynomial equation of degree less than 5 and with real parameters can be solved by regarding the variable in which the polynomial depends as a complex variable. For do it so, we only have to separate the real and imaginary…

In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…