The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 4581 – 4600 of 16591

Showing per page

Facteurs communs et torsion en caractéristique non nulle

Laurent Denis (2011)

Journal de Théorie des Nombres de Bordeaux

Le pgcd de quantités de la forme a n - 1 et b n - 1 a été étudié dans différentes situations. Dans la première partie de ce texte nous prouverons que si a et b appartiennent à 𝔽 q [ T ] , le pgcd en question peut être borné indépendamment de n dans de nombreux cas. Ceci répond en particulier à une question de J. Silverman. Dans la deuxième partie nous étudierons un problème analogue dans la situation des modules de Drinfeld.

Factor tables 1657–1817, with notes on the birth of number theory

Maarten Bullynck (2010)

Revue d'histoire des mathématiques

The history of the construction, organisation and publication of factor tables from 1657 to 1817, in itself a fascinating story, also touches upon many topics of general interest for the history of mathematics. The considerable labour involved in constructing and correcting these tables has pushed mathematicians and calculators to organise themselves in networks. Around 1660 J. Pell was the first to motivate others to calculate a large factor table, for which he saw many applications, from Diophantine...

Factoring and testing primes in small space

Viliam Geffert, Dana Pardubská (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We discuss how much space is sufficient to decide whether a unary given number n is a prime. We show that O(log log n) space is sufficient for a deterministic Turing machine, if it is equipped with an additional pebble movable along the input tape, and also for an alternating machine, if the space restriction applies only to its accepting computation subtrees. In other words, the language is a prime is in pebble–DSPACE(log log n) and also in accept–ASPACE(log log n). Moreover, if the given n is...

Factoring polynomials over global fields

Karim Belabas, Mark van Hoeij, Jürgen Klüners, Allan Steel (2009)

Journal de Théorie des Nombres de Bordeaux

We prove that van Hoeij’s original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well as natural variants. In particular, our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.

Factorisability and wildly ramified Galois extensions

David J. Burns (1991)

Annales de l'institut Fourier

Let L / K be an abelian extension of p -adic fields, and let 𝒪 denote the valuation ring of K . We study ideals of the valuation ring of L as integral representations of the Galois group Gal ( L / K ) . Assuming K is absolutely unramified we use techniques from the theory of factorisability to investigate which ideals are isomorphic to an 𝒪 -order in the group algebra K [ Gal ( l / K ) ] . We obtain several general and also explicit new results.

Currently displaying 4581 – 4600 of 16591