Results 11 to 20 of about 1,276 (43)
Artin's primitive root conjecture -a survey - [PDF]
, 2012 This is an expanded version of a write-up of a talk given in the fall of 2000 in Oberwolfach. A large part of it is intended to be understandable by non-number theorists with a mathematical background.
Moree, Pieter
core +2 more sources
Exponential sums and polynomial congruences in two variables: the quasi-homogeneous case [PDF]
, 2012 We adapt ideas of Phong, Stein and Sturm and ideas of Ikromov and M\"uller from the continuous setting to various discrete settings, obtaining sharp bounds for exponential sums and the number of solutions to polynomial congruences for general quasi ...
Wright, James
core +1 more source
Spectral transfer morphisms for unipotent affine Hecke algebras [PDF]
, 2015 In this paper we will give a complete classification of the spectral transfer morphisms between the unipotent affine Hecke algebras of the various inner forms of a given quasi-split absolutely simple algebraic group, defined over a non-archimidean local ...
Opdam, Eric
core +4 more sources
The order of the reductions of an algebraic integer
, 2014 Let K be a number field, and let a be a non-zero element of K. Fix some prime number l. We compute the density of the following set: the primes p of K such that the multiplicative order of the reduction of a modulo p is coprime to l (or, more generally ...
Perucca, Antonella
core +1 more source
Prime Factors of Dynamical Sequences
, 2010 Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n.
Faber, Xander, Granville, Andrew
core +2 more sources
On the linear complexity of Sidel'nikov Sequences over Fd [PDF]
, 2006 We study the linear complexity of sequences over the prime field Fd introduced by Sidel’nikov. For several classes of period length we can show that these sequences have a large linear complexity.
Brandstätter, Nina, Meidl, Wilfried
core
Lucas' theorem: its generalizations, extensions and applications (1878--2014) [PDF]
, 2014 In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a prime, $n=n_0 ...
Meštrović, Romeo
core
Variation of Iwasawa invariants in Hida families
, 2004 Let r : G_Q -> GL_2(Fpbar) be a p-ordinary and p-distinguished irreducible residual modular Galois representation. We show that the vanishing of the algebraic or analytic Iwasawa mu-invariant of a single modular form lifting r implies the vanishing of ...
Emerton, Matthew +2 more
core +1 more source
p-Adic valuation of weights in Abelian codes over /spl Zopf/(p/sup d/) [PDF]
, 2005 Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEliece. McEliece's original theorem relates the greatest power of p dividing the Hamming weights of words in cyclic codes over GF (p) to the length of the ...
Katz, Daniel J.
core
Rigorous Analysis of a Randomised Number Field Sieve
, 2018 Factorisation of integers $n$ is of number theoretic and cryptographic significance. The Number Field Sieve (NFS) introduced circa 1990, is still the state of the art algorithm, but no rigorous proof that it halts or generates relationships is known.
Lee, Jonathan, Venkatesan, Ramarathnam
core +1 more source