Page 1

Displaying 1 – 13 of 13

Showing per page

On Newton's polygons, Gröbner bases and series expansions of perturbed polynomial programs

Konstantin Avrachenkov, Vladimir Ejov, Jerzy A. Filar (2006)

Banach Center Publications

In this note we consider a perturbed mathematical programming problem where both the objective and the constraint functions are polynomial in all underlying decision variables and in the perturbation parameter ε. Recently, the theory of Gröbner bases was used to show that solutions of the system of first order optimality conditions can be represented as Puiseux series in ε in a neighbourhood of ε = 0. In this paper we show that the determination of the branching order and the order of the pole (if...

On reconstructing algebraic sets and ideals

Paweł Gniadek (2007)

Annales Polonici Mathematici

We generalize some results on reconstructing sets to the case of ideals of 𝕜[X₁,...,Xₙ]. We show that reconstructing sets can be approximated by finite subsets having the property of reconstructing automorphisms of bounded degree.

On reconstruction of polynomial automorphisms

Paweł Gniadek (1996)

Annales Polonici Mathematici

We extend results on reconstructing a polynomial automorphism from its restriction to the coordinate hyperplanes to some wider class of algebraic surfaces. We show that the algorithm proposed by M. Kwieciński in [K2] and based on Gröbner bases works also for this class of surfaces.

On the polynomial-like behaviour of certain algebraic functions

Charles Feffermann, Raghavan Narasimhan (1994)

Annales de l'institut Fourier

Given integers D > 0 , n > 1 , 0 < r < n and a constant C > 0 , consider the space of r -tuples P = ( P 1 ... P r ) of real polynomials in n variables of degree D , whose coefficients are C in absolute value, and satisfying det P i x i ( 0 ) 1 i , j r = 1 . We study the family { f | V } of algebraic functions, where f is a polynomial, and V = { | x | δ , P ( x ) = 0 } , δ > 0 being a constant depending only on n , D , C . The main result is a quantitative extension theorem for these functions which is uniform in P . This is used to prove Bernstein-type inequalities which are again uniform with respect to P .The proof is based on...

On the regularity and defect sequence of monomial and binomial ideals

Keivan Borna, Abolfazl Mohajer (2019)

Czechoslovak Mathematical Journal

When S is a polynomial ring or more generally a standard graded algebra over a field K , with homogeneous maximal ideal 𝔪 , it is known that for an ideal I of S , the regularity of powers of I becomes eventually a linear function, i.e., reg ( I m ) = d m + e for m 0 and some integers d , e . This motivates writing reg ( I m ) = d m + e m for every m 0 . The sequence e m , called the defect sequence of the ideal I , is the subject of much research and its nature is still widely unexplored. We know that e m is eventually constant. In this article, after...

Currently displaying 1 – 13 of 13

Page 1