THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES
|
|
- Peregrine Pierce Marshall
- 6 years ago
- Views:
Transcription
1 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 that are built from Halton sequences and the Zecendorf Van-der-Corput sequence.. Introduction Suppose that q 2 is a given integer and n = j 0 ε q,j (n)q j, ε q,j (n) {0,,..., q } denotes the q-ary representation of a non-negative integer n. Then the q-ary Vander-Corput (φ q (n)) n 0 sequence is defined by φ q (n) = j 0 ε q,j (n)q j. It is well nown that the Van-der-Corput sequence is a low discrepancy sequence, that is, the (star-) discrepancy D N (φ q(n)) satisfies DN(φ q (n)) log N N ; Similarly a d-dimensional Halton equences Φ q (n) that is defined by Φ q (n) = (φ q (n),..., φ qs (n)) satisfies D N(Φ q (n)) (log N)s N, if q = (q,..., q s ) consists of pairwise coprime integers q j 2. In particular all these sequences are uniformly distributed modulo (which just means that the discrepancy tends to 0 as N ). For more details on discrepancy theory and uniformly distributed sequences we refer to [2, 6]. We just note that the (star-) discrepancy DN (x n) of a s-dimensional real sequence (x n ) n 0 is defined by D N (x n ) = sup 0<α,...,α s N N [0,α) [0,α s)(x n mod ) α α s. Recently Hofer, Iaco, and Tichy [4] considered generalized Van-der-Corput and Halton sequences of the following form. Suppose that b and d 2 (or b 2 if d = ) are integers and G = (G n ) n 0 is an integer sequence defined by G 0 =, G = b(g + + G 0 ) + for < d and G = b(g + + G d ) for d. Then every non-negative integer n can be uniquely represented by (.) n = j 0 ε G,j (n) G j, Key words and phrases. Halton sequence, Zecendorf Van-der-Corput sequence, discrepancy.
2 2 MICHAEL DRMOTA where the digits ε {0,,..., G j+ /G j } are (uniquely) chosen by the greedy condition J ε G,j (n)g j < G J. j=0 We will call (.) the G-ary expansion of n. Of course, this generalizes q-ary expansions, where b = q, d =, and G = q. Furthermore let β > be the dominating root of the adjoint polynomial x d bx d b = 0. Then the (so-called) β-van-der-corput sequence (φ β (n)) n 0 is defined by φ β (n) = j 0 ε G,j (n)β j. As in the case of the usual Van-der-Corput sequence it is well nown that in this case the β-van-der-corput sequence is a low-discrepancy sequence, that is DN (φ β(n)) (log N)/N, see [, 8]. A very prominent example is the β-van-der-corput sequence corresponding to the golden mean ϕ = ( + 5)/2, where the base sequence G = (G n ) n 0 is given by the Fibonacci numbers G n = F n+2. Here the digital expansion (.) is called Zecendorf expansion. And the digits ε G,j (n) {0, } just have to satisfy ε G,j (n)ε G,j+ (n) = 0, that is, there are no consecutive s. For convenience we will denote this sequence the Zecendorf Van-der-Corput sequence (φ Z (n)) n 0. Similarly to the usual Halton sequence the β-halton sequence is defined by Φ β (n) = (φ β (n),..., φ βs (n)), where the entries of β = (β,..., β s ) correspond to G i -adic expansions of the above ind, i s. By the use of ergodic properties it was shown in [4] that Φ β (n) is uniformly distributed modulo provided that the integers b i are pairwise coprime and the dominant roots β i have the property that βi /βl j Q for all integers, l and i j. However, the discrepancy was not considered at all. The purpose of the present paper is to provide a first quantitative discrepancy analysis of β-halton sequences. Theorem. Suppose that q,..., q s 2 are pairwise coprime integers. Then the discrepancy of the (s + )-dimensional sequence satisfies for every ε > 0. Φ(n) = (φ q (n),..., φ qs (x), φ Z (n)) D N (Φ(n)) N ε It remains an open problem whether this ind of generalized Halton sequences are low discrepancy sequences. Nevertheless the upper bound given in Theorem is close to optimality. We leave this as an open problem. Problem. Suppose that Φ β (n) = (φ β (n),..., φ βs (n)) is a s-dimensional β-halton sequence that is uniformly distributed modulo. Is Φ β (n) also a low-discrepancy sequence, too, that is, DN (log N)s (Φ β (n))? N Actually it is not clear how far Theorem can be generalized. It would be desirable to cover (at least) the ind of sequences that are discussed in [4]. However, it seems that the methods that are applied in the present paper are not sufficient to handle these cases. In the case of the Zecendorf Van-der-Corput sequence the distribution can be reduced to distribution properties of the Weyl sequence nϕ mod (see Lemma 5). This is due to the fact that the Zecendorf expansion agrees with the Ostrowsi expansion related to the golden mean ϕ. In the more general
3 THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES 3 case it might be possible to replace this approach by a distribution analysis of a more-dimensional linear sequence (modulo ) in Rauzy fractal type sets (see [7, ]). 2. Discrepancy Bounds for Halton Sequences The purpose of this section is to present a very basic approach to the discrepancy of Halton sequences Φ q (n). These results are by no means new but are helpful to prepare the proof of Theorem. Actually all subsequent properties follow from the following observation (that is immediate from the definition). Lemma 2. Suppose that q 2, 0, and 0 m < q are integers. Then we have [ m φ q (n) q, m + ) q if and only if ε q, l (n)q l = m, l=0 that is, the digits ε q,0 (n),..., ε q, (n) are fixed or, equivalently, n is contained in a fixed residue class mod q. Lemma 2 implies a discrepancy bound (2.) for the Van-der-Corput sequence. Note that in the present case we trivially have δ so that the upper bound q L + L/N (log N)/N follows immediately by choosing L = log q N. The reason for using the formulation (2.) with explicit δ is that this ind of formula naturally generalizes to (generalized) Halton sequences. Lemma 3. Suppose that q 2 is an integer. Then we have for every integer L (2.) D N(φ q (n)) q L + N L δ, where δ = max 0 u<q #{n < N : n u mod q } N q Proof. Suppose that the interval [0, α) = I I 2 I R is partitioned into R disjoint intervals I r of lengths l r, r R. Then by the triangle inequality we have N R [0,α) (x n ) Nα N Ir (x n ) Nl r. Now if α [vq L, (v + )q L ) and v has the digital expansion v = v 0 + v q + + v L q L then we can partition the interval [0, α) into v 0 + v + + v L + intervals: v 0 intervals of the form [m 0 q, (m 0 + )q ), 0 m 0 < v ; v intervals of the form [v 0 q + m q 2, v 0 q + (m + )q 2 ), 0 m < v etc., and finally the interval [vq L, α). By Lemma 2 it follows that for every interval of the form I = [mq, (m+)q ) we have N I (φ q (n)) Nq δ. r=
4 4 MICHAEL DRMOTA Finally for the interval [vq L, α) we set J = [vq L, (v + )q L ) and obtain N [vq L,α)(φ q (n)) N J (φ q (n)) N J (φ q (n)) Nq L + Nq L δ L + Nq L. and consequently N [vq L,α)(φ q (n)) (α vq L )N δ L + 2Nq L. Of course this proves Lemma 3. By using precisely the same proof method as in the proof of Lemma 3 we obtain a direct generalization for Halton sequences. Note that the Lemma 2 together with the Chinese remainder theorem has to be used to obtain (2.2). Note again that δ,..., s so that we derive from (2.2) the upper bound D N (Φ q(n)) (log N) s /N by choosing L j = log qj N. Lemma 4. Suppose that q, q 2,..., q s 2 are pairwise coprime integers and q = (q,..., q s ). Then we have for all integers L,..., L s s (2.2) DN (Φ q (n)) + δ,... j= q Lj N s j L s L s with δ,..., s = max 0 u<q qs s #{n < N : n u mod q qs s } N qs s Finally we mention that it is easy to we extend Lemma 4 to subsequences of Halton sequences. Suppose (again) that q, q 2,..., q s 2 are pairwise coprime integers. If c(n) a sequence of non-negative integers then we obtain s with D N (Φ q (c(n))) δ,..., s = max 0 u<q qs s j= q Lj j + N L q s L s δ,... s #{n < N : c(n) u mod q qs s } N qs s Similar observations have been already made in [5]. And actually we can reprove them with the above estimates. We just recall the obervation from [5] that (Φ q (c(n))) n 0 is uniformly distributed modulo if and only if c(n) is uniformly distributed in the residue classes modulo (q q s ) for all 0. (Of course if c(n) is uniformly distributed in the residue classes modulo (q q s ) then it is also uniformly distributed in the residue classes modulo q qs s for all j.) It is also of interest to start with a sequence r(n) of non-negative real numbers and to consider the sequence (Φ q ( r(n) ) n 0. Here it follows that if the sequence r(n)/(q qs s ) is uniformly distributed modulo for all integers,... s 0 then (Φ q ( r(n) ) n 0 is uniformly distributed modulo, too. Furthermore D N(Φ q ( r(n) ) s j= q Lj j q + D N (r(n)/(q qs s )). L s L s
5 THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES 5 3. Discrepancy Bounds for the Zecendorf Van-der-Corput Sequence Next we provide a quantitive appraoch to the Zecendorf Van-der-Corput Sequence (φ Z (n)) n 0 that has strong similarities to the q-ary case from the previous section. We recall that the Fibonacci number (F n ) n 0 are given by F 0 = 0, F =, and F = F + F 2 (for 2) and that every non-negative integer n 0 has a unique representation n = j 2 ε Z,j (n)f j, where ε Z,j (n) {0, } and ε Z,j (n)ε Z,j+ (n) = 0. The Zecendorf Van-der-Corput Sequence φ Z (n) is then given by φ Z (n) = j 2 ε Z,j (n)ϕ j+, where ϕ = ( + 5)/2 is the golden mean. There is an interesting analogue to Lemma 2. information than in the q-adic case. Actually we get slightly more Lemma 5. Suppose that 3 and that the first digits ε Z,2 (n),..., ε Z, (n) are fixed. Then we equivalently have [ ) µ, µ+ if ε ϕ (3.) φ Z (n) 2 ϕ 2 Z, (n) = 0, [ ) µ, µ+ϕ if ε ϕ 2 ϕ 2 Z, (n) =, where Furthermore we have 3 µ = ε Z, l (n)ϕ l. l=0 (3.2) ( ) nϕ ( ) uϕ + where and [ A (0) = ) ϕ, ϕ { A (0) + Z if ε Z, (n) = 0, A () + Z if ε Z, (n) =, u = ε Z,j (n)f l j=2 [ and A () = ) ϕ +, ϕ. Proof. Both properties, (3.) and (3.2), are completely elementary. We just mention that (3.2) is a general property related to the Ostrowsi expansion, compare with [3, Section 3.2]. (For a proof in the present case we refer to [0].) [ ) [ We first note that the intervals µ, µ+ (or µ, ), µ+ϕ respectively) partition the unit interval [0, ) if the digits ε Z,2 (n),..., ε Z, (n) vary over all valid ϕ 2 ϕ 2 ϕ 2 ϕ 2 0--sequences. Similarly the sets ( )uϕ + A (0) mod (or ( )uϕ + A () mod, respectively) partition the unit interval. This implies that the distribution of the Zecendorf Van-der-Corput sequence φ Z (n) can be directly related to the distibution of the sequence nϕ mod. This leads us to a corresponding variant of Lemma 3. Lemma 6. For every integer L we have D N (φ Z (n)) ϕ L + N L δ,
6 6 MICHAEL DRMOTA where δ = sup 0 β< N [β,β+ϕ )(ϕn mod ) N ϕ. Proof. The proof is very close to the proof of Lemma 3. First, for every α (0, ] there exists µ of the form L 3 µ = ε L l ϕ l. l=0 with ε 2,..., ε L {0, } and ε j ε j+ = 0 (that is, there are no consecutive s) such that µϕ L+2 α < (µ+)ϕ L+2 if ε L = 0 or µϕ L+2 α < (µ+ϕ)ϕ L+2 if ε L =. For notational convenience we only tae into account non-zero digits and write L µ = ϕ L 2 lj, j= where L L/2 and l < l 2 < < l L L 2. Now we partition the interval [0, α) into L + intervals of the form [ ) [ 0, ϕ l ϕ, l ϕ + ) L L l ϕ l2 ϕ, L lj ϕ lj ϕ, α lj The first L intervals can be seen as intervals of the form given in (3.). Let I denote one of these intervals. We now apply Lemma 5 and by (3.2) there is another interval J (mod ) of the same length ϕ lj such that N I (φ Z (n)) = N j= j= J (ϕn mod ). Thus the local discrepancy of the sequence φ Z (n) with respect to the interval I can be replaced by the local discrepancy of the sequence ϕn mod with respect to the interval J. And the second one can be estimated by δ lj. Finally the remaining interval can be handled in the same was in the proof of Lemma 3. Summing up this leads to proposed discrepancy bound. We should add that the sets [β, β + ϕ ) are bounded remainder sets for the sequence ϕn mod since ϕ Z + ϕz and we also have δ = O(). This leads to another proof of the upper bound DN(φ Z (n)) log N N. We also want to mention that Lemma 5 extends to subsequences. Suppose that c(n) is a sequence of non-negative integers. Then we have for every integer L where δ = In particular we get D N(φ Z (c(n))) ϕ L + N sup 0 β< L δ, N [β,β+ϕ )(ϕc(n) mod ) N ϕ. D N(φ Z (c(n))) log N D N (ϕc(n)). For example it follows from Lemma 6 that φ Z (p(n)) or φ Z (p n ) is uniformly distributed mod, where p(n) is a non-negative integer valued polynomial and p n is the sequence of primes. j=
7 THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES 7 Finally the method of Lemma 5 can be used to describe the joint distribution of a Halton sequence and the Zecendorf Van-der-Corput sequence. Lemma 7. Suppose that q, q 2,..., q s 2 are pairwise coprime integers and q = (q,..., q s ). Then we have for all integers L, L,..., L s DN(Φ q (n), φ Z (n)) s ϕ L + + δ,,... j= q Lj N s j L L s L s with δ,,..., s = sup 0 β< N/(q qs s ) Proof. Suppose that ε Z, = 0. Then [ ) m (Φ q (n), φ Z (n)), m + q q [β,β+ϕ )(ϕq qs s n mod ) [ m q N ϕ q qs s. ), m [ + µ q ϕ 2, µ + ) ϕ 2 if any only if n contained in a residue class modulo q qs s and ϕn mod is contained in an interval of length ϕ +2. Thus, the number of n < N with this property minus the expected number N/(ϕ q qs s ) is bounded by δ 2,,..., s. (Similarly if ε Z, = then the upper bound is δ,,..., s.) Hence, by using a decomposition of a (d + )-dimensional interval [0, α ) [0, α s ) [0, α) is in the proofs of Lemma 3 and Lemma 6 we immediately obtain the result. 4. Proof of Theorem The proof of Theorem is based on Lemma 7. So we have to estimate δ,,..., s. Clearly we have 2 (N/q) DN/q (ϕqn), δ,,..., s where q = q qs s. It is well nown that the discrepancy of a sequence x n can be estimated by the inequality of Erdős-Turán (see [2, 6]) saying that for every integer H D M (x n ) H + H h= h M M If x n = αn for some irrational number α we have M e 2πihαn hα, e 2πihxn. where x = min Z x denotes the distance to the integers. Consequently we get (for every integer H ) (4.) δ,,..., s N qh + H h= h hqϕ. In order to handle this ind of sums we mae use of Ridout s p-adic version of the Thue-Siegel-Roth theorem [9] which implies the following lemma. Lemma 8. Suppose that q, q 2,..., q s 2 are pairwise coprime integers. Then for every ε > 0 there exists a constant C > 0 such that for all integers,..., s 0 and h q qs s hϕ C h +ε (q qs s ) ε
8 8 MICHAEL DRMOTA Proof. Set q = q qs s and let D denote the set of primes that appear in the prime decomposition of q,..., q s. By Ridoux s theorem for every ε > 0 there exist a constant C > 0 with qhϕ l D for all integers q, h. Since we obtain as proposed. l D qh l qh l l D qhϕ C (qh) +ε q l = q C h +ε q ε Lemma 9. Suppose that q, q 2,..., q s 2 are pairwise coprime integers. Then for every ε > 0 there exists a constant C > 0 such that for all integers,..., s 0 and H H h= h q qs s hϕ C(q qs s H) ε. Proof. Let Q = Q (α) denote the denominators of the convergents P /Q of an irrational number α and suppose that Q < H Q. Then it follows from the approximation that α = P Q + θ Q K Q K+, θ, hα hp <, h Q. Q Q Since P and Q are coprime the numbers hp, h Q, run through all residue classes modulo Q. Thus, the numbers hα, h Q, can be well approximated by l/q with l {0,,..., Q } but with at most three exceptions that are related to l {0,, Q }. αh For these exceptional values we can just say that min hα whereas for the other values we have αh l/q /Q. h H Consequently we obtain H h= hα 3 min hα + h H Q 2 l=2 min h H hα + Q log Q l/q /Q If we apply this procedure for α = qϕ (with q = q qs s ) then we can use the estimate from Lemma 8 to obtain min h H hqϕ H+ε q ε. Furthermore, since Q α /Q we obtain (again from Lemma 8) C Q qϕ Q Q +ε qε H +ε q ε and consequently H hqϕ H+ε q ε + H +ε q ε log(h +ε q ε ) H +2ε q 2ε. h=
9 THE DISCREPANCY OF GENERALIZED VAN-DER-CORPUT-HALTON SEQUENCES 9 Finally by partial summation we obtain H h hqϕ H h= H h= (qh) 2ε. H hqϕ + h 2 h= h l= lqϕ Since ε > 0 is arbitrary we can replace 2ε by ε and we are done. Now it is easy to complete the proof of Theorem. Proof. We use Lemma 7, where we choose L = log ϕ N and L j = log qj N. As above we abbreviate q qs s by q. We distinguish two cases. First suppose that q > N. Then we trivially have δ,,..., s 2. In the other case we set H = N/q and apply (4.) to obtain Summing up this implies δ,,..., s N qh + H + N ε N ε. h= h hqϕ DN(Φ(n)) N + N N ε (log N) s+ N 2ε. Again, since ε > 0 is arbitrary we can replace 2ε by ε which completes the proof of Theorem. Acnowledgements. The author thans Luas Spiegelhofer and Wolfgang Steiner for several intersting discussions on the topic of the paper and Yann Bugeaud for suggesting the use of Ridout s theorem. This research was supported by the Austrian Science Foundation FWF, grant S 5502 that is part of the SFB Quasi-Monte Carlo Methods: Theory and Applications. References [] G. Barat and P. Grabner, Distribution properties of g-additive functions, Journal of Number Theory 60 (996), [2] M. Drmota and R. Tichy, Sequences, Discrepancies and Applications, Lecture Notes in Mathematics 65, Springer, 997. [3] A. Haynes, Equivalence classes of codimension one cut-and-project sets, Ergodic Theory Dyn. Syst., to appear. arxiv: [4] Marus Hofer, Maria Rita Iaco and Robert Tichy, Ergodic properties of β-adic Halton sequences, Ergodic theory and dynamical systems 35 (3), (205), [5] R. Hofer, P. Kritzer, G. Larcher, F. Pillichshammer Distribution properties of generalized van der Corput-Halton sequences and their subsequences. Int. J. Number Theory 4 (5), (2009), [6] Kuipers and H. Niedereiter, Uniform Distribution of Sequences, Wiley, New Yor, 974. [7] M. Minervino and W. Steiner, Tilings for Pisot beta numeration, Indagationes Mathematicae 25 (4) (204), [8] S. Ninomiya, Constructing a new class of low-discrepancy sequences by using the β-adic transformation, Math. Comput. Simulation 47(2), [9] D. Ridout, Rational approximations to algebraic numbers, Mathematia 4 (957), [0] L. Spiegelhofer, Correlations for Numeration Systems, PhD thesis, TU Wien, 204. [] W. Steiner, Parry expansions of polynomial sequences, INTEGERS: The Electronic Journal of Combinatorial Number Theory 2 (2002), A4, 28 pages.
10 0 MICHAEL DRMOTA address: Institut für Disrete Mathemati und Geometrie TU Wien, Wiedner Hauptstr. 8 0, 040 Wien, Austria
DIGITAL 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 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 informationOn the Classification of LS-Sequences
On the Classification of LS-Sequences Christian Weiß arxiv:1706.08949v3 [math.nt] 4 Dec 2017 February 9, 2018 Abstract This paper addresses the question whether the LS-sequences constructed in [Car12]
More informationuniform distribution theory
Uniform Distribution Theory 2 (2007), no.1, 1 10 uniform distribution theory UNIFORM DISTRIBUTION OF SEQUENCES CONNECTED WITH THE WEIGHTED SUM-OF-DIGITS FUNCTION Friedrich Pillichshammer ABSTRACT. In this
More informationUniform distribution of sequences connected with the weighted sum-of-digits function
Uniform distribution of seuences connected with the weighted sum-of-digits function Friedrich Pillichshammer Abstract In this paper we consider seuences which are connected with the so-called weighted
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 informationLS-sequences of points in the unit square
LS-sequences of points in the unit square arxiv:2.294v [math.t] 3 ov 202 Ingrid Carbone, Maria Rita Iacò, Aljoša Volčič Abstract We define a countable family of sequences of points in the unit square:
More informationImproved Discrepancy Bounds for Hybrid Sequences. Harald Niederreiter. RICAM Linz and University of Salzburg
Improved Discrepancy Bounds for Hybrid Sequences Harald Niederreiter RICAM Linz and University of Salzburg MC vs. QMC methods Hybrid sequences The basic sequences Deterministic discrepancy bounds The proof
More informationA NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1)-SEQUENCES. Peter Kritzer 1. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(3 (2005, #A11 A NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1-SEQUENCES Peter Kritzer 1 Department of Mathematics, University of Salzburg,
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationOn the inverse of the discrepancy for infinite dimensional infinite sequences
On the inverse of the discrepancy for infinite dimensional infinite sequences Christoph Aistleitner Abstract In 2001 Heinrich, ovak, Wasilkowski and Woźniakowski proved the upper bound s,ε) c abs sε 2
More informationA LeVeque-type lower bound for discrepancy
reprinted from Monte Carlo and Quasi-Monte Carlo Methods 998, H. Niederreiter and J. Spanier, eds., Springer-Verlag, 000, pp. 448-458. A LeVeque-type lower bound for discrepancy Francis Edward Su Department
More informationUniformly distributed sequences of partitions
Uniformly distributed sequences of partitions Aljoša Volčič Università della Calabria Uniform distribution and QMC methods A. Volčič (Università della Calabria) U.d. sequences of partitions Linz, October
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 informationON THE CLASSIFICATION OF LS-SEQUENCES
uniform distribution theory DOI: 10.2478/udt-2018 0012 Unif. Distrib. Theory 13 2018, no.2, 83 92 ON THE CLASSIFICATION OF LS-SEQUENCES Christian Weiß Hochschule Ruhr West, Mülheim an der Ruhr, GERMANY
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 informationLow-discrepancy sequences obtained from algebraic function fields over finite fields
ACTA ARITHMETICA LXXII.3 (1995) Low-discrepancy sequences obtained from algebraic function fields over finite fields by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. We present
More informationL 2 Discrepancy of Two-Dimensional Digitally Shifted Hammersley Point Sets in Base b
L Discrepancy of Two-Dimensional Digitally Shifted Hammersley Point Sets in Base Henri Faure and Friedrich Pillichshammer Astract We give an exact formula for the L discrepancy of two-dimensional digitally
More informationON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS
Fizikos ir matematikos fakulteto Seminaro darbai, Šiaulių universitetas, 8, 2005, 5 13 ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS Boris ADAMCZEWSKI 1, Yann BUGEAUD 2 1 CNRS, Institut Camille Jordan,
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationRational numbers with purely periodic beta-expansion. Boris Adamczeswki, C. Frougny, A. Siegel, W.Steiner
Rational numbers with purely periodic beta-expansion Boris Adamczeswki, C. Frougny, A. Siegel, W.Steiner Fractals, Tilings, and Things? Fractals, Tilings, and Things? Number theory : expansions in several
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 informationConstruction algorithms for plane nets in base b
Construction algorithms for plane nets in base b Gunther Leobacher, Friedrich Pillichshammer and Thomas Schell arxiv:1506.03201v1 [math.nt] 10 Jun 2015 Abstract The class of (0, m, s)-nets in base b has
More informationDiscrepancy Bounds for Nets and Sequences
Discrepancy Bounds for Nets and Sequences Peter Kritzer Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences Linz, Austria Joint work with Henri Faure (Marseille)
More informationThe Halton sequence and its discrepancy in the Cantor expansion
Period Math Hung 2017 75:128 141 DOI 10.1007/s10998-016-0169-5 The Halton sequence and its discrepancy in the Cantor expansion Alena Haddley 1 Poj Lertchoosakul 2 Radhakrishnan air 1 Published online:
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationarxiv: v2 [math.nt] 27 Mar 2018
arxiv:1710.09313v [math.nt] 7 Mar 018 The Champernowne constant is not Poissonian Ísabel Pirsic, Wolfgang Stockinger Abstract We say that a sequence (x n n N in [0,1 has Poissonian pair correlations if
More informationErgodic aspects of modern dynamics. Prime numbers in two bases
Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373
More informationPolynomial functions on subsets of non-commutative rings a link between ringsets and null-ideal sets
Polynomial functions on subsets of non-commutative rings a lin between ringsets and null-ideal sets Sophie Frisch 1, 1 Institut für Analysis und Zahlentheorie, Technische Universität Graz, Koperniusgasse
More informationLow-discrepancy constructions in the triangle
Low-discrepancy constructions in the triangle Department of Statistics Stanford University Joint work with Art B. Owen. ICERM 29th October 2014 Overview Introduction 1 Introduction The Problem Motivation
More informationAdditive irreducibles in α-expansions
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
More informationSOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY
Annales Univ. Sci. Budapest., Sect. Comp. 43 204 253 265 SOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY Imre Kátai and Bui Minh Phong Budapest, Hungary Le Manh Thanh Hue, Vietnam Communicated
More informationOn the existence of higher order polynomial. lattices with large figure of merit ϱ α.
On the existence of higher order polynomial lattices with large figure of merit Josef Dick a, Peter Kritzer b, Friedrich Pillichshammer c, Wolfgang Ch. Schmid b, a School of Mathematics, University of
More informationOn the discrepancy of circular sequences of reals
On the discrepancy of circular sequences of reals Fan Chung Ron Graham Abstract In this paper we study a refined measure of the discrepancy of sequences of real numbers in [0, ] on a circle C of circumference.
More informationApproximation exponents for algebraic functions in positive characteristic
ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions
More informationuniform distribution theory
Uniform Distribution Theory 6 (2011), no.1, 185 200 uniform distribution theory CONSTRUCTIONS OF UNIFORMLY DISTRIBUTED SEQUENCES USING THE b-adic METHOD Peter Hellekalek Harald Niederreiter ABSTRACT. For
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 informationOn the N th linear complexity of p-automatic sequences over F p
On the N th linear complexity of p-automatic sequences over F p László Mérai and Arne Winterhof Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstr.
More informationA NOTE ON NORMAL NUMBERS IN MATRIX NUMBER SYSTEMS
A NOTE ON NORMAL NUMBERS IN MATRIX NUMBER SYSTEMS MANFRED G. MADRITSCH Abstract. We consider a generalization of normal numbers to matrix number systems. In particular we show that the analogue of the
More informationA MATRIX GENERALIZATION OF A THEOREM OF FINE
A MATRIX GENERALIZATION OF A THEOREM OF FINE ERIC ROWLAND To Jeff Shallit on his 60th birthday! Abstract. In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients ( n, for m
More informationUPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE
uniform distribution theory DOI: 055/udt-207 002 Unif Distrib Theory 2 207), no2, 24 UPPER BOUNDS FOR DOUBLE EXPONENTIAL SUMS ALONG A SUBSEQUENCE Christopher J White ABSTRACT We consider a class of double
More informationNew methods for constructing normal numbers
New methods for constructing normal numbers Jean-Marie De Koninck and Imre Kátai Given an integer q 2, a q-normal number is an irrational number whose q-ary expansion is such that any preassigned sequence,
More informationTutorial on quasi-monte Carlo methods
Tutorial on quasi-monte Carlo methods Josef Dick School of Mathematics and Statistics, UNSW, Sydney, Australia josef.dick@unsw.edu.au Comparison: MCMC, MC, QMC Roughly speaking: Markov chain Monte Carlo
More informationThe Mysterious World of Normal Numbers
University of Alberta May 3rd, 2012 1 2 3 4 5 6 7 Given an integer q 2, a q-normal number is an irrational number whose q-ary expansion is such that any preassigned sequence, of length k 1, of base q digits
More informationarxiv: v1 [math.nt] 23 Jan 2019
SOME NEW q-congruences FOR TRUNCATED BASIC HYPERGEOMETRIC SERIES arxiv:1901.07962v1 [math.nt] 23 Jan 2019 VICTOR J. W. GUO AND MICHAEL J. SCHLOSSER Abstract. We provide several new q-congruences for truncated
More informationOn the Largest Integer that is not a Sum of Distinct Positive nth Powers
On the Largest Integer that is not a Sum of Distinct Positive nth Powers arxiv:1610.02439v4 [math.nt] 9 Jul 2017 Doyon Kim Department of Mathematics and Statistics Auburn University Auburn, AL 36849 USA
More informationf(x n ) [0,1[ s f(x) dx.
ACTA ARITHMETICA LXXX.2 (1997) Dyadic diaphony by Peter Hellekalek and Hannes Leeb (Salzburg) 1. Introduction. Diaphony (see Zinterhof [13] and Kuipers and Niederreiter [6, Exercise 5.27, p. 162]) is a
More informationOn the discrepancy estimate of normal numbers
ACTA ARITHMETICA LXXXVIII.2 (1999 On the discrepancy estimate of normal numbers 1. Introduction by M. B. Levin (Tel-Aviv Dedicated to Professor N. M. Korobov on the occasion of his 80th birthday 1.1. A
More informationA CONSTRUCTION FOR ABSOLUTE VALUES IN POLYNOMIAL RINGS. than define a second approximation V 0
A CONSTRUCTION FOR ABSOLUTE VALUES IN POLYNOMIAL RINGS by SAUNDERS MacLANE 1. Introduction. An absolute value of a ring is a function b which has some of the formal properties of the ordinary absolute
More informationON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS. Yann Bugeaud Université de Strasbourg, France
GLASNIK MATEMATIČKI Vol. 44(64)(2009), 323 331 ON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS Yann Bugeaud Université de Strasbourg, France Abstract. Let n be a positive integer. Let ξ
More informationTHE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS
THE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS DIEGO MARQUES Abstract. Let F n be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest
More informationAUTOMATIC SEQUENCES GENERATED BY SYNCHRONIZING AUTOMATA FULFILL THE SARNAK CONJECTURE
AUTOMATIC SEQUENCES GENERATED BY SYNCHRONIZING AUTOMATA FULFILL THE SARNAK CONJECTURE JEAN-MARC DESHOUILLERS, MICHAEL DRMOTA, AND CLEMENS MÜLLNER Abstract. We prove that automatic sequences generated by
More information1 Adeles over Q. 1.1 Absolute values
1 Adeles over Q 1.1 Absolute values Definition 1.1.1 (Absolute value) An absolute value on a field F is a nonnegative real valued function on F which satisfies the conditions: (i) x = 0 if and only if
More informationOn the β-expansion of an algebraic number in an algebraic base β. (Strasbourg)
On the β-expansion of an algebraic number in an algebraic base β Yann BUGEAUD (Strasbourg) Abstract. Let α in (0, 1] and β > 1 be algebraic numbers. We study the asymptotic behaviour of the function that
More informationarxiv: v1 [math.co] 8 Feb 2013
ormal numbers and normality measure Christoph Aistleitner arxiv:302.99v [math.co] 8 Feb 203 Abstract The normality measure has been introduced by Mauduit and Sárközy in order to describe the pseudorandomness
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 informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
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 informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationOn rational numbers associated with arithmetic functions evaluated at factorials
On rational numbers associated with arithmetic functions evaluated at factorials Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive
More informationOn the concrete complexity of the successor function
On the concrete complexity of the successor function M. Rigo joint work with V. Berthé, Ch. Frougny, J. Sakarovitch http://www.discmath.ulg.ac.be/ http://orbi.ulg.ac.be/handle/2268/30094 Let s start with
More informationContinued Fractions New and Old Results
Continued Fractions New and Old Results Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit Joint
More informationA Smorgasbord of Applications of Fourier Analysis to Number Theory
A Smorgasbord of Applications of Fourier Analysis to Number Theory by Daniel Baczkowski Uniform Distribution modulo Definition. Let {x} denote the fractional part of a real number x. A sequence (u n R
More informationON THE REPRESENTATION OF FIBONACCI AND LUCAS NUMBERS IN AN INTEGER BASES
ON THE REPRESENTATION OF FIBONACCI AND LUCAS NUMBERS IN AN INTEGER BASES YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE À Paulo Ribenboim, pour son quatre-vingtième anniversaire Abstract. Résumé. Nous
More informationTomáš Madaras Congruence classes
Congruence classes For given integer m 2, the congruence relation modulo m at the set Z is the equivalence relation, thus, it provides a corresponding partition of Z into mutually disjoint sets. Definition
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 informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
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 informationSome Congruences for the Partial Bell Polynomials
3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics
More information#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT
#A5 INTEGERS 8A (208) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT Yann Bugeaud IRMA, UMR 750, Université de Strasbourg et CNRS, Strasbourg, France bugeaud@math.unistra.fr
More informationOn Normal Numbers. Theodore A. Slaman. University of California Berkeley
1/24 On Normal Numbers Theodore A. Slaman University of California Berkeley Joint work with Verónica Becher, and in part with Pablo Heiber, Yann Bugeaud and Jan Reimann CApril 29, 2015 2/24 Émile Borel
More informationLes chiffres des nombres premiers. (Digits of prime numbers)
Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet
More informationON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul...,..., f... DOI: 10.2478/aicu-2013-0013 ON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS BY MARIUS TĂRNĂUCEANU and
More informationDEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results
DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS George E. Andrews and Ken Ono February 7, 2000.. Introduction and Statement of Results Dedekind s eta function ηz, defined by the infinite product ηz
More informationA Number Theorist s Perspective on Dynamical Systems
A Number Theorist s Perspective on Dynamical Systems Joseph H. Silverman Brown University Frontier Lectures Texas A&M, Monday, April 4 7, 2005 Rational Functions and Dynamical Systems
More informationUnique Expansions of Real Numbers
ESI The Erwin Schrödinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria Unique Expansions of Real Numbers Martijn de Vries Vilmos Komornik Vienna, Preprint ESI
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationOn the maximal density of sum-free sets
ACTA ARITHMETICA XCV.3 (2000) On the maximal density of sum-free sets by Tomasz Luczak (Poznań) and Tomasz Schoen (Kiel and Poznań) 1. Introduction. For a set A N, let A(n) = A {1,..., n} and { } P(A)
More informationarxiv: v2 [math.co] 20 Jun 2018
ON ORDERED RAMSEY NUMBERS OF BOUNDED-DEGREE GRAPHS MARTIN BALKO, VÍT JELÍNEK, AND PAVEL VALTR arxiv:1606.0568v [math.co] 0 Jun 018 Abstract. An ordered graph is a pair G = G, ) where G is a graph and is
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
More informationAUTOMATIC SOLUTION OF FAMILIES OF THUE EQUATIONS AND AN EXAMPLE OF DEGREE 8
To appear in Journal of Symbolic Computation AUTOMATIC SOLUTION OF FAMILIES OF THUE EQUATIONS AND AN EXAMPLE OF DEGREE 8 CLEMENS HEUBERGER, ALAIN TOGBÉ, AND VOLKER ZIEGLER Abstract We describe a procedure
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 informationWEYL SUMS OVER INTEGERS WITH LINEAR DIGIT RESTRICTIONS. 1. Introduction. ε j (n)q j. n =
WEYL SUMS OVER INTEGERS WITH LINEAR DIGIT RESTRICTIONS MICHAEL DRMOTA AND CHRISTIAN MAUDUIT Abstract For any given integer q 2, we consider sets N of non-negative integers that are defined by linear relations
More informationDISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k
DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F
More informationOn the digits of prime numbers
On the digits of prime numbers Joël RIVAT Institut de Mathématiques de Luminy, Université d Aix-Marseille, France. rivat@iml.univ-mrs.fr work in collaboration with Christian MAUDUIT (Marseille) 1 p is
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More informationOn the Fractional Parts of a n /n
On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev
More informationSTRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS
#A INTEGERS 6 (206) STRONG NORMALITY AND GENERALIZED COPELAND ERDŐS NUMBERS Elliot Catt School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, New South Wales, Australia
More informationApproximation of High-Dimensional Rank One Tensors
Approximation of High-Dimensional Rank One Tensors Markus Bachmayr, Wolfgang Dahmen, Ronald DeVore, and Lars Grasedyck March 14, 2013 Abstract Many real world problems are high-dimensional in that their
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 informationOn the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves
On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves Simon R. Blacburn Department of Mathematics Royal Holloway University of London Egham, Surrey, TW20 0EX, UK s.blacburn@rhul.ac.u
More informationThe van der Corput embedding of ax + b and its interval exchange map approximation
The van der Corput embedding of ax + b and its interval exchange map approximation Yuihiro HASHIMOTO Department of Mathematics Education Aichi University of Education Kariya 448-854 Japan Introduction
More informationRandom and Quasi-Random Point Sets
Peter Hellekalek Gerhard Larcher (Editors) Random and Quasi-Random Point Sets With contributions by JözsefBeck Peter Hellekalek Fred J. Hickemell Gerhard Larcher Pierre L'Ecuyer Harald Niederreiter Shu
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
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 informationON HOFSTADTER S MARRIED FUNCTIONS
THOMAS STOLL Abstract. In this note we show that Hofstadter s married functions generated by the intertwined system of recurrences a(0) = 1, b(0) = 0, b(n) = n a(b(n 1)), a(n) = n b(a(n 1)) has the solutions
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationCongruences for algebraic sequences
Congruences for algebraic sequences Eric Rowland 1 Reem Yassawi 2 1 Université du Québec à Montréal 2 Trent University 2013 September 27 Eric Rowland (UQAM) Congruences for algebraic sequences 2013 September
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More information