Additive irreducibles in α-expansions
|
|
- Kory Janis Goodman
- 5 years ago
- Views:
Transcription
1 Publ. Math. Debrecen Manuscript Additive irreducibles in α-expansions By Peter J. Grabner and Helmut Prodinger * Abstract. The Bergman number system uses the base α = + 5 2, the digits 0 and, and the condition that adjacent ones are forbidden. We are interested in those positive integers such that replacing one or more of the ones never results again in a positive integer; they are called additively irreducible. These numbers are characterised in terms of the positions of their ones. Further, the number of irreducible positive integers below a given bound is considered and evaluated asymptotically, as the bound goes to infinity. The periodic function that appears is analysed in detail.. Introduction Let α = be the golden ratio. It is well known that each natural number n has a unique α-expansion n = k Zε k α k with the digits ε k {0,}, such that no nonzero digits are adjacent to each other, and only a finite number of digits is different from 0 cf. [, 4]. It is sometimes called Bergman s number system. If one considers a standard q-ary expansion ε k q k 2 Received by the editors August 3, 20. Mathematics Subject Classification: A63, K6, M4. Key words and phrases: Bergman expansion, non-integer base. This author is supported by the project S9605-N2 of the Austrian Science Fund. * This author is supported by an incentive grant from the South African National Research Foundation. k 0
2 2 P. J. Grabner and H. Prodinger of a natural number, with digits ε k in the set {0,...,q } then one still gets a natural number if one replaces some of the digits by zero. We are interested in positive integers such that all the numbers L I = L k= K ε k α k, k= K ε k α k for K < K and L < L are no integers if they are not zero. The integers I with this property can be seen as the additive building blocks of the integers in the Bergman-representation. Positive integers that cannot be decomposed any further in the above sense will be called additive irreducibles, or α-irreducibles for short. It is easy to see that the decomposition into α-irreducibles is unique. Here is a short list of the first few natural numbers, decomposed into additive irreducibles:,2,3,4= +3,5,6,7,8= +7,9 = 2+7,0 = 3+7, = 4+7,2, 3,4,5= +4,6,7,8,9= +8,20 = 2+8,2 = 3+8, 22 = 4+8,23 = 5+8,24 = 6+8,25 = 7+8,26 = +7+8,..., = ,.... The original motivation for studying these integers was that every positive integer n can be decomposed uniquely into a sum of Is; n = I + +I k. The sum-of-digits function in Bergman-representation of integers s B L l= K ε l α l = is additive with respect to this decomposition L l= K s B I + +I k = s B I + +s B I k. The sum-of-digits function s B has been studied in [2]. In this paper, we will prove the following theorems, a characterisation of the α-irreducibles m in terms of the α-expansion, and an irreducible number counting theorem, giving an asymptotic formula for the number of α-irreducibles below a given number n. ε l
3 Additive irreducibles in α-expansions 3 Theorem. An integer m > with α-expansion m = α e + + α e l + α f + +α f h with e > > e l, and 0 > f > > f h is an α-irreducible, iff e,...,e l are odd. Equivalently, m is an α-irreducible, iff f,...,f h are odd and f h is even. In words, the positive exponents must all be odd, with the possible exception of the smallest one. Since m = is α-irreducible by definition, α 0 cannot occur in the Bergman-expansion of an α-irreducible. Theorem 2. ThenumberAnofα-irreduciblesamongthenumbers,...,n satisfies for n an asymptotic formula An = Φ 2 log αn n ρ +Ologn, with ρ = log2 2logα = and Φ a continuous periodic function of period. Primes.eps Fourier50.eps Figure. Plot of the function Φ compared to the first 50 terms of its Fourier series. 2. Proofs Lemma. Let ε K,...,ε L {0,} be a sequence of digits satisfying the condition that no two consecutive digits are both and assume that n = Then K = 2 L 2 holds. L l= K ε l α l N with ε K = ε L =.
4 4 P. J. Grabner and H. Prodinger Proof. Since n is an integer, it is not changed by applying the conjugation α α in the ring Z[α]. This gives n = L l= K ε l α l = K l ε l α l. l= L The highest occurring power in this sum has to be even, since otherwise the number represented by the sum would be negative. For even K we have α K α K 3 α K 5 = α K < n < α K +α K 2 + = α K+. On the other hand α L < n < α L+, which gives the inequalities L < K + and L+ > K. Thus we have L K L+, which together with the fact that K is even implies K = 2 L 2. The following Lemma explains how the positive powers in the expansion of an integer determine the negative powers. Lemma 2. Let ε 0,...,ε L {0,} be a sequence of digits satisfying the condition that no two consecutive digits are both. Let 0 < 2l < 2l 2 <... < 2l m be the strictly positive even indices of non-zero digits set m = 0, if there are none and set l 0 = 0 and l m+ =. Furthermore, let 2l j < 2k j + < 2l j+ 0 j m be the largest odd index of a non-zero digit between the two consecutive even indices 2l j and 2l j+. Set k j = l j, if all digits ε 2lj+,...,ε 2lj+ are zero. Then L ε l α l l=0 L m = ε l α l + l=0 j=0 { for ε 2l+ α 2l +α 2kj 2 k0 =, 0 otherwise, k j 3 where the sum in the first parenthesis is 0 if k 0 =. Proof. We first notice that the sum over the negative powers of α is an admissible expansion no two consecutive digits are and therefore less than.
5 Additive irreducibles in α-expansions 5 Let L k = α k + α k denote the k-th Lucas-number. Then we have ε 2lj α 2lj + k j ε 2l+ α 2l+ + = ε 2lj α 2lj + = ε 2lj L 2lj + k j k j ε 2l+ k j ε 2l+ α 2l +α 2kj 2 α 2l+ α 2l + ε 2l+ L 2l+ N k j α 2l +α 2kj 2 for j > 0; a slight modification is necessary for j = 0. Thus the number in 3 is an integer which is at most larger than L l=0 ε lα l, which proves the lemma. Proof of Theorem. The decomposition of an integer given in Lemma 2 shows that the only possibility for an integer to be additively irreducible is that there is only one summand in the decomposition 3. Notice that by Lemma every expansion of an integer has to end with the digit in an even position. Thus the summands in 3 cannot be decomposed any further. The only possibilities to have only one summand in the decomposition 3 is to either have m = 0 and therefore no non-zero digit in an even position, or m = and k 0 =. The first possibility is the case when e,...,e l are all odd, the second possibility is the case when e,...,e l are odd and e l is even. Proof of Theorem 2. Let Then define the set A by { L } A = ε 2l+ α 2l+ l : ε 2l+ {0,}. l=0 A = α 2k α 2 A + {}, 4 k= where the union is disjoint. Furthermore, we define A = A A \ {0}. The set of α-irreducibles is then formed by completing A with appropriate digits after the comma by Theorem and Lemma 2. We now count the number of elements of A less than X = 2L+ l=0 ε l α l, 5
6 6 P. J. Grabner and H. Prodinger where we assume that either ε 2L+ = or ε 2L =. We denote X k = 2L+ l=k ε l α l and define M = max{l ε 2l = } set M = 0 if the set is empty. Then we have #{a A a < X} = 2L+ k=2m The condition X k+ a < X k implies that and a = k δ l α l + l=0 #{a A X k+ a < X k }. 2L+ l=k+ k δ l α l < ε k α k. l=0 ε l α l Thus a A can only hold if the digits ε 2L+,...,ε k+ have the property that all non-zero digits have odd index, except possibly for the index k+. This explains why the sum starts with k = 2M. For k 2M all non-zero digits in ε 2L+,...,ε k+ have odd index; then the digits δ k,...,δ 0 can be chosen so that all non-zero digits have odd index, except possibly for the index of the last non-zero digit. For k the number of possible choices for δ k,...,δ 0 is then k 2 ε k l= 2 k 2 l +2 k 2 = ε k 3 2 k 2, where each summand in the sum corresponds to those choices of digits, which end with a non-zero digit at the even position 2l, whereas the second term counts the choices which only have non-zero digits in odd positions. For k = 0 the number of possible choices is ε 0 ; this can only occur, if M = 0. For x = ε k α k [α 2,] k=
7 Additive irreducibles in α-expansions 7 define px = min{k ε k = and k even} and px φx = ε k 2 k+ 2. k= Then the number of α-irreducibles less than X = α 2L+2 y with y [α 2,] equals min{py,2l} k= ε 2L+ k 3 2 L k 2 +ε 2L+ = 2 L 3φy+OL. Defining Φt = 2 t 3φα 2t 2 for 0 t and writing #{a A a < X} = 2 L 3φXα 2L 2 +OL = X ρ Xα 2L 2 ρ 3φXα 2L 2 +OL = X Φ ρ 2 log αx L +OlogX gives the number of truncated irreducibles. The function φ is continuous on the interval [α 2,]: we only have to check that two different representations of a number x give the same value for φx. For that let L L x = ε l α l = ε l α l + α L+2k, l= where ε L =. Then we have l= px < L: φx = px l= ε l2 l+ 2, since the digits with index < L are the same for both representations px = L: in this case we have φx = L l= k= L ε l 2 l+ 2 = ε l 2 l+ 2 + l= k= 2 L+2k 2, since the last sum equals 2 L 2 = 2 L+ 2, because L is even.
8 8 P. J. Grabner and H. Prodinger px > L: in this case we have φx = L l= because L+ is even. L ε l 2 l+ 2 = ε l 2 l L+ 2, l= Let x,y be two real numbers with α k x y < α k. Then either the digital expansions of x and y to base α agree up to the k-th digit, which yields φx φy < 2 k 2; or the two numbers have less than k digits in common. In this case there exists a number ξ between x and y which has two different representations to base α, which have k digits in common with x and y respectively. Then φx φy φx φξ + φξ φy 2 k 2 + and we have We now have for N = X and X as in 5 φx φy 2 x y ρ. 6 AN = #{n < N n irreducible} = #{a A a < X}+O = X Φ ρ 2 log αx +OlogX = N +X N ρ Φ 2 log α N +O N ρ Φ 2 log αn Φ 2 log αx +OlogN = N ρ Φ 2 log α N +OlogN, 7 where we have used 6 to bound Φ 2 logαn Φ 2 logαx by ON ρ. This proves the theorem. 3. Dirichlet series and Fourier coefficients We will explain now how to compute the Fourier coefficients of Φ numerically to high precision. For this purpose we study the Dirichlet series ζ A s = a s, ζ A s = a s, and ζ A s = a s. 8 a A a A a A a 0
9 Additive irreducibles in α-expansions 9 Clearly, we have ζ A s = ζ A s+ζ A s and ζ A s = = α 2ks k= + a A a 0 +α 2 a s α 2s +α 2s ζ A s+α 2s l= s α 2l ζ a s+l l 9 by 4. Furthermore, by the decomposition we have A \{0} = α 2 A \{0} α+α 2 A \{0} {α} ζ A s = α 2s ζ A s+ a A a 0 α+α 2 a s +α s = 2α 2s ζ A s+α s +α 2s This gives the functional equation for ζ A s ζ A s = α 2s α s + 2 l= l= s α l ζ A s+l. l s α l ζ A s+l. 0 l This functional equation provides the analytic continuation of ζ A s to the left of Rs = ρ. It is similar in its form to the trivial functional equation of the Riemann zeta function and also in the way it is derived. This functional equation can be used to compute values of ζ A s numerically tohighprecisionbytheobservationthatforlargel, ζ A s+l α s l = Oα 3l with an explicit O-constant. Thus the series in 0 is geometrically convergent and the error can be controlled. Starting with ζ A s+k with k large enough to meet the prescribed error bound, we can use the functional equation to compute ζ A s+k,...,ζ A s by rapidly convergent series, where we can control the error bounds. For a detailed description in a similar instance we refer to [5]. From 0 we read off that ζ A s has simple poles at the points s = ρ+ kπi logα with residues Res ζ A s = k 2+ s=ρ+ kπi 4logα log α ρ kπi l= logα l α l ζ A ρ+l+ kπi, logα
10 0 P. J. Grabner and H. Prodinger which can be computed numerically by the procedure described above. By 9 ζ A s has the same poles with residues Res ζ A s = Res ζ A s. s=ρ+ kπi 2 log α s=ρ+ kπi log α We now introduce the Dirichlet generating function of all irreducible elements: ηs = n s. n N n irreducible Since the irreducible integers differ at most by from the elements of A by Lemma 2, this function has the same poles and residues as ζ A s. The counting function of irreducible elements can now be expressed by the Mellin-Perron formula from classical analytic number theory cf. [6]: BN = n<n n irreducible n = N 2πi 2+i 2 i ηsn s ds ss+. Shifting the line of integration to Rs = ρ ε, where the integral is still convergent, we obtain by residue calculus BN = N ρ ρ+ kπi kπi k Z logα ρ++ logα Res = N Ψ ρ 2 log αn +ON ρ ε s=ρ+ kπi log α ζ A se kπilog α N +ON ρ ε with a continuous periodic function Ψ. For more details on the application of this technique to digital functions we refer to [3, 5]. The counting functions AN defined in 7 and BN are related by partial Abel summation: BN = An. N The periodic function Φ in Theorem 2 is Hölder continuous with exponent ρ > 2 by6. Therefore its Fourier series is absolutely convergent by Bernstein s theorem cf. [7]. Thus the Fourier coefficients of Φ can be related to those of Ψ by Φk = n N ρ++ kπi Ψk = logα ρ+ kπi logα Res ζ A s s=ρ+ kπi log α
11 Additive irreducibles in α-expansions by [3] or [5, Proposition 5]. Wehaveusedthenumericalmethodforthecomputationofζ A sasdescribed above to compute the first Fourier coefficients Φ0 = , Φ = i, Φ2 = i. The plot of the first 50 terms of the Fourier series compared to the function Φ is shown in Figure. Acknowledgement. The authors are grateful to two anonymous referees for their valuable comments and suggestions. References [] G. M. Bergman, A number system with an irrational base, Math. Mag. 3957/58, [2] C. Cooper and R. E. Kennedy, The first moment of the number of s function in the β- expansion of the positive integers, J. Inst. Math. Comput. Sci. Math. Ser , [3] P. Flajolet, P. J. Grabner, P. Kirschenhofer, H. Prodinger, and R. F. Tichy, Mellin transforms and asymptotics: digital sums, Theor. Comput. Sci , [4] C. Frougny, How to write integers in a non-integer base, LATIN 92, São Paulo, Lecture Notes in Computer Science, vol. 583, Springer, Berlin 992. [5] P. J. Grabner and H.-K. Hwang, Digital sums and divide-and-conquer recurrences: Fourier expansions and absolute convergence, Constructive Approximation , [6] G. Tenenbaum, Introduction to analytic and probabilistic number theory, Cambridge Studies in Advanced Mathematics, no. 46, Cambridge University Press, 995. [7] A. Zygmund, Trigonometric Series. Vol. I, II, Cambridge University Press, Cambridge, 988. P. Grabner INSTITUT FÜR ANALYSIS UND COMPUTATIONAL NUMBER THEORY, TECHNISCHE UNIVERSITÄT GRAZ, STEYRERGASSE 30, 800 GRAZ, AUSTRIA Peter.Grabner@tugraz.at H. Prodinger DEPARTMENT OF MATHEMATICS UNIVERSITY OF STELLENBOSCH 7602 STELLENBOSCH SOUTH AFRICA hproding@sun.ac.za
ABSTRACT 1. INTRODUCTION
THE FIBONACCI NUMBER OF GENERALIZED PETERSEN GRAPHS Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria e-mail: wagner@finanz.math.tu-graz.ac.at
More informationHamming Weight of the Non-Adjacent-Form under Various Input Statistics. Clemens Heuberger and Helmut Prodinger
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung Hamming Weight of the Non-Adjacent-Form under Various Input Statistics Clemens Heuberger
More informationCounting Palindromes According to r-runs of Ones Using Generating Functions
3 47 6 3 Journal of Integer Sequences, Vol. 7 (04), Article 4.6. Counting Palindromes According to r-runs of Ones Using Generating Functions Helmut Prodinger Department of Mathematics Stellenbosch University
More informationDiophantine equations for second order recursive sequences of polynomials
Diophantine equations for second order recursive sequences of polynomials Andrej Dujella (Zagreb) and Robert F. Tichy (Graz) Abstract Let B be a nonzero integer. Let define the sequence of polynomials
More informationA class of trees and its Wiener index.
A class of trees and its Wiener index. Stephan G. Wagner Department of Mathematics Graz University of Technology Steyrergasse 3, A-81 Graz, Austria wagner@finanz.math.tu-graz.ac.at Abstract In this paper,
More informationCounting Palindromes According to r-runs of Ones Using Generating Functions
Counting Palindromes According to r-runs of Ones Using Generating Functions Helmut Prodinger Department of Mathematics Stellenbosch University 7602 Stellenbosch South Africa hproding@sun.ac.za Abstract
More informationFoSP. FoSP. WARING S PROBLEM WITH DIGITAL RESTRICTIONS IN F q [X] Manfred Madritsch. Institut für Analysis und Computational Number Theory (Math A)
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung WARING S PROBLM WITH DIGITAL RSTRICTIONS IN F q [X] Manfred Madritsch Institut für Analysis
More informationSORTING ALGORITHMS FOR BROADCAST COMMUNICATIONS: MATHEMATICAL ANALYSIS
SORTING ALGORITHMS FOR BROADCAST COMMUNICATIONS: MATHEMATICAL ANALYSIS PETER J. GRABNER AND HELMUT PRODINGER Abstract. Assume that n persons communicate via a channel; to each person a certain number is
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationA REMARK ON THE BOROS-MOLL SEQUENCE
#A49 INTEGERS 11 (2011) A REMARK ON THE BOROS-MOLL SEQUENCE J.-P. Allouche CNRS, Institut de Math., Équipe Combinatoire et Optimisation Université Pierre et Marie Curie, Paris, France allouche@math.jussieu.fr
More informationMaximizing the number of independent subsets over trees with maximum degree 3. Clemens Heuberger and Stephan G. Wagner
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung Maximizing the number of independent subsets over trees with maximum degree 3 Clemens
More informationDIGITAL EXPANSION OF EXPONENTIAL SEQUENCES
DIGITAL EXPASIO OF EXPOETIAL SEQUECES MICHAEL FUCHS Abstract. We consider the q-ary digital expansion of the first terms of an exponential sequence a n. Using a result due to Kiss und Tichy [8], we prove
More informationOn the number of matchings of a tree.
On the number of matchings of a tree. Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-800 Graz, Austria Abstract In a paper of Klazar, several counting examples
More informationCounting patterns in digital expansions
Counting patterns in digital expansions Manfred G. Madritsch Department for Analysis and Computational Number Theory Graz University of Technology madritsch@math.tugraz.at Séminaire ERNEST Dynamique, Arithmétique,
More information1 n <. n G F. ζ(3) c = 2ζ(2) ζ(6)log α = , Our method is general and can be applied to any Lucas sequence of general term
Fibonacci Integers Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089, Morelia, Michoacán, México fluca@matmor.unam.mx Carl Pomerance Mathematics Department, Dartmouth
More informationROSENA R.X. DU AND HELMUT PRODINGER. Dedicated to Philippe Flajolet ( )
ON PROTECTED NODES IN DIGITAL SEARCH TREES ROSENA R.X. DU AND HELMUT PRODINGER Dedicated to Philippe Flajolet (98 2) Abstract. Recently, 2-protected nodes were studied in the context of ordered trees and
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
More informationDirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007
Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).
More informationOn the Error Term for the Mean Value Associated With Dedekind Zeta-function of a Non-normal Cubic Field
Λ44ΩΛ6fi Ψ ο Vol.44, No.6 05ffμ ADVANCES IN MAHEMAICS(CHINA) Nov., 05 doi: 0.845/sxjz.04038b On the Error erm for the Mean Value Associated With Dedekind Zeta-function of a Non-normal Cubic Field SHI Sanying
More informationFirst, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x
8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.
More informationANALYSIS OF LINEAR COMBINATION ALGORITHMS IN CRYPTOGRAPHY
ANALYSIS OF LINEAR COMBINATION ALGORITHMS IN CRYPTOGRAPHY PETER J. GRABNER, CLEMENS HEUBERGER, HELMUT PRODINGER, AND JÖRG M. THUSWALDNER Abstract. Several cryptosystems rely on fast calculations of linear
More informationThe Number of Inversions in Permutations: A Saddle Point Approach
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 6 (23), Article 3.2.8 The Number of Inversions in Permutations: A Saddle Point Approach Guy Louchard Département d Informatique CP 212, Boulevard du
More informationUnits generating the ring of integers of complex cubic fields. Robert Tichy and Volker Ziegler. Project Area(s): Algorithmische Diophantische Probleme
FoSP Algorithmen & mathematische Modellierung FoSP Forschungsschwerpunkt Algorithmen und mathematische Modellierung Units generating the ring of integers of complex cubic fields Robert Tichy and Volker
More informationA Generalization of the Gcd-Sum Function
2 3 47 6 23 Journal of Integer Sequences, Vol 6 203, Article 367 A Generalization of the Gcd-Sum Function Ulrich Abel, Waqar Awan, and Vitaliy Kushnirevych Fachbereich MND Technische Hochschule Mittelhessen
More information1. Introduction This paper investigates the properties of Ramanujan polynomials, which, for each k 0, the authors of [2] define to be
ZEROS OF RAMANUJAN POLYNOMIALS M. RAM MURTY, CHRIS SMYTH, AND ROB J. WANG Abstract. In this paper, we investigate the properties of Ramanujan polynomials, a family of reciprocal polynomials with real coefficients
More informationAsymptotic results for silent elimination
Discrete Mathematics and Theoretical Computer Science DMTCS vol. subm., by the authors, 1 1 Asymptotic results for silent elimination Guy Louchard 1 and Helmut Prodinger 2 1 Université Libre de Bruxelles,
More informationNew Multiple Harmonic Sum Identities
New Multiple Harmonic Sum Identities Helmut Prodinger Department of Mathematics University of Stellenbosch 760 Stellenbosch, South Africa hproding@sun.ac.za Roberto Tauraso Dipartimento di Matematica Università
More informationDecomposition of a recursive family of polynomials
Decomposition of a recursive family of polynomials Andrej Dujella and Ivica Gusić Abstract We describe decomposition of polynomials f n := f n,b,a defined by f 0 := B, f 1 (x := x, f n+1 (x = xf n (x af
More informationTHE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION. Aleksandar Ivić
THE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION Aleksandar Ivić Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. (2), 4 48. Abstract. The Laplace transform of ζ( 2 +ix) 4 is investigated,
More informationTOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne
TOPICS IN NUMBER THEORY - EXERCISE SHEET I École Polytechnique Fédérale de Lausanne Exercise Non-vanishing of Dirichlet L-functions on the line Rs) = ) Let q and let χ be a Dirichlet character modulo q.
More informationEfficient Boltzmann Samplers for Weighted Partitions and Selections
Efficient Boltzmann Samplers for Weighted Partitions and Selections Megan Bernstein, Matthew Fahrbach and Dana Randall Georgia Institute of Technology Shanks Workshop: 29th Cumberland Conference on Combinatorics,
More informationMINIMAL EXPANSIONS IN REDUNDANT NUMBER SYSTEMS: FIBONACCI BASES AND GREEDY ALGORITHMS. 1. Introduction. ε j G j, n = j 0
To appear in Periodica Mathematica Hungarica MINIMAL EXPANSIONS IN REDUNDANT NUMBER SYSTEMS: FIBONACCI BASES AND GREEDY ALGORITHMS CLEMENS HEUBERGER Dedicated to Helmut Prodinger on the occasion of his
More informationarxiv: v1 [math.co] 22 May 2014
Using recurrence relations to count certain elements in symmetric groups arxiv:1405.5620v1 [math.co] 22 May 2014 S.P. GLASBY Abstract. We use the fact that certain cosets of the stabilizer of points are
More informationALGEBRAIC PROPERTIES OF WEAK PERRON NUMBERS. 1. Introduction
t m Mathematical Publications DOI: 10.2478/tmmp-2013-0023 Tatra Mt. Math. Publ. 56 (2013), 27 33 ALGEBRAIC PROPERTIES OF WEAK PERRON NUMBERS Horst Brunotte ABSTRACT. We study algebraic properties of real
More informationk 2r n k n n k) k 2r+1 k 2r (1.1)
J. Number Theory 130(010, no. 1, 701 706. ON -ADIC ORDERS OF SOME BINOMIAL SUMS Hao Pan and Zhi-Wei Sun Abstract. We prove that for any nonnegative integers n and r the binomial sum ( n k r is divisible
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationOn the generation of the coefficient field of a newform by a single Hecke eigenvalue
On the generation of the coefficient field of a newform by a single Hecke eigenvalue Koopa Tak-Lun Koo and William Stein and Gabor Wiese November 2, 27 Abstract Let f be a non-cm newform of weight k 2
More information7 Asymptotics for Meromorphic Functions
Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationANALYSIS OF LINEAR COMBINATION ALGORITHMS IN CRYPTOGRAPHY
Transactions on Algorithms 5), 4 ANALYSIS OF LINEAR COMBINATION ALGORITHMS IN CRYPTOGRAPHY PETER J. GRABNER, CLEMENS HEUBERGER, HELMUT PRODINGER, AND JÖRG M. THUSWALDNER Abstract. Several cryptosystems
More informationOn the digital representation of smooth numbers
On the digital representation of smooth numbers Yann BUGEAUD and Haime KANEKO Abstract. Let b 2 be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer
More informationTHE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES
THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES MICHAEL DRMOTA Abstract. The purpose of this paper is to provide upper bounds for the discrepancy of generalized Van-der-Corput-Halton sequences
More informationTHE ALTERNATING GREEDY EXPANSION AND APPLICATIONS TO COMPUTING DIGIT EXPANSIONS FROM LEFT-TO-RIGHT IN CRYPTOGRAPHY
THE ALTERNATING GREEDY EXPANSION AND APPLICATIONS TO COMPUTING DIGIT EXPANSIONS FROM LEFT-TO-RIGHT IN CRYPTOGRAPHY CLEMENS HEUBERGER, RAJENDRA KATTI, HELMUT PRODINGER, AND XIAOYU RUAN Abstract. The central
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationOn the indecomposability of polynomials
On the indecomposability of polynomials Andrej Dujella, Ivica Gusić and Robert F. Tichy Abstract Applying a combinatorial lemma a new sufficient condition for the indecomposability of integer polynomials
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More informationPETER J. GRABNER AND ARNOLD KNOPFMACHER
ARITHMETIC AND METRIC PROPERTIES OF -ADIC ENGEL SERIES EXPANSIONS PETER J. GRABNER AND ARNOLD KNOPFMACHER Abstract. We derive a characterization of rational numbers in terms of their unique -adic Engel
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationEkkehard Krätzel. (t 1,t 2 )+f 2 t 2. Comment.Math.Univ.Carolinae 43,4 (2002)
Comment.Math.Univ.Carolinae 4,4 755 77 755 Lattice points in some special three-dimensional convex bodies with points of Gaussian curvature zero at the boundary Eehard Krätzel Abstract. We investigate
More informationHardy type asymptotics for cosine series in several variables with decreasing power-like coefficients Victor Kozyakin
International Journal of Advanced Research in Mathematics Submitted: 06-03-8 ISSN: 97-63, Vol. 5, pp 35-5 Revised: 06-04-5 doi:0.805/www.scipress.com/ijarm.5.35 Accepted: 06-05-3 06 SciPress Ltd., Switzerland
More informationDISTRIBUTION RESULTS FOR LOW-WEIGHT BINARY REPRESENTATIONS FOR PAIRS OF INTEGERS
DISTRIBUTION RESULTS FOR LOW-WEIGHT BINARY REPRESENTATIONS FOR PAIRS OF INTEGERS PETER J. GRABNER, CLEMENS HEUBERGER, AND HELMUT PRODINGER Abstract. We discuss an optimal method for the computation of
More informationUNIVERSALITY OF THE RIEMANN ZETA FUNCTION: TWO REMARKS
Annales Univ. Sci. Budapest., Sect. Comp. 39 (203) 3 39 UNIVERSALITY OF THE RIEMANN ZETA FUNCTION: TWO REMARKS Jean-Loup Mauclaire (Paris, France) Dedicated to Professor Karl-Heinz Indlekofer on his seventieth
More informationEXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007
Scientiae Mathematicae Japonicae Online, e-2009, 05 05 EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS M. Aslam Chaudhry Received May 8, 2007 Abstract. We define
More informationRIEMANN HYPOTHESIS: A NUMERICAL TREATMENT OF THE RIESZ AND HARDY-LITTLEWOOD WAVE
ALBANIAN JOURNAL OF MATHEMATICS Volume, Number, Pages 6 79 ISSN 90-5: (electronic version) RIEMANN HYPOTHESIS: A NUMERICAL TREATMENT OF THE RIESZ AND HARDY-LITTLEWOOD WAVE STEFANO BELTRAMINELLI AND DANILO
More informationGrowing and Destroying Catalan Stanley Trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 20:1, 2018, #11 Growing and Destroying Catalan Stanley Trees Benjamin Hackl 1 Helmut Prodinger 2 arxiv:1704.03734v3 [math.co] 26 Feb 2018
More informationMath 259: Introduction to Analytic Number Theory How small can disc(k) be for a number field K of degree n = r 1 + 2r 2?
Math 59: Introduction to Analytic Number Theory How small can disck be for a number field K of degree n = r + r? Let K be a number field of degree n = r + r, where as usual r and r are respectively the
More informationAn arithmetic theorem related to groups of bounded nilpotency class
Journal of Algebra 300 (2006) 10 15 www.elsevier.com/locate/algebra An arithmetic theorem related to groups of bounded nilpotency class Thomas W. Müller School of Mathematical Sciences, Queen Mary & Westfield
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
More informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationUniform Distribution and Waring s Problem with digital restrictions
Uniform Distribution and Waring s Problem with digital restrictions Manfred G. Madritsch Department for Analysis and Computational Number Theory Graz University of Technology madritsch@tugraz.at Colloque
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationSHABNAM AKHTARI AND JEFFREY D. VAALER
ON THE HEIGHT OF SOLUTIONS TO NORM FORM EQUATIONS arxiv:1709.02485v2 [math.nt] 18 Feb 2018 SHABNAM AKHTARI AND JEFFREY D. VAALER Abstract. Let k be a number field. We consider norm form equations associated
More informationGraphs, Partitions and Fibonacci Numbers.
Graphs, Partitions and Fibonacci Numbers. Dedicated to Professor Helmut Prodinger on the occasion of his 50th birthday Arnold Knopfmacher a Robert F. Tichy b Stephan Wagner b Volker Ziegler b a The John
More informationA CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS
Statistica Sinica 26 (2016), 1117-1128 doi:http://dx.doi.org/10.5705/ss.202015.0240 A CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS Xu He and Peter Z. G. Qian Chinese Academy of Sciences
More informationThe number of inversions in permutations: A saddle point approach
The number of inversions in permutations: A saddle point approach Guy Louchard and Helmut Prodinger November 4, 22 Abstract Using the saddle point method, we obtain from the generating function of the
More informationFORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS
Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ
More informationAsymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees (joint with Hsien-Kuei Hwang and Vytas Zacharovas)
Asymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees (joint with Hsien-Kuei Hwang and Vytas Zacharovas) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University
More informationarxiv:math/ v1 [math.nt] 27 Feb 2004
arxiv:math/0402458v1 [math.nt] 27 Feb 2004 On simultaneous binary expansions of n and n 2 Giuseppe Melfi Université de Neuchâtel Groupe de Statistique Espace de l Europe 4, CH 2002 Neuchâtel, Switzerland
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationARGUMENT INVERSION FOR MODIFIED THETA FUNCTIONS. Introduction
ARGUMENT INVERION FOR MODIFIED THETA FUNCTION MAURICE CRAIG The standard theta function has the inversion property Introduction θ(x) = exp( πxn 2 ), (n Z, Re(x) > ) θ(1/x) = θ(x) x. This formula is proved
More informationERIC LARSON AND LARRY ROLEN
PROGRESS TOWARDS COUNTING D 5 QUINTIC FIELDS ERIC LARSON AND LARRY ROLEN Abstract. Let N5, D 5, X) be the number of quintic number fields whose Galois closure has Galois group D 5 and whose discriminant
More informationUnmixed Graphs that are Domains
Unmixed Graphs that are Domains Bruno Benedetti Institut für Mathematik, MA 6-2 TU Berlin, Germany benedetti@math.tu-berlin.de Matteo Varbaro Dipartimento di Matematica Univ. degli Studi di Genova, Italy
More information1 The functional equation for ζ
18.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The functional equation for the Riemann zeta function In this unit, we establish the functional equation property for the Riemann zeta function,
More informationPERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA
PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,
More informationFRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS
FRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS HUNDUMA LEGESSE GELETA, ABDULKADIR HASSEN Both authors would like to dedicate this in fond memory of Marvin Knopp. Knop was the most humble and exemplary teacher
More informationDyadic diaphony of digital sequences
Dyadic diaphony of digital sequences Friedrich Pillichshammer Abstract The dyadic diaphony is a quantitative measure for the irregularity of distribution of a sequence in the unit cube In this paper we
More informationUniformly discrete forests with poor visibility
Uniformly discrete forests with poor visibility Noga Alon August 19, 2017 Abstract We prove that there is a set F in the plane so that the distance between any two points of F is at least 1, and for any
More informationThe zeta function, L-functions, and irreducible polynomials
The zeta function, L-functions, and irreducible polynomials Topics in Finite Fields Fall 203) Rutgers University Swastik Kopparty Last modified: Sunday 3 th October, 203 The zeta function and irreducible
More informationCOUNTING OPTIMAL JOINT DIGIT EXPANSIONS. Peter J. Grabner 1. Clemens Heuberger 2.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(3) (25), #A9 COUNTING OPTIMAL JOINT DIGIT EXPANSIONS Peter J. Grabner Institut für Mathematik A, Technische Universität Graz, Steyrergasse
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationALGEBRAIC STRUCTURE COUNT OF ANGULAR HEXAGONAL-SQUARE CHAINS
ALGEBRAIC STRUCTURE COUNT OF ANGULAR HEXAGONAL-SQUARE CHAINS Olga Bodroža-Pantić Department of Mathematics and Informatics, Faculty of Sciences, Trg D. Obradovića 4, University of Novi Sad, 21000 Novi
More informationLINEAR FORMS IN LOGARITHMS
LINEAR FORMS IN LOGARITHMS JAN-HENDRIK EVERTSE April 2011 Literature: T.N. Shorey, R. Tijdeman, Exponential Diophantine equations, Cambridge University Press, 1986; reprinted 2008. 1. Linear forms in logarithms
More informationTHE SUM OF DIGITS OF PRIMES
THE SUM OF DIGITS OF PRIMES Michael Drmota joint work with Christian Mauduit and Joël Rivat Institute of Discrete Mathematics and Geometry Vienna University of Technology michael.drmota@tuwien.ac.at www.dmg.tuwien.ac.at/drmota/
More informationDeviation Measures and Normals of Convex Bodies
Beiträge zur Algebra und Geometrie Contributions to Algebra Geometry Volume 45 (2004), No. 1, 155-167. Deviation Measures Normals of Convex Bodies Dedicated to Professor August Florian on the occasion
More informationThere is no analogue to Jarník s relation for twisted Diophantine approximation
arxiv:1409.6665v3 [math.nt] 10 Jul 2017 There is no analogue to Jarník s relation for twisted Diophantine approximation Antoine MARNAT marnat@math.unistra.fr Abstract Jarník gave a relation between the
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationDIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS
Periodica Mathematica Hungarica Vol. 45 (1 2), 2002, pp. 21 33 DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS Andrej Dujella (Zagreb), Clemens Fuchs (Graz) and Robert F. Tichy (Graz) [Communicated by: Attila
More informationIrrationality exponent and rational approximations with prescribed growth
Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing
More informationMath 680 Fall A Quantitative Prime Number Theorem I: Zero-Free Regions
Math 68 Fall 4 A Quantitative Prime Number Theorem I: Zero-Free Regions Ultimately, our goal is to prove the following strengthening of the prime number theorem Theorem Improved Prime Number Theorem: There
More informationA Combinatorial Approach to Finding Dirichlet Generating Function Identities
The Waterloo Mathematics Review 3 A Combinatorial Approach to Finding Dirichlet Generating Function Identities Alesandar Vlasev Simon Fraser University azv@sfu.ca Abstract: This paper explores an integer
More informationSome identities related to Riemann zeta-function
Xin Journal of Inequalities and Applications 206 206:2 DOI 0.86/s660-06-0980-9 R E S E A R C H Open Access Some identities related to Riemann zeta-function Lin Xin * * Correspondence: estellexin@stumail.nwu.edu.cn
More informationDistribution results for additive functions
Distribution results for additive functions Manfred G. Madritsch Institute of Statistics Graz University of Technology madritsch@finanz.math.tugraz.at Universiteit Stellenbosch Supported by the Austrian
More information