A good permutation for one-dimensional diaphony
|
|
- Hector Gordon
- 6 years ago
- Views:
Transcription
1 Monte Carlo Methods Appl. 16 (2010), DOI /MCMA de Gruyter 2010 A good permutation for one-dimensional diaphony Florian Pausinger and Wolfgang Ch. Schmid Astract. In this article we focus on two aspects of one-dimensional diaphony F.S ;N/ of generalised van der Corput sequences in aritrary ases. First we give a permutation with the est distriution ehaviour concerning the diaphony known so far. We improve a result of Chaix and Faure from 1993 from a value of 1:31574 : : : for a permutation in ase 19 to 1:13794 : : : for our permutation in ase 57. Moreover for an infinite sequence X and its symmetric version e X, we analyse the connection etween the diaphony F.X;N/ and the L 2 -discrepancy L 2.e X;N/ using another result of Chaix and Faure. Therefore we state an idea how to get a lower ound for the diaphony of generalised van der Corput sequences in aritrary ase. Keywords. Diaphony, generalised van der Corput sequence Mathematics Suject Classification. 11K06, 11K38. 1 Introduction In the field of quasi-monte Carlo methods various notions of discrepancy occur in the evaluation of the distriution ehaviour of infinite sequences. The term low discrepancy sequence is used for sequences showing a particularly good distriution ehaviour. An example for a low discrepancy sequence is the (one-dimensional) generalised van der Corput sequence whose ehaviour and properties were studied in great detail y Henri Faure in many different papers. In this paper we consider two different types of discrepancy, namely the (classical) diaphony as introduced y Zinterhof [6] and the L 2 -discrepancy of generalised van der Corput sequences. Main motivation is the fact that in the last 15 years computer systems have ecome much faster. Together with changed and improved algorithms we are ale to provide permutations that eat the est known values for one-dimensional diaphony significantly. Moreover these new results let us also investigate the connection etween the diaphony and the L 2 -discrepancy of generalised van der Corput sequences numerically. This work is supported y the Austrian Science Foundation (FWF), Project S9609, that is part of the Austrian National Research Network Analytic Cominatorics and Proailistic Numer Theory.
2 308 F. Pausinger and W. Ch. Schmid 2 Definitions and notations Let X D.x i / i1 e an infinite sequence in the half open unit interval Œ0; 1Œ. For N 1 and for reals 0 <ˇ 1 let A.Œ ; ˇŒ; N; X/ denote the numer of indices i N for which x i 2 Œ ; ˇŒ. The discrepancy function of X is defined as E.Œ ; ˇŒ; N; X/ D A.Œ ; ˇŒ; N; X/.ˇ /N. Definition 2.1. For any one-dimensional, infinite sequence X the L 2 -discrepancy of the first N points of X is defined y Z 1 1 L 2.N; X/ WD je.œ0; Œ;N;X/j 2 2 d : 0 Definition 2.2. For any one-dimensional, infinite sequence X the diaphony F of the first N points of X is defined y F.N;X/ WD 2 1X m 2 md1 1 NX ˇ nd1 exp 2imx n 1 2 ˇ Remark 2.3. Note that there is an equivalent definition for the diaphony (details in [5]): For any one-dimensional, infinite sequence X the diaphony F of the first N points of X is defined y Z 1 Z 1 1 F.N;X/ WD 2 2 je.œ ; ˇŒ; N; X/j 2 2 d dˇ : 0 0 Note that with this second definition it is easy to see that L 2 -discrepancy and diaphony are linked in a way similar to the relation of star discrepancy and extreme discrepancy. We call a one-dimensional sequence X a low discrepancy sequence if there exists a constant c such that for all N As a consequence computing F 2.N; X/ c log N: f.x/wd lim sup.f 2.N; X/= log N/ N!1 enales us to look for sequences with est distriution ehaviour. 2 :
3 A good permutation for one-dimensional diaphony 309 Throughout the paper let 2 and n 1 e integers. Let S e the set of all permutations of ¹0;1;:::; 1º. The identity in S is always denoted y id. In all examples and concrete results we will write down the permutations in the following way: For D we will write D.0;4;2;6;1;5;3;7/. Definition 2.4. For a fixed ase 2 and a permutation 2 S the generalised van der Corput sequence S is defined y 1 S.n/ D X.a j.n// j 1 ; j D0 where P 1 j D0 a j.n/ j is the -adic representation of an integer n 0. The analysis of the diaphony of S is ased on special functions which have een first introduced y Faure in [1] and which are defined as follows: Definition 2.5. For 2 S let Z D..0/=;.1/=; : : : ;. 1/=/. For h 2¹0;1;:::; 1º and x 2 Œ k 1 ; k Œ where k 2¹1;:::;º we define ² A.Œ0; h=œi ki Z ' ;h.x/ WD / hx if 0 h.k 1/;. h/x A.Œh=; 1ŒI ki Z / if.k 1/ < h < : The function ' is extended to the reals y periodicity. ;h Note that ' ;0 D 0 for any and that ' ;h.0/ D 0 for any 2 S and any h 2¹0;:::; 1º. Furthermore: Definition 2.6. Let ' ;.r/ 1 X WD hd0.' ;h /r where for r D 1 we omit the superscript, i.e., ' WD ';.1/. Chaix and Faure introduced in [4] a new class of functions ased on ' ;.r/ : Definition 2.7. WD ';.2/.' /2 :
4 310 F. Pausinger and W. Ch. Schmid Proposition 2.8 (Propriété 3:3 in [4]). The following holds: The function ' is continuous, piecewise linear on the intervals Œk=;.k C 1/= and '.0/ D '.1/. ;.2/ The functions ' and are continuous, piecewise quadratic on the intervals Œk=;.k C 1/= and ' ;.2/.0/ D ' ;.2/.1/. For our investigations the following is of great importance: Proposition 2.9 (Propriété 3:5 in [4]). For each interval Œk=;.k C 1/= the paraolic arcs of are translated versions of the paraola y D /x 2 =12. Remark Therefore if we consider two intervals of the form I i WD Œk i =;.k i C 1/=, 0 k i <, i 2¹1; 2º, with.k 1=/ D.k 2=/ and..k 1 C 1/=/ <..k 2 C 1/=/ then it follows immediately that min.i 1/ < min.i 2/. The starting point for our work are two theorems that show that the diaphony of S can e computed exactly. The first theorem states how to compute the diaphony of the first N points of S, while the second theorem estalishes a method for computing the constant which allows us to classify different permutations in aritrary ase. Theorem 2.11 (Theorem 4:2 in [4]). For all N 1, we have F 2.N; S / D X 1 42.N j /= 2 : j D1 Theorem 2.12 (Theorem 4:10 in [4]). Let WD inf sup n1 x2œ0;1 nx j D1.xj /=n ; then f.s / D lim sup.f 2.N; S /= log N/ D 42 =.2 log /: N!1
5 A good permutation for one-dimensional diaphony A good permutation In order to improve the est known result for diaphony otained y Chaix and Faure in [4] in ase 19, we will give a permutation in ase 57 and examine its dominant intervals. According to Theorem 2.12 it is necessary to compute. Therefore we introduce so called supporting functions gn ; W Œ0; 1! R, with g ; n.x/ WD 1 n 1 X n.xj /: Following [1] and [4] we examine intervals I n h WD Œh=n ;.hc 1/= n, with h 2 0;:::; n 1. Definition 3.1. The interval I n is called dominated, if there exists a set J of integers with h J such that gn ;.x/ max j 2J gn ;..x C.j h//= n /, for all h x 2 I n. Otherwise the interval is called dominant. h j D Figure 1. Dominant intervals (gray) of a -function in ase 10. Our algorithms enaled us to find many permutations with exceptionally good distriution ehaviour. The est ones we otained so far are in ase 57, where for the following we were ale to prove an exact value. Theorem 3.2. For WD 57 D (0, 24, 37, 8, 43, 18, 52, 29, 11, 48, 33, 4, 21, 40, 14, 54, 26, 45, 6, 35, 16, 50, 31, 2, 20, 39, 10, 47, 27, 55, 13, 42, 23, 3, 32, 51, 17, 36, 7, 46, 28, 56, 15, 41, 22, 5, 34, 49, 9, 25, 53, 38, 12, 30, 1, 19, 44) we have f.s57 / D log 57/ D 1:13794 : : : :
6 312 F. Pausinger and W. Ch. Schmid To simplify the proof we first show the following result for the supporting functions of our permutation 57 : Lemma 3.3. For all n 2 the functions g n WD gn 57; have two dominant intervals I n and I n, with k n k1 n k2 n 1 D 26 57n 1 C P n 2 id0 5 57i and k2 n D 26 57n 1 C 6 C P n 2 id1 5 57i.Forn D 2, max x2œ0;1 g 2.x/ D g C7 / and for n 3, 57 2 max x2œ0;1 g n.x/ D g n.k1 n=57n /. Proof. Numerical investigations show that there are two dominant intervals I25 1 and I26 1 for n D 1. This can e verified easily with Remark 2:10 and Tale 1. k k 57 / k k 57 / k k 57 / k k 57 / k k 57 / k k 57 / Tale 1. Values of 57. For n D 2 we get again two dominant intervals I and I and max x2œ0; g 2.x/ D g D 811:8481 : : : : For n D 3 we get the two dominant intervals I and I and max x2œ0; g 3.x/ D g D 1190:1108 : : : : Further numerical investigations allow us to make the following induction hypothesis: For n 3 the indices k1 n and kn 2 of the dominant intervals I n and I n k1 n k2 n
7 A good permutation for one-dimensional diaphony 313 of g n are and n 2 k1 n D 26 X 57n 1 C 5 57 i id0 n 2 k2 n D 26 X 57n 1 C 6 C 5 57 i : For the induction step let us suppose that our induction hypothesis holds for an aritrary n 3. To prove that it holds for n C 1 we have to add 57.xn / to g n on I n and I k1 n n and check that g k2 n nc1 has I nc1 and I nc1 again as dominant intervals. We verified this for all suintervals of I n and found that those k nc1 1 k nc1 2 k n two intervals are again dominant. Moreover the same numerical investigations show that the maximum of g nc1 is at position p nc1 D n C P 57 nc1 n 1 id0 5 57i /. id1 added in dominant intervals Figure 2. To determine max g nc1 it suffices to add the initial function only in the dominant intervals of g n. Proof of Theorem 3.2. According to Lemma 3:3 the position of the maximum of g n is p n D n 1 C P n 2 n id0 557i /. Due to its definition g n is the sum of n values of the -function divided y n. Therefore we can compute the maximum of the n-th approximation step y simply evaluating the -function at those positions. For interval I5 1 we have.x/ D x x C 8636, fori26 1 we have.x/ D x x C Letf.i;n/WD P n j Di 5 57 j C1 i.
8 314 F. Pausinger and W. Ch. Schmid Consequently n 1 X n g n.p n / D p n / 2 C.f.i; n 1// p n Easy calculation gives For n!1we get and therefore n 1 j D1 X f.i;n 1/ C C.n 1/ 8636: j D1 g n.p n / D C n n n n 112n 12544n C n 19 1 n 56n C n 19 3 n 3136n n 19 2 n 392n C n : lim g n.p n / D n!1 57 D ; f.s 57 / D log 57/ D 1:13794 : : : : 4 A lower ound and some estimations An infinite sequence Y D.y n / n1 is called symmetric, if for all n y 2n C y 2nC1 D 1 holds. A symmetric sequence Y is said to e created y the sequence X D.x n / n1, if for all n y 2n D x n or y 2nC1 D x n holds. We will denote this y Y WD ex. Due to Theorem 4.11 in [4] the L 2 -discrepancy of S f can e ounded y the diaphony of S as follows: l 2. f S / WD lim sup N!1.L2.N; S f //2 log N f.s / 2 :
9 A good permutation for one-dimensional diaphony 315 In [2] Faure proved that 0:089 l 2. f S id 2 / 0:103; which is the est value for the L 2 -discrepancy currently known. With our new est value for the diaphony it is interesting to investigate this connection once again. We tried to improve the value of the L 2 -discrepancy y finding a permutation for the diaphony that is good enough to eat the ound of Faure. It turned out that it is not possile (at least in small ases) to improve the value y simply applying the aove mentioned inequality. To outline our approach let us first recall the asic facts and the according remark aout -functions, which were mentioned in the introduction of this paper. Assuming we have already found a permutation in ase and know that max D s, we now want to estimate (see Theorem 2.12). So we construct a function D ;s only depending on the ase and on s. First we define on the interval Œx; y WD Œ 1 2 c; 1. 2cC1/, y.x/ D.y/ WD s and y.z/ WD Az 2 C Bz C C for z 2 Œx; y. LetA D / 12,thenB and C can e computed y simply solving the linear system.x/ D s;.y/ D s: We have now constructed a fictive dominant interval for and can introduce new functions eg n D eg n.; s/ similar to the already defined functions g n to get a lower ound for. In detail: eg n WD 1 n.z 1 / C nx j D2 z j 1 C 1 j k j ; 2 with n 2 N, z 1 WD x and for j>1, z j WD z j 1 C 1 j 2c. The fact that we always add the maximum of in the middle (D the minimum) of the fictive dominant interval gives us a lower ound for if the real function contains a dominant interval of the form Œk 1 ;k 2 with.k 1/ D.k 2/ D max. This lower ound turned out to e sufficient for all practical investigations, also if the dominant interval of is not of the aove assumed form. However for theoretical correctness we assume now that the real set of dominant intervals D contains at least one interval I with a ound whose value is smaller than max, which means that max I 2D min.i / < min.œx; y /. This implies that it is theoretically possile to find a function for which is smaller than the value of our lower ound. To e ale to guarantee that this will not happen we can compute an interval J D J l [ J r, which has to contain max. To get the ounds
10 316 F. Pausinger and W. Ch. Schmid of J l and J r we set m WD A.x C x /2 C B.x C x / C C and solve the equation m D Az 2 C B I z C C I ; (4.1) for z (see Figure 3), where B I, C I denote the coefficients of in the interval I that contains max I 2D min.i /. It means if the real maximum is added left of z 1 or right of z 2 in the real dominant interval, then the resulting value has to e greater than the value in the fictive dominant interval. This information is now transformed to fit the initial -function which is added (review Figure 2). As a result we get J as follows: h J D 0; x 1 l x C 1 2 z 1 2mi h [ y C 1 l x C 1 2 z 2 2m i ;1 ; where z 1, z 2 are the solution of equation (4.1) with z 1 <z 2. s s z1 m z2 => J1 => J2 Figure 3. Main idea of the lower ound. We can now formulate the following criterion: Lemma 4.1. Let a ase and a permutation e given and let max s. Then lim n!1 eg n.; s/ holds if there exists an interval Œk=;.k C 1/= with. k / D. kc1 / D s (it is sufficient that oth values are s) or if there exists an x 2 argmax with x 2 J. Remark 4.2. In practice it is possile that the requirements for the lemma are not fulfilled in some cases. However we did not find any permutation for which this lower ound did not hold. It turns out that the -functions of those permutations, that do not fulfill the requirements, usually have one value.z/ with z 2 J which is only a little it smaller than the maximum of, so that the lower ound still holds.
11 A good permutation for one-dimensional diaphony 317 Using various acktracking search strategies we were ale to determine lowest possile values for max D s in the ases 4 to 50. Furthermore we have good (ut due to computational complexity not necessarily optimal) values for ases 51 to s ase Figure 4. Smallest possile values for s D max. Remark 4.3. The functions eg n.; s/, which do not depend on a specific permutation, help investigating the connection etween the L 2 -discrepancy and the diaphony of S f respectively S (see Tales 2 4). According to these values it is not possile to otain a new est value for the L 2 -discrepancy in ases <51and it seems not possile for <73. Moreover it seems that the est values of for any ase <73are on a fairly constant level which lead us to the conclusion that it is not possile to improve the value of Faure for the L 2 -discrepancy stated in [2] via the diaphony for any small ase. Remark 4.4. The functions eg n.; s/ in comination with the position of the maximum of a specific function support our computational search for new est values for the diaphony of S f. It is a tedious and time consuming work to determine all dominant intervals for a specific function and to compute.as a simple heuristic rule for picking good candidates we state that the smaller the values of are near the ounds of the interval Œ0; 1 the smaller usually is. Remark 4.5. We can, of course, provide large files containing permutations for ases <73for which max D s holds.
12 318 F. Pausinger and W. Ch. Schmid s eg 1.; s/ f.eg 1.; s/; /.f.eg 1.; s/; //= 2 4 1:25 0: : : =2 1: : =3 89=30 1: : : : =7 1:6951 0: =3 1: : :25 8: : : =2 1: : =22 1: : =2 1: : :25 18:2115 1: : =3 20 1: : :25 21:9611 1: : : : =17 1: : =2 1: : :25 38:9605 1: : =3 87=2 1: : :25 46:2103 1: : : : =23 1: : : : =25 1: : Tale 2. Best values for s for 26 and the according estimations.
13 A good permutation for one-dimensional diaphony 319 s eg 1.; s/ f.eg 1.; s/; /.f.eg 1.; s/; //= =3 147=2 1: : =162 1: : =2 1: : =58 1:1903 0: : : =31 1: : = : : :25 122:21 1: : =2 1: : =70 1: : =2 1: : =74 1: : = : : :25 171:959 1: : : : = =123 1: : =2 1: : = =172 1: : =6 1: : =270 1: : : : = =141 1: : : : =49 1: : Tale 3. Best values for s for and the according estimations.
14 320 F. Pausinger and W. Ch. Schmid s eg 1.; s / f.eg 1.; s /; /.f.eg 1.; s /; //= =6 1: : =306 1: : =2 1: : = =318 1: : : : = =220 1: : = : : =171 1:1184 0: =2 1: : =118 1: : =2 1:1059 0: = =244 1: : = : : = =756 1: : : : = =260 1: : =2 1:1054 0: =134 1: : =3 1115=2 1:0918 0: =414 1: : : : = =213 1: : Tale 4. So far est (ut improvale) values for s for and the according estimations.
15 A good permutation for one-dimensional diaphony Conclusion In the first part of our work we present a permutation in ase 57 that generates a generalised van der Corput sequence with exceptionally good distriution ehaviour with respect to the diaphony. Since it is a very tedious work to determine the exact asymptotic distriution ehaviour of a sequence generated y a given permutation, the second part of our paper states a method how this computations can e approximated respectively simplified. The so computed lower ounds are then used to examine an inequality stated y Faure. We find that this inequality that links the diaphony of generalised van der Corput sequences with the L 2 - discrepancy of its symmetric version can not e used to improve the est known numerical results for the L 2 -discrepancy of these sequences. In a forthcoming work we will try to find algorithms for constructing good permutations like Faure did in [3]. Moreover we will use a different approach to get a lower ound for any generalised van der Corput sequence in aritrary ase as well as to determine and count classes of permutations that show similar distriution ehaviour with respect to the diaphony. Acknowledgments. We would like to thank Henri Faure for his valuale comments and suggestions. Biliography [1] H. Faure: Discrépance de suites associées à un système de numération (en dimension un). Bull. Soc. Math. France 109 (1981), [2] H. Faure: Discrépance quadratique de la suite de van der Corput et de sa symètrique. Acta Arith. 55 (1990), [3] H. Faure: Good Permutations for Extreme Discrepancy. Journal of Numer Theory 42 (1992), [4] H. Chaix and H. Faure: Discrépance et diaphonie en dimension un. Acta Arith. 63 (1993), [5] H. Faure: Discrepancy and diaphony of digital.0; 1/-sequences in prime ase. Acta Arith. 117 (2005), [6] P. Zinterhof: Üer einige Aschätzungen ei der Approximation von Funktionen mit Gleichverteilungsmethoden. Österreich. Akad. Wiss. Math.-Naturwiss. Kl. S.-B. II 185 (1976),
16 322 F. Pausinger and W. Ch. Schmid Received Decemer 1, 2009; revised Septemer 22, Author information Florian Pausinger, Fachereich Mathematik, Universität Salzurg, Hellrunner Straße 34, A-5020 Salzurg, Austria. Wolfgang Ch. Schmid, Fachereich Mathematik, Universität Salzurg, Hellrunner Straße 34, A-5020 Salzurg, Austria.
L 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 informationStar discrepancy of generalized two-dimensional Hammersley point sets
Star discrepancy of generalized two-dimensional Hammersley point sets Henri Faure Astract We generalize to aritrary ases recent results on the star discrepancy of digitally shifted two-dimensional Hammersley
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 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 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 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 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 informationPolynomials Characterizing Hyper b-ary Representations
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.4.3 Polynomials Characterizing Hyper -ary Representations Karl Dilcher 1 Department of Mathematics and Statistics Dalhousie University
More informationA proof of a partition conjecture of Bateman and Erdős
proof of a partition conjecture of Bateman and Erdős Jason P. Bell Department of Mathematics University of California, San Diego La Jolla C, 92093-0112. US jbell@math.ucsd.edu 1 Proposed Running Head:
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 informationUpper Bounds for Stern s Diatomic Sequence and Related Sequences
Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:
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 informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
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 informationDeterminants of generalized binary band matrices
Determinants of generalized inary and matrices Dmitry Efimov arxiv:17005655v1 [mathra] 18 Fe 017 Department of Mathematics, Komi Science Centre UrD RAS, Syktyvkar, Russia Astract Under inary matrices we
More informationOn the Third Order Rational Difference Equation
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 27, 32-334 On the Third Order Rational Difference Equation x n x n 2 x (a+x n x n 2 ) T. F. Irahim Department of Mathematics, Faculty of Science Mansoura
More informationGeorgian Mathematical Journal 1(94), No. 4, ON THE INITIAL VALUE PROBLEM FOR FUNCTIONAL DIFFERENTIAL SYSTEMS
Georgian Mathematical Journal 1(94), No. 4, 419-427 ON THE INITIAL VALUE PROBLEM FOR FUNCTIONAL DIFFERENTIAL SYSTEMS V. ŠEDA AND J. ELIAŠ Astract. For a system of functional differential equations of an
More informationZeroing the baseball indicator and the chirality of triples
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.1.7 Zeroing the aseall indicator and the chirality of triples Christopher S. Simons and Marcus Wright Department of Mathematics
More informationExploring Lucas s Theorem. Abstract: Lucas s Theorem is used to express the remainder of the binomial coefficient of any two
Delia Ierugan Exploring Lucas s Theorem Astract: Lucas s Theorem is used to express the remainder of the inomial coefficient of any two integers m and n when divided y any prime integer p. The remainder
More informationSolutions to Exam 2, Math 10560
Solutions to Exam, Math 6. Which of the following expressions gives the partial fraction decomposition of the function x + x + f(x = (x (x (x +? Solution: Notice that (x is not an irreducile factor. If
More informationDynamical Systems Solutions to Exercises
Dynamical Systems Part 5-6 Dr G Bowtell Dynamical Systems Solutions to Exercises. Figure : Phase diagrams for i, ii and iii respectively. Only fixed point is at the origin since the equations are linear
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 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 informationFAREY-PELL SEQUENCE, APPROXIMATION TO IRRATIONALS AND HURWITZ S INEQUALITY (COMMUNICATED BY TOUFIK MANSOUR)
Bulletin of Mathematical Analysis Applications ISSN: 8-9 URL: http://wwwmathaag Volume 8 Issue (06) Pages - FAREY-PELL SEQUENCE APPROXIMATION TO IRRATIONALS AND HURWITZ S INEQUALITY (COMMUNICATED BY TOUFIK
More informationTIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION
TIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION Jiangping Wang and Dapeng Wu Department of Electrical and Computer Engineering University of Florida, Gainesville, FL 3611 Correspondence author: Prof.
More information#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES
#A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:
More informationTHE JACOBI SYMBOL AND A METHOD OF EISENSTEIN FOR CALCULATING IT
THE JACOBI SYMBOL AND A METHOD OF EISENSTEIN FOR CALCULATING IT STEVEN H. WEINTRAUB ABSTRACT. We present an exposition of the asic properties of the Jacoi symol, with a method of calculating it due to
More informationExplicit constructions of quasi-monte Carlo rules for the numerical integration of high dimensional periodic functions
Explicit constructions of quasi-monte Carlo rules for the numerical integration of high dimensional periodic functions By J. Dick at Sydney Astract In this paper we give first explicit constructions of
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
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 informationERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA)
ERASMUS UNIVERSITY ROTTERDAM Information concerning the Entrance examination Mathematics level 2 for International Business Administration (IBA) General information Availale time: 2.5 hours (150 minutes).
More informationTHE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México
#A8 INTEGERS 15A (2015) THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p Mario Huicochea CINNMA, Querétaro, México dym@cimat.mx Amanda Montejano UNAM Facultad de Ciencias
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationarxiv:math/ v2 [math.nt] 3 Dec 2003
arxiv:math/0302091v2 [math.nt] 3 Dec 2003 Every function is the representation function of an additive basis for the integers Melvyn B. Nathanson Department of Mathematics Lehman College (CUNY) Bronx,
More informationDepth versus Breadth in Convolutional Polar Codes
Depth versus Breadth in Convolutional Polar Codes Maxime Tremlay, Benjamin Bourassa and David Poulin,2 Département de physique & Institut quantique, Université de Sherrooke, Sherrooke, Quéec, Canada JK
More informationOn distribution functions of ξ(3/2) n mod 1
ACTA ARITHMETICA LXXXI. (997) On distribution functions of ξ(3/2) n mod by Oto Strauch (Bratislava). Preliminary remarks. The question about distribution of (3/2) n mod is most difficult. We present a
More informationPM functions, their characteristic intervals and iterative roots
ANNALES POLONICI MATHEMATICI LXV.2(1997) PM functions, their characteristic intervals and iterative roots by Weinian Zhang (Chengdu) Abstract. The concept of characteristic interval for piecewise monotone
More informationFast inverse for big numbers: Picarte s iteration
Fast inverse for ig numers: Picarte s iteration Claudio Gutierrez and Mauricio Monsalve Computer Science Department, Universidad de Chile cgutierr,mnmonsal@dcc.uchile.cl Astract. This paper presents an
More informationStability Domain of a Linear Differential Equation with Two Delays
ELSEVIER An International Journal Availale online at www.sciencedirect.com computers &.c,..c. ~--~c,..c.. mathematics with applications Computers and Mathematics with Applications 51 (2006) 153-159 www.elsevier.com/locate/camwa
More informationIsolated Toughness and Existence of [a, b]-factors in Graphs
Isolated Toughness and Existence of [a, ]-factors in Graphs Yinghong Ma 1 and Qinglin Yu 23 1 Department of Computing Science Shandong Normal University, Jinan, Shandong, China 2 Center for Cominatorics,
More informationROUNDOFF ERRORS; BACKWARD STABILITY
SECTION.5 ROUNDOFF ERRORS; BACKWARD STABILITY ROUNDOFF ERROR -- error due to the finite representation (usually in floatingpoint form) of real (and complex) numers in digital computers. FLOATING-POINT
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 informationWEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R)
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 129, Numer 1, Pages 145 154 S 0002-9939(00)05731-2 Article electronically pulished on July 27, 2000 WEYL-HEISENBERG FRAMES FOR SUBSPACES OF L 2 (R)
More informationExplicit Bounds Concerning Non-trivial Zeros of the Riemann Zeta Function
Explicit Bounds Concerning Non-trivial Zeros of the Riemann Zeta Function Mehdi Hassani Dedicated to Professor Hari M. Srivastava Abstract In this paper, we get explicit upper and lower bounds for n,where
More informationSharp estimates of bounded solutions to some semilinear second order dissipative equations
Sharp estimates of ounded solutions to some semilinear second order dissipative equations Cyrine Fitouri & Alain Haraux Astract. Let H, V e two real Hilert spaces such that V H with continuous and dense
More informationSVETLANA KATOK AND ILIE UGARCOVICI (Communicated by Jens Marklof)
JOURNAL OF MODERN DYNAMICS VOLUME 4, NO. 4, 010, 637 691 doi: 10.3934/jmd.010.4.637 STRUCTURE OF ATTRACTORS FOR (a, )-CONTINUED FRACTION TRANSFORMATIONS SVETLANA KATOK AND ILIE UGARCOVICI (Communicated
More informationEssential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March.
Essential Maths 1 The information in this document is the minimum assumed knowledge for students undertaking the Macquarie University Masters of Applied Finance, Graduate Diploma of Applied Finance, and
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More information" $ CALCULUS 2 WORKSHEET #21. t, y = t + 1. are A) x = 0, y = 0 B) x = 0 only C) x = 1, y = 0 D) x = 1 only E) x= 0, y = 1
CALCULUS 2 WORKSHEET #2. The asymptotes of the graph of the parametric equations x = t t, y = t + are A) x = 0, y = 0 B) x = 0 only C) x =, y = 0 D) x = only E) x= 0, y = 2. What are the coordinates of
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 informationA UNIQUENESS THEOREM FOR MONOGENIC FUNCTIONS
Annales Academiæ Scientiarum Fennicæ Series A. I. Mathematica Volumen 8, 993, 05 6 A UNIQUENESS THEOREM FOR MONOGENIC FUNCTIONS Jörg Winkler Technische Universität Berlin, Fachbereich 3, Mathematik Straße
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationCHAPTER V MULTIPLE SCALES..? # w. 5?œ% 0 a?ß?ß%.?.? # %?œ!.>#.>
CHAPTER V MULTIPLE SCALES This chapter and the next concern initial value prolems of oscillatory type on long intervals of time. Until Chapter VII e ill study autonomous oscillatory second order initial
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 informationMATH 225: Foundations of Higher Matheamatics. Dr. Morton. 3.4: Proof by Cases
MATH 225: Foundations of Higher Matheamatics Dr. Morton 3.4: Proof y Cases Chapter 3 handout page 12 prolem 21: Prove that for all real values of y, the following inequality holds: 7 2y + 2 2y 5 7. You
More informationBranching Bisimilarity with Explicit Divergence
Branching Bisimilarity with Explicit Divergence Ro van Glaeek National ICT Australia, Sydney, Australia School of Computer Science and Engineering, University of New South Wales, Sydney, Australia Bas
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 informationarxiv: v3 [math.nt] 16 Oct 2013
On the Zeros of the Second Derivative of the Riemann Zeta Function under the Riemann Hypothesis Ade Irma Suriajaya Graduate School of Mathematics, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-860,
More informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationPOLYOMINOES WITH MINIMUM SITE-PERIMETER AND FULL SET ACHIEVEMENT GAMES. Nándor Sieben
POLYOMINOES WITH MINIMUM SITE-PERIMETER AN FULL SET ACHIEVEMENT GAMES Nándor Sieben Abstract The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula
More informationOn Worley s theorem in Diophantine approximations
Annales Mathematicae et Informaticae 35 (008) pp. 61 73 http://www.etf.hu/ami On Worley s theorem in Diophantine approximations Andrej Dujella a, Bernadin Irahimpašić a Department of Mathematics, University
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
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 information#A63 INTEGERS 17 (2017) CONCERNING PARTITION REGULAR MATRICES
#A63 INTEGERS 17 (2017) CONCERNING PARTITION REGULAR MATRICES Sourav Kanti Patra 1 Department of Mathematics, Ramakrishna Mission Vidyamandira, Belur Math, Howrah, West Bengal, India souravkantipatra@gmail.com
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationLecture 6 January 15, 2014
Advanced Graph Algorithms Jan-Apr 2014 Lecture 6 January 15, 2014 Lecturer: Saket Sourah Scrie: Prafullkumar P Tale 1 Overview In the last lecture we defined simple tree decomposition and stated that for
More informationJournal of Number Theory
Journal of Number Theory 129 (2009) 2766 2777 Contents lists available at ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt The critical number of finite abelian groups Michael Freeze
More informationON A FUNCTIONAL EQUATION ASSOCIATED WITH THE TRAPEZOIDAL RULE - II
Bulletin of the Institute of Mathematics Academia Sinica New Series) Vol. 4 009), No., pp. 9-3 ON A FUNCTIONAL EQUATION ASSOCIATED WITH THE TRAPEZOIDAL RULE - II BY PRASANNA K. SAHOO Astract In this paper,
More informationGenetic Algorithms applied to Problems of Forbidden Configurations
Genetic Algorithms applied to Prolems of Foridden Configurations R.P. Anstee Miguel Raggi Department of Mathematics University of British Columia Vancouver, B.C. Canada V6T Z2 anstee@math.uc.ca mraggi@gmail.com
More informationLuis Manuel Santana Gallego 100 Investigation and simulation of the clock skew in modern integrated circuits. Clock Skew Model
Luis Manuel Santana Gallego 100 Appendix 3 Clock Skew Model Xiaohong Jiang and Susumu Horiguchi [JIA-01] 1. Introduction The evolution of VLSI chips toward larger die sizes and faster clock speeds makes
More informationMAPS WHICH CONVERGE IN THE UNIFORM C 0 -NORM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 28, Numer, Pages 3285 329 S 2-9939()564-9 Article electronically pulished on April 28, 2 ON SEQUENCES OF C MAPS WHICH CONVERGE IN THE UNIFORM C -NORM
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationUPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES
Applied Probability Trust 7 May 22 UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES HAMED AMINI, AND MARC LELARGE, ENS-INRIA Abstract Upper deviation results are obtained for the split time of a
More informationA Division Algorithm Approach to p-adic Sylvester Expansions
arxiv:1508.01503v1 [math.nt] 6 Aug 2015 A Division Algorithm Approach to p-adic Sylvester Expansions Eric Errthum Department of Mathematics and Statistics Winona State University Winona, MN E-mail: eerrthum@winona.edu
More informationExistence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets
Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R
More informationInclusion Properties of Orlicz Spaces and Weak Orlicz Spaces Generated by Concave Functions
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Inclusion Properties of Orlicz Spaces and Weak Orlicz Spaces Generated y Concave Functions To cite this article: M Taqiyuddin
More information1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS
1Numer systems: real and complex 1.1 Kick off with CAS 1. Review of set notation 1.3 Properties of surds 1. The set of complex numers 1.5 Multiplication and division of complex numers 1.6 Representing
More informationFixed point theorems for Zamfirescu mappings in metric spaces endowed with a graph
CARPATHIAN J. MATH. 31 2015, No. 3, 297-305 Online version availale at http://carpathian.um.ro Print Edition: ISSN 1584-2851 Online Edition: ISSN 1843-4401 Fixed point theorems for Zamfirescu mappings
More informationCONVERGENCE OF POLYNOMIAL ERGODIC AVERAGES
CONVERGENCE OF POLYNOMIAL ERGODIC AVERAGES BERNARD HOST AND BRYNA KRA Abstract. We prove the L 2 convergence for an ergodic average of a product of functions evaluated along polynomial times in a totally
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationIntroductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19
Introductory Analysis I Fall 204 Homework #9 Due: Wednesday, November 9 Here is an easy one, to serve as warmup Assume M is a compact metric space and N is a metric space Assume that f n : M N for each
More informationarxiv: v1 [cs.fl] 24 Nov 2017
(Biased) Majority Rule Cellular Automata Bernd Gärtner and Ahad N. Zehmakan Department of Computer Science, ETH Zurich arxiv:1711.1090v1 [cs.fl] 4 Nov 017 Astract Consider a graph G = (V, E) and a random
More informationAustin Mohr Math 704 Homework 6
Austin Mohr Math 704 Homework 6 Problem 1 Integrability of f on R does not necessarily imply the convergence of f(x) to 0 as x. a. There exists a positive continuous function f on R so that f is integrable
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 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 informationA WEAK VERSION OF ROLLE S THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3147 3153 S 0002-9939(97)03910-5 A WEAK VERSION OF ROLLE S THEOREM THOMAS C. CRAVEN (Communicated by Wolmer
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada fjdixon,danielg@math.carleton.ca
More informationC) 2 D) 4 E) 6. ? A) 0 B) 1 C) 1 D) The limit does not exist.
. The asymptotes of the graph of the parametric equations = t, y = t t + are A) =, y = B) = only C) =, y = D) = only E) =, y =. What are the coordinates of the inflection point on the graph of y = ( +
More informationR.A. Mollin Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada, T2N 1N4
PERIOD LENGTHS OF CONTINUED FRACTIONS INVOLVING FIBONACCI NUMBERS R.A. Mollin Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, Canada, TN 1N e-mail ramollin@math.ucalgary.ca
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationP -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS. Tomislav Pejković
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 20 = 528 2016): 9-18 P -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS Tomislav Pejković Abstract. We study p-adic root separation for quadratic and cubic
More informationJoshua N. Cooper Department of Mathematics, Courant Institute of Mathematics, New York University, New York, NY 10012, USA.
CONTINUED FRACTIONS WITH PARTIAL QUOTIENTS BOUNDED IN AVERAGE Joshua N. Cooper Department of Mathematics, Courant Institute of Mathematics, New York University, New York, NY 10012, USA cooper@cims.nyu.edu
More informationarxiv: v1 [math.nt] 5 Mar 2019
LOW DISCREPANCY SEQUENCES FAILING POISSONIAN PAIR CORRELATIONS arxiv:1903.0106v1 [math.nt] 5 Mar 019 Abstract. M. Levin defined a real number x that satisfies that the sequence of the fractional parts
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 informationANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99
ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS N. HEGYVÁRI, F. HENNECART AND A. PLAGNE Abstract. We study the gaps in the sequence of sums of h pairwise distinct elements
More informationLogarithms. For example:
Math Review Summation Formulas Let >, let A, B, and C e constants, and let f and g e any functions. Then: f C Cf ) ) S: factor out constant ± ± g f g f ) ) )) ) S: separate summed terms C C ) 6 ) ) Computer
More informationLet N > 0, let A, B, and C be constants, and let f and g be any functions. Then: S2: separate summed terms. S7: sum of k2^(k-1)
Summation Formulas Let > 0, let A, B, and C e constants, and let f and g e any functions. Then: k Cf ( k) C k S: factor out constant f ( k) k ( f ( k) ± g( k)) k S: separate summed terms f ( k) ± k g(
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 informationSTRONG CONVERGENCE OF AN IMPLICIT ITERATION PROCESS FOR ASYMPTOTICALLY NONEXPANSIVE IN THE INTERMEDIATE SENSE MAPPINGS IN BANACH SPACES
Kragujevac Journal of Mathematics Volume 36 Number 2 (2012), Pages 237 249. STRONG CONVERGENCE OF AN IMPLICIT ITERATION PROCESS FOR ASYMPTOTICALLY NONEXPANSIVE IN THE INTERMEDIATE SENSE MAPPINGS IN BANACH
More information