Related papers: Resolvent degree, Hilbert's 13th Problem and geome…
The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…
The Computational Algebraic Geometry applied in Algebraic Statistics; are beginning to exploring new branches and applications; in artificial intelligence and others areas. Currently, the development of the mathematics is very extensive and…
In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases…
Polynome codes and code evaluation; arithmetical theory frames; $\mu$-recursive race for decision; decision correctness; decision termination; correct termination in theory $T = PR$ of Primitive Recursion; comparison with the negative…
We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…
The paper deals with the resolution of third and fourth degree equations by means of radicals. It is a survey of some historical details about this fundamental problem. Moreover, it explains practical methods for the resolution of third and…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…
We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…
We introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…
Building upon the recent works of Bertola; Fasondini, Olver and Xu, we define a class of orthogonal polynomials on elliptic curves and establish a corresponding Riemann-Hilbert framework. We then focus on the special case, defined by a…
The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown…
In this paper we introduce an integer-valued degree for second order fully nonlinear elliptic operators with nonlinear oblique boundary conditions. We also give some applications to the existence of solutions of certain nonlinear elliptic…
Resolvent degree is an invariant measuring the complexity of algebraic and geometric phenomena, including the complexity of finite groups. To date, the resolvent degree of a finite simple group $G$ has only been investigated when $G$ is a…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
We study existence and Lorentz regularity of distributional solutions to elliptic equations with either a convection or a drift first order term. The presence of such a term makes the problem not coercive. The main tools are pointwise…
In this paper we investigate some algebraic and geometric consequences which arise from an extremal bound on the Hilbert function of the general hyperplane section of a variety (Green's Hyperplane Restriction Theorem). These geometric…
This is an English translation of "The Resolvent Problem" by Tschebotarow/Chebotarev. In this article, Chebotarev summarizes the history of the resolvent problem from compass and ruler constructions to Klein and Hilbert' formlutions of the…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
We provide an upper bound for the number of limit cycles that planar polynomial differential systems of a given degree may have. The bound turns out to be a polynomial of degree four in the degree of the system. The strategy brings together…
For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…