Related papers: Efficient modified Jacobi-Bernstein basis transfor…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
Explicit formulae for the B\'ezier coefficients of the constrained dual Bernstein basis polynomials are derived in terms of the Hahn orthogonal polynomials. Using difference properties of the latter polynomials, efficient recursive scheme…
In this paper, an original reduction algorithm for solving simultaneous multivariate polynomial equations is presented. The algorithm is exponential in complexity, but the well-known algorithms, such as the extended Euclidean algorithm and…
In the present paper, we propose the modified q-Bernstein polynomials of degree n, which are different q-Bernstein polynomials of Phillips(see [4]). From these the modified q-Bernstein polynomials of degree n, we derive some interesting…
The Jacobian Conjecture states that any locally invertible polynomial system in C^n is globally invertible with polynomial inverse. C. W. Bass et al. (1982) proved a reduction theorem stating that the conjecture is true for any degree of…
In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezier curves based on (p,q)-integers is introduced. We study the nature of degree elevation and degree reduction for (p,q)-Bezier Bernstein functions. The new curves have…
Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining B\'{e}zier form of the $L^2$-solution of the problem of best polynomial approximation of B\'{e}zier curve or surface. In this connection, the…
B\'ezier curves are a widespread tool for the design of curves in Euclidian space. This paper generalizes the notion of B\'ezier curves to the infinite-dimensional space of images. To this end the space of images is equipped with a…
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.
We introduce a method for studying reduction types of arithmetic curves and wildly ramified base change. We give new proofs of earlier results of Lorenzini and Obus-Wewers, and resolve a question of Lorenzini on the Euler characteristic of…
This is a slightly revised version of the author's 2010 diploma thesis. It is concerned with the interplay between real multiplication on Jacobian varieties, as the title suggests, and complex geodesics in the moduli space of curves. Large…
The approach to curve implicitization through Sylvester and Bezout resultant matrices and bivariate interpolation in the usual power basis is extended to the case of Bernstein-Bezoutian matrices constructed when the polynomials are given in…
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 present new representations of Gauss--Legendre polynomials and their derivatives in the shifted power basis and in bases related to symmetric orthogonal Jacobi polynomials. Using these representations and certain recurrence relations, we…
A new differential-recurrence relation for the B-spline functions of the same degree is proved. From this relation, a recursive method of computing the coefficients of B-spline functions of degree $m$ in the Bernstein-B\'{e}zier form is…