970 resultados para Rational Curves
Resumo:
In this note we survey recent results on automorphisms of affine algebraic varieties, infinitely transitive group actions and flexibility. We present related constructions and examples, and discuss geometric applications and open problems.
Resumo:
1 Supported in part by the Norwegian Research Council for Science and the Humanities. It is a pleasure for this author to thank the Department of Mathematics of the University of Sofia for organizing the remarkable conference in Zlatograd during the period August 28-September 2, 1995. It is also a pleasure to thank the M.I.T. Department of Mathematics for its hospitality from January 1 to July 31, 1993, when this work was started. 2Supported in part by NSF grant 9400918-DMS.
Resumo:
We determine the number of F-q-rational points of a class of Artin-Schreier curves by using recent results concerning evaluations of some exponential sums. In particular, we determine infinitely many new examples of maximal and minimal plane curves in the context of the Hasse-Weil bound. (C) 2002 Elsevier Science (USA).
Resumo:
When applying computational mathematics in practical applications, even though one may be dealing with a problem that can be solved algorithmically, and even though one has good algorithms to approach the solution, it can happen, and often it is the case, that the problem has to be reformulated and analyzed from a different computational point of view. This is the case of the development of approximate algorithms. This paper frames in the research area of approximate algebraic geometry and commutative algebra and, more precisely, on the problem of the approximate parametrization.
Resumo:
2000 Mathematics Subject Classification: 14H50.
Resumo:
Consider the celebrated Lyness recurrence $x_{n+2}=(a+x_{n+1})/x_{n}$ with $a\in\Q$. First we prove that there exist initial conditions and values of $a$ for which it generates periodic sequences of rational numbers with prime periods $1,2,3,5,6,7,8,9,10$ or $12$ and that these are the only periods that rational sequences $\{x_n\}_n$ can have. It is known that if we restrict our attention to positive rational values of $a$ and positive rational initial conditions the only possible periods are $1,5$ and $9$. Moreover 1-periodic and 5-periodic sequences are easily obtained. We prove that for infinitely many positive values of $a,$ positive 9-period rational sequences occur. This last result is our main contribution and answers an open question left in previous works of Bastien \& Rogalski and Zeeman. We also prove that the level sets of the invariant associated to the Lyness map is a two-parameter family of elliptic curves that is a universal family of the elliptic curves with a point of order $n, n\ge5,$ including $n$ infinity. This fact implies that the Lyness map is a universal normal form for most birrational maps on elliptic curves.
Resumo:
Given an elliptic curve E and a finite subgroup G, V ́lu’s formulae concern to a separable isogeny IG : E → E ′ with kernel G. In particular, for a point P ∈ E these formulae express the first elementary symmetric polynomial on the abscissas of the points in the set P + G as the difference between the abscissa of IG (P ) and the first elementary symmetric polynomial on the abscissas of the nontrivial points of the kernel G. On the other hand, they express Weierstraß coefficients of E ′ as polynomials in the coefficients of E and two additional parameters: w0 = t and w1 = w. We generalize this by defining parameters wn for all n ≥ 0 and giving analogous formulae for all the elementary symmetric polynomials and the power sums on the abscissas of the points in P +G. Simultaneously, we obtain an efficient way of performing computations concerning the isogeny when G is a rational group.
Resumo:
Two algorithms for finding the point on non-rational/rational Bezier curves of which the normal vector passes through a given external point are presented. The algorithms are based on Bezier curves generation algorithms of de Casteljau's algorithm for non-rational Bezier curve or Farin's recursion for rational Bezier curve, respectively. Orthogonal projections from the external point are used to guide the directional search used in the proposed iterative algorithms. Using Lyapunov's method, it is shown that each algorithm is able to converge to a local minimum for each case of non-rational/rational Bezier curves. It is also shown that on convergence the distance between the point on curves to the external point reaches a local minimum for both approaches. Illustrative examples are included to demonstrate the effectiveness of the proposed approaches.
Resumo:
Let E/Q be an elliptic curve and p a rational prime of good ordinary reduction. For every imaginary quadratic field K/Q satisfying the Heegner hypothesis for E we have a corresponding line in E(K)\otimes Q_p, known as a shadow line. When E/Q has analytic rank 2 and E/K has analytic rank 3, shadow lines are expected to lie in E(Q)\otimes Qp. If, in addition, p splits in K/Q, then shadow lines can be determined using the anticyclotomic p-adic height pairing. We develop an algorithm to compute anticyclotomic p-adic heights which we then use to provide an algorithm to compute shadow lines. We conclude by illustrating these algorithms in a collection of examples.
Resumo:
A curve defined over a finite field is maximal or minimal according to whether the number of rational points attains the upper or the lower bound in Hasse-Weil's theorem, respectively. In the study of maximal curves a fundamental role is played by an invariant linear system introduced by Ruck and Stichtenoth in [6]. In this paper we define an analogous invariant system for minimal curves, and we compute its orders and its Weierstrass points. In the last section we treat the case of curves having genus three in characteristic two.
Resumo:
This paper is framed within the problem of analyzing the rationality of the components of two classical geometric constructions, namely the offset and the conchoid to an algebraic plane curve and, in the affirmative case, the actual computation of parametrizations. We recall some of the basic definitions and main properties on offsets (see [13]), and conchoids (see [15]) as well as the algorithms for parametrizing their rational components (see [1] and [16], respectively). Moreover, we implement the basic ideas creating two packages in the computer algebra system Maple to analyze the rationality of conchoids and offset curves, as well as the corresponding help pages. In addition, we present a brief atlas where the offset and conchoids of several algebraic plane curves are obtained, their rationality analyzed, and parametrizations are provided using the created packages.
Resumo:
Thesis (Ph.D.)--University of Washington, 2016-06
Resumo:
2000 Mathematics Subject Classification: 14H45, 14H50, 14J26.
Resumo:
The objective of this study was to review the growth curves for Turner syndrome, evaluate the methodological and statistical quality, and suggest potential growth curves for clinical practice guidelines. The search was carried out in the databases Medline and Embase. Of 1006 references identified, 15 were included. Studies constructed curves for weight, height, weight/height, body mass index, head circumference, height velocity, leg length, and sitting height. The sample ranged between 47 and 1,565 (total = 6,273) girls aged 0 to 24 y, born between 1950 and 2006. The number of measures ranged from 580 to 9,011 (total = 28,915). Most studies showed strengths such as sample size, exclusion of the use of growth hormone and androgen, and analysis of confounding variables. However, the growth curves were restricted to height, lack of information about selection bias, limited distributional properties, and smoothing aspects. In conclusion, we observe the need to construct an international growth reference for girls with Turner syndrome, in order to provide support for clinical practice guidelines.
Resumo:
The cleanness level in fresh market tomatoes cleaning equipment is essential for consumer acceptance and conservation of product quality. However, the washing process in cleaning current equipments demands an excessive volume of water, leading to serious economic and environmental concerns. The objective of this work was to contribute with technical information for the washing system optimization. The conventional washing system currently used in cleaning equipment, which consists of perforated PVC pipes, was compared with a proposed system which uses commercial sprays. Characteristic curves (flow rate versus pressure) for both systems were determined in lab conditions and the respective water consumptions were compared. The results confirmed the excess of water consumption in the conventional washing systems, and the proposed system proved that is possible to reduce it, and the use of sprays allowed the rational use of the water.