Sciweavers

25 search results - page 3 / 5
» Generating series for irreducible polynomials over finite fi...
Sort
View
FFA
2008
82views more  FFA 2008»
13 years 5 months ago
Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
Valérie Berthé, Hitoshi Nakada, Rie ...
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
13 years 5 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
14 years 9 days ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 5 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 6 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov