We consider hypergeometric sequences i e the sequences which satisfy linear rst order homogeneous recurrence equations with rela tively prime polynomial coe cients Some results related to necessary and su cient conditions are discussed for validity of discrete Newton Leibniz formula P w k v t k u w u v when u k R k t k and R k is a rational solution of Gosper s equation

Past parametric tests of demand system rank employed polynomial Engel curve systems. However, by Gorman’s (1981) theorem, the maximum possible rank of a utility derived polynomial demand system is three. The present paper proposes a class of demand systems that are utility derived, are close to polynomial, and have rank four. These systems nest rational polynomial demands, and so can be used to...

We prove that every polynomially convex arc is contained in a simple closed curve. also establish results about polynomial hulls of arcs and curves are locally rectifiable outside subset.

We propose a novel approach for the approximate parameterization of an implicitly defined curve in the plane by polynomial parametric spline curves. The method generates the parameterization of the curve (which may consist of several open and closed branches) without using any a priori information about its topology. If needed the topology of the approximate parameterization can be certified ag...

We describe an algorithm to compute the zeta function of any Cab curve over any finite field Fpn . The algorithm computes a p-adic approximation of the characteristic polynomial of Frobenius by computing in the Monsky-Washnitzer cohomology of the curve and thus generalizes Kedlaya’s algorithm for hyperelliptic curves. For fixed p the asymptotic running time for a Cab curve of genus g over Fpn i...

We study real algebraic plane curves, at an elementary level, using as little algebra as possible. Both cases, affine and projective, are addressed. A real curve is infinite, finite or empty according to the fact that a minimal polynomial for the curve is indefinite, semi–definite nondefinite or definite. We present a discussion about isolated points. By means of the operator, these points can ...

A PC program extending the procedure due to Carter and Yang (Commun Stat: Theory Methods, 8 (1986) 2507-2526) to allow unique times of measurement for subjects is described, illustrated and made available. Given longitudinal observations on each of N subjects comprising a single group, this program determines the lowest degree polynomial in time adequate to fit the average growth curve (AGC); e...

Stanford University) Abstract: A curve is a one dimensional space cut out by polynomial equations, such as y2=x3+x. In particular, one can consider curves over finite fields, which means the polynomial equations should have coefficients in some finite field and that points on the curve are given by values of the variables (x and y in the example) in the finite field that satisfy the given polyn...

Keywords: Bé zier curve Curve intersection Bé zier clipping Hybrid clipping a b s t r a c t This paper presents a novel approach, called hybrid clipping, for computing all intersections between two polynomial Bé zier curves within a given parametric domain in the plane. Like Bé zier clipping, we compute a 'fat line' (a region along a line) to bound one of the curves. Then we compute a 'fat curv...

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...