Displaying 1941 – 1960 of 16555

Showing per page

Automaticity IV : sequences, sets, and diversity

Jeffrey Shallit (1996)

Journal de théorie des nombres de Bordeaux

This paper studies the descriptional complexity of (i) sequences over a finite alphabet ; and (ii) subsets of N (the natural numbers). If ( s ( i ) ) i 0 is a sequence over a finite alphabet Δ , then we define the k -automaticity of s , A s k ( n ) , to be the smallest possible number of states in any deterministic finite automaton that, for all i with 0 i n , takes i expressed in base k as input and computes s ( i ) . We give examples of sequences that have high automaticity in all bases k ; for example, we show that the characteristic...

Automorphic realization of residual Galois representations

Robert Guralnick, Michael Harris, Nicholas M. Katz (2010)

Journal of the European Mathematical Society

We show that it is possible in rather general situations to obtain a finite-dimensional modular representation ρ of the Galois group of a number field F as a constituent of one of the modular Galois representations attached to automorphic representations of a general linear group over F , provided one works “potentially.” The proof is based on a close study of the monodromy of the Dwork family of Calabi–Yau hypersurfaces; this in turn makes use of properties of rigid local systems and the classification...

Currently displaying 1941 – 1960 of 16555