Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Newton polygon

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Nearly irreducibility of polynomials and the Newton diagrams

100%

Masternak M.

Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica

2020

tom 19

65-77

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero in C2. In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.

The groups of points on abelian varieties over finite fields

88%

Rybakov S.

Open Mathematics

2010

tom 8

nr 2

282-288

Let A be an abelian variety with commutative endomorphism algebra over a finite field k. The k-isogeny class of A is uniquely determined by a Weil polynomial f A without multiple roots. We give a classification of the groups of k-rational points on varieties from this class in terms of Newton polygons of f A(1 − t).

Ograniczanie wyników

1 Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica

1 Open Mathematics

1 Masternak M.

1 Rybakov S.

1 2020

1 2010

Wyniki wyszukiwania

Nearly irreducibility of polynomials and the Newton diagrams

The groups of points on abelian varieties over finite fields