Related papers: Solving degree, last fall degree, and related inva…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…
We study the relationship between the Tor-regularity and the local-regularity over a positively graded algebra defined over a field which coincide if the algebra is a standard graded polynomial ring. In this case both are characterizations…
In this work we shall present a survey on problems and results on singular holomorphic foliations and Pfaff systems on complex manifolds assuming that these objects possess invariant analytic varieties. We will focus on recent results which…
In this paper, we analyze the algebraic invariants for two classes of multivariate quadratic systems: systems made by OV quadratic polynomials and systems made by both OV polynomials and fully quadratic ones. For such systems, we explicitly…
Resolvent degree ($\operatorname{RD}$) is an invariant of finite groups in terms of the complexity of their algebraic actions. We address the problem of bounding $\operatorname{RD}(G)$ for all finite simple groups using the methods…
We present a generalized notion of degree for rotating solutions of planar systems. We prove a formula for the relation of such degree with the classical use of Brouwer's degree and obtain a twist theorem for the existence of periodic…
This paper generalizes a result of Lynn on the "degree" of an equivariant cohomology ring $H^*_G(X)$. The degree of a graded module is a certain coefficient of its Poincar\'{e} series, and is closely related to multiplicity. In the present…
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and…
We prove a doubly exponential bound for the Castelnuovo-Mumford regularity of prime ideals defining varieties with polynomial parametrisation.
Given a polynomial system $\mathcal{F}$ over a finite field $k$ which is not necessarily of dimension zero, we consider the Weil descent $\mathcal{F}'$ of $\mathcal{F}$ over a subfield $k'$. We prove a theorem which relates the last fall…
We develop the theory of resolvent degree, introduced by Brauer \cite{Br} in order to study the complexity of formulas for roots of polynomials and to give a precise formulation of Hilbert's 13th Problem. We extend the context of this…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
We establish bounds for the Castelnuovo-Mumford regularity of a finitely generated graded module and its symmetric powers in terms of the degrees of the generators of the module and the degrees of their relations. We extend to modules (and…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
We use Groebner basis methods to extract all stationary solutions for the 9-mode shear flow model that is described in Moehlis et al, New J. Phys. 6, 54 (2004). Using rational approximations to irrational wave numbers and algebraic…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
Let S = k[x_1,...,x_n] be a Z^r-graded ring with deg (x_i) = a_i \in Z^r for each i and suppose that M is a finitely generated Z^r-graded S-module. In this paper we describe how to find finite subsets of Z^r containing the multidegrees of…
The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…