Displaying 1841 – 1860 of 3014

Showing per page

On the discrepancy of Markov-normal sequences

M. B. Levin (1996)

Journal de théorie des nombres de Bordeaux

We construct a Markov normal sequence with a discrepancy of O ( N - 1 / 2 log 2 N ) . The estimation of the discrepancy was previously known to be O ( e - c ( log N ) 1 / 2 ) .

On the discrepancy of sequences associated with the sum-of-digits function

Gerhard Larcher, N. Kopecek, R. F. Tichy, G. Turnwald (1987)

Annales de l'institut Fourier

If w = ( q k ) k N denotes the sequence of best approximation denominators to a real α , and s α ( n ) denotes the sum of digits of n in the digit representation of n to base w , then for all x irrational, the sequence ( s α ( n ) · x ) n N is uniformly distributed modulo one. Discrepancy estimates for the discrepancy of this sequence are given, which turn out to be best possible if α has bounded continued fraction coefficients.

On the discrete logarithm problem for plane curves

Claus Diem (2012)

Journal de Théorie des Nombres de Bordeaux

In this article the discrete logarithm problem in degree 0 class groups of curves over finite fields given by plane models is studied. It is proven that the discrete logarithm problem for non-hyperelliptic curves of genus 3 (given by plane models of degree 4) can be solved in an expected time of O ˜ ( q ) , where q is the cardinality of the ground field. Moreover, it is proven that for every fixed natural number d 4 the following holds: We consider the discrete logarithm problem for curves given by plane models...

On the distance between generalized Fibonacci numbers

Jhon J. Bravo, Carlos A. Gómez, Florian Luca (2015)

Colloquium Mathematicae

For an integer k ≥ 2, let ( F ( k ) ) be the k-Fibonacci sequence which starts with 0,..., 0,1 (k terms) and each term afterwards is the sum of the k preceding terms. This paper completes a previous work of Marques (2014) which investigated the spacing between terms of distinct k-Fibonacci sequences.

On the distribution in the arithmetic progressions of reducible quadratic polynomials in short intervals, II

Giovanni Coppola, Saverio Salerno (2001)

Journal de théorie des nombres de Bordeaux

This paper gives further results about the distribution in the arithmetic progressions (modulo a product of two primes) of reducible quadratic polynomials ( a n + b ) ( c n + d ) in short intervals n [ x , x + x ϑ ] , where now ϑ ( 0 , 1 ] . Here we use the Dispersion Method instead of the Large Sieve to get results beyond the classical level ϑ , reaching 3 ϑ / 2 (thus improving also the level of the previous paper, i.e. 3 ϑ - 3 / 2 ), but our new results are different in structure. Then, we make a graphical comparison of the two methods.

Currently displaying 1841 – 1860 of 3014