scholarly journals Bounds for the smallest integer point of a rational curve

2003 ◽  
Vol 107 (3) ◽  
pp. 251-268
Author(s):  
Dimitrios Poulakis
Keyword(s):  
Integer Point ◽  
Rational Curve

scholarly journals Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective

4OR ◽  
2020 ◽  
Author(s):  
Michele Conforti ◽  
Marianna De Santis ◽  
Marco Di Summa ◽  
Francesco Rinaldi
Keyword(s):  
Integer Point ◽  
Cutting Plane ◽  
Integer Program ◽  
Compact Set ◽  
Cutting Plane Method ◽  
Integer Points ◽  
Gomory Cuts ◽  
The Family ◽  
Split Cuts ◽  
Number Of Iterations

AbstractWe consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-inequalities) that define the convex hull of the integer points in K that are not lexicographically smaller than x. The family of lex-inequalities contains the Chvátal–Gomory cuts, but does not contain and is not contained in the family of split cuts. This provides a finite cutting plane method to solve the integer program $$\min \{cx: x\in S\cap \mathbb {Z}^n\}$$ min { c x : x ∈ S ∩ Z n } , where $$S\subset \mathbb {R}^n$$ S ⊂ R n is a compact set and $$c\in \mathbb {Z}^n$$ c ∈ Z n . We analyze the number of iterations of our algorithm.

scholarly journals Zariski k-plets of rational curve arrangements and dihedral covers

2004 ◽  
Vol 142 (1-3) ◽  
pp. 227-233 ◽  
Author(s):  
Enrique Artal Bartolo ◽  
Hiro-o Tokunaga
Keyword(s):  
Rational Curve

Minimal Generators of the Defining Ideal of the Rees Algebra Associated with a Rational Plane Parametrization with μ = 2

2014 ◽  
Vol 66 (6) ◽  
pp. 1225-1249 ◽  
Author(s):  
Teresa Cortadellas Benítez ◽  
Carlos D'Andrea
Keyword(s):  
Projective Plane ◽  
Rational Curve ◽  
Rees Algebra ◽  
Homogeneous Polynomials ◽  
Rational Plane ◽  
Minimal Generators ◽  
The Ideal

AbstractWe exhibit a set of minimal generators of the defining ideal of the Rees Algebra associated with the ideal of three bivariate homogeneous polynomials parametrizing a proper rational curve in projective plane, having a minimal syzygy of degree 2.

scholarly journals A Family of Integer-Point Ternary Parametric Subdivision Schemes

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Ghulam Mustafa ◽  
Muhammad Asghar ◽  
Shafqat Ali ◽  
Ayesha Afzal ◽  
Jia-Bao Liu
Keyword(s):  
General Formula ◽  
Integer Point ◽  
Laurent Polynomial ◽  
Polynomial Method ◽  
Subdivision Schemes ◽  
Smooth Curves ◽  
Curves And Surfaces

New subdivision schemes are always required for the generation of smooth curves and surfaces. The purpose of this paper is to present a general formula for family of parametric ternary subdivision schemes based on the Laurent polynomial method. The different complexity subdivision schemes are obtained by substituting the different values of the parameter. The important properties of the proposed family of subdivision schemes are also presented. The continuity of the proposed family is C 2 m . Comparison shows that the proposed family of subdivision schemes has higher degree of polynomial generation, degree of polynomial reproduction, and continuity compared with the exiting subdivision schemes. Maple software is used for mathematical calculations and plotting of graphs.

Dimensional Synthesis and Constrained Motion Interpolation for Planar and Spherical 6R Closed Chains

2008 ◽  
Author(s):  
Anurag Purwar ◽  
Zhe Jin ◽  
Qiaode Jeffrey Ge
Keyword(s):  
Rational Curve ◽  
Dimensional Synthesis ◽  
Constrained Motion ◽  
Initial Attempt ◽  
Kinematic Constraints ◽  
Constraint Manifold ◽  
Cartesian Space ◽  
Closed Chain ◽  
Kinematic Mapping ◽  
The Given

In the recent past, we have studied the problem of synthesizing rational interpolating motions under the kinematic constraints of any given planar and spherical 6R closed chain. This work presents some preliminary results on our initial attempt to solve the inverse problem, that is to determine the link lengths of planar and spherical 6R closed chains that follow a given smooth piecewise rational motion under the kinematic constraints. The kinematic constraints under consideration are workspace related constraints that limit the position of the links of planar and spherical closed chains in the Cartesian space. By using kinematic mapping and a quaternions based approach to represent displacements of the coupler of the closed chains, the given smooth piecewise rational motion is mapped to a smooth piecewise rational curve in the space of quaternions. In this space, the aforementioned workspace constraints on the coupler of the closed chains define a constraint manifold representing all the positions available to the coupler. Thus the problem of dimensional synthesis may be solved by modifying the size, shape and location of the constraint manifolds such that the mapped rational curve is contained entirely inside the constraint manifolds. In this paper, two simple examples with preselected moving pivots on the coupler as well as fixed pivots are presented to illustrate the feasibility of this approach.

An elementary proof and an extension of Thas' theorem on k-arcs

1989 ◽  
Vol 105 (3) ◽  
pp. 459-462 ◽  
Author(s):  
Hitoshi Kaneta ◽  
Tatsuya Maruta
Keyword(s):  
Finite Field ◽  
Projective Space ◽  
Elementary Proof ◽  
Rational Curve ◽  
Image Position

Let q be the finite field of q elements. Denote by Sr q the projective space of dimension r over q. In Sr,q, where r ≥ 2, a k-arc is defined (see [4]) as a set of k points such that no j + 2 lie in a Sj,q, for j = 1,2,…, r−1. (For a k-arc with k > r, this last condition holds for all j when it holds for j = r−1.) A rational curve Cn of order n in Sr,q, is the set

Sign in / Sign up

Export Citation Format

Share Document