normal polynomial
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2019 ◽  
Vol 19 (11) ◽  
pp. 2050210
Author(s):  
Ryul Kim ◽  
Hyang-Sim Son

Some results on the [Formula: see text]-normal elements and [Formula: see text]-normal polynomials over finite fields are given in the recent literature. In this paper, we show that a transformation [Formula: see text] can be used to produce an infinite sequence of irreducible polynomials over a finite field [Formula: see text] of characteristic [Formula: see text]. By iteration of this transformation, we construct the [Formula: see text]-normal polynomials of degree [Formula: see text] in [Formula: see text] starting from a suitable initial [Formula: see text]-normal polynomial of degree [Formula: see text]. We also construct an infinite sequence of [Formula: see text]-normal polynomials using a certain quadratic transformation over [Formula: see text].


2010 ◽  
Vol 20 (08) ◽  
pp. 977-990 ◽  
Author(s):  
S. PÉREZ-DÍAZ ◽  
J. R. SENDRA ◽  
C. VILLARINO

In this paper we analyze the problem of deciding the normality (i.e. the surjectivity) of a rational parametrization of a surface [Formula: see text]. The problem can be approached by means of elimination theory techniques, providing a proper close subset [Formula: see text] where surjectivity needs to be analyzed. In general, these direct approaches are unfeasible because [Formula: see text] is very complicated and its elements computationally hard to manipulate. Motivated by this fact, we study ad hoc computational alternative methods that simplifies [Formula: see text]. For this goal, we introduce the notion of pseudo-normality, a concept that provides necessary conditions for a parametrization for being normal. Also, we provide an algorithm for deciding the pseudo-normality. Finally, we state necessary and sufficient conditions on a pseudo-normal parametrization to be normal. As a consequence, certain types of parametrizations are shown to be always normal. For instance, pseudo-normal polynomial parametrizations are normal. Moreover, for certain class of parametrizations, we derive an algorithm for deciding the normality.


Sign in / Sign up

Export Citation Format

Share Document