DOCSLIB.ORG

ON the Vmm(S;A, Z)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ON the Vmm(S;A, Z) Novi Sad J. Math. 99 Vol. 34, No. 1, 2004, 99-106 ON THE vMm(s; a; z) FUNCTION Aleksandar Petojevi´c1 1 Abstract. In this paper we study the special cases fvMm(s; m+n; z)gn=2 1 and fvMm(s; a; n)gn=1, where vMm(s; a; z) is the function defined in [8]. Also, we give connections between vMm(s; a; z) function and figured num- bers, Stirling numbers of the first kind and Riemann Zeta function. AMS Mathematics Subject Classification (2000): 11B34 Key words and phrases: vMm(s; a; z) function, factorial function, Rie- mann Zeta function, figured number, Stirling number 1. Introduction In 1971, Kurepa (see [4, 5]) defined so-called the left factorial !n by: nX¡1 !0 = 0; !n = k!(n 2 N) k=0 and extended it to the complex half-plane Re (z) > 0 as Z +1 tz ¡ 1 !z = e¡t dt: 0 t ¡ 1 Such function can be also extended analytically to the whole complex plane by !z =!(z + 1) ¡ Γ(z + 1), where Γ(z) is the gamma function defined by Z +1 Γ(z) = tz¡1e¡t dt (Re (z) > 0): 0 Recently, Milovanovi´c[6] defined and studied a sequence of the factorial +1 functions fMm(z)gm=¡1 where M¡1(z) = Γ(z) and M0(z) = !z. Namely, Z +1 z+m t ¡ Qm(t; z) ¡t (1.1) Mm(z) = m+1 e dt (Re (z) > ¡(m + 1)); 0 (t ¡ 1) where the polynomials Qm(t; z), m = ¡1; 0; 1; 2;:::, are given by µ ¶ Xm m + z Q (t; z) = 0;Q (t; z) = (t ¡ 1)k: ¡1 m k k=0 1University of Novi Sad, Teacher Training Faculty, Podgoriˇcka 4, 25000 Sombor, Serbia and Montenegro, E-mail: [email protected] 100 A. Petojevi´c Since (1.2) Mm(z) = Mm(z + 1) ¡ Mm¡1(z + 1) (m 2 N0); similar to the gamma function, the functions z 7! Mm(z), for each m 2 N0, can be extended analytically to the whole complex plane, starting from the corresponding analytic extension of the gamma function. Suppose that we have analytic extensions for all functions z 7! Mº (z), º < m. Let the function z 7! Mm(z) be defined by (1.1) for z in the half-plane Re (z) > ¡(m + 1). Using successively (1.2), we define at first Mm(z) for z in the strip ¡(m + 2) < Re (z) < ¡(m + 1), then for z such that ¡(m + 3) < Re (z) < ¡(m + 2), etc. In this way we obtain the function Mm(z) in the whole complex plane. In [8] the generalization is given of Milovanovi´c’sfactorial function: Definition 1.1 For m = ¡1; 0; 1; 2; ::: and Re (z) > v ¡ m ¡ 2 the function vMm(s; a; z) defined by µ ¶ Xv z + m + 1 ¡ k M (s; a; z) = (¡1)k¡1 L[s; F (a; k ¡ z; m + 2; 1 ¡ t)]; v m m + 1 2 1 k=1 where v is a positive integer, s; a; z are complex variables. The hypergeometric function 2F1(a; b; c; x) is defined by the series X1 (a) (b) xn F (a; b; c; x) = n n (jxj < 1); 2 1 (c) n! n=0 n and has the integral representation Z 1 Γ(c) b¡1 c¡b¡1 ¡a 2F1(a; b; c; x) = t (1 ¡ t) (1 ¡ tx) dt; Γ(b)Γ(c ¡ b) 0 in the x plane cut along the real axis from 1 to 1, if Re (c) > Re (b) > 0. The symbols (z)n and L[s; F (t)] represent the Pochhammer symbol Γ(z + n) (z) = 1; (z) = z(z + 1):::(z + n ¡ 1) = ; 0 n Γ(z) and Laplace transform Z 1 L[s; F (t)] = e¡stF (t)dt: 0 The binomial coefficient function defined via µ ¶ z Γ(z + 1) = : m Γ(m + 1)Γ(z ¡ m + 1) These function are of interest because their special cases include: On the vMm(s; a; z) function 101 1Mm(1; 1; z) = Mm(z) 1M¡1(1; 1; z) = Γ(z) 1M0(1; 1; z) = !z nM¡1(1; 1; n + 1) = An; where An denotes the alternating factorial numbers Xn n¡k An = (¡1) k!: k=1 For the complex half-plane Re (z) > 0; the function Az is defined by (see [8]) Z 1 z+1 z def x ¡ (¡1) x ¡x Az = e dx: 0 x + 1 However, apart from n!; !n and An twenty-five more well-known integer se- quences in [10] are special cases of the function vMm(s; a; z): 2. The statement results and proofs Investigation of the function vMm(s; a; z) by using the two statements could be translated to the investigation of the function 1Mm(s; a; z) as follows: apply- ing the relation 2Mm(s; a; z) = 1Mm(s; a; z) ¡ 1Mm(s; a; z ¡ 1); induction on v we have Xv k¡1 (2.3) vMm(s; a; z) = (¡1) 1Mm(s; a; z ¡ k + 1): k=1 Using the relation 2F1(a; 1 ¡ z; m + 2; 1 ¡ t) =2 F1(1 ¡ z; a; m + 2; 1 ¡ t)(j1 ¡ tj < 1) we have µ ¶ µ ¶ a + m z + m M (s; a; z) = M (s; 1 ¡ z; a): m + 1 1 m m + 1 1 m Hence (z)m+1 1Mm(s; a; z) = 1Mm(s; 1 ¡ z; a): (a)m+1 The relation (2.3) yields Xv Xv k¡1 k¡1 (z ¡ k + 1)m+1 (¡1) 1Mm(s; a; z ¡ k + 1) = (¡1) 1Mm(s; k ¡ z; a) (a)m+1 k=1 k=1 i.e., Xv k¡1 (z ¡ k + 1)m+1 (2.4) vMm(s; a; z) = (¡1) 1Mm(s; k ¡ z; a) : (a)m+1 k=1 102 A. Petojevi´c 1 2.1 The special case fvMm(s; m + n; z)gn=2 For the function vMm(s; a; z); the following special cases hold (see [8]): µ ¶µ ¶ n! z(z + 1):::(z + m) X1 n + m + 1 z ¡ 1 M (1; ¡n; z) = (¡1)kD ; 1 m (n + m + 1)! k + m + 1 k k k=0 nzΓ(z + m + 1) M (1=n; m + 2; z) = ; 1 m (m + 1)! where Dk denotes the derangement numbers (sequence A000166 in [10]). We now introduce a generalization of the last relation: Theorem 2.1. For every natural number n > 1 and Re (s) > 0; Re (z) > 0 we have vMm(s; m + n; z) = µ ¶ Xv (¡1)k¡1sk¡z¡1 nX¡2 n ¡ 2 = (¡s)iΓ(z + m + n ¡ k ¡ i) : (m + n ¡ 1)! i k=1 i=0 d Proof . Let the function ¯i (m; n) be defined by ( 0; if i + d · n ¡ 2; d ¯i (m; n) = m + n ¡ 1; if i + d > n ¡ 2: Since X1 (m + n) (1 ¡ z) (1 ¡ t)j F (m + n; 1 ¡ z; m + 2; 1 ¡ t) = j j (j1 ¡ tj < 1) 2 1 (m + 2) j! j=0 j using relations (see [1]) a(1 ¡ z) 2F1(a + 1; b; c; z) = (2a ¡ c ¡ az + bz) 2F1(a; b; c; z) + + (c ¡ a) 2F1(a ¡ 1; b; c; z) and (¡1)nΓ(z) (1 ¡ z) = n Γ(z ¡ n) we have 2F1(m + n; 1 ¡ z; m + 2; 1 ¡ t) = µ ¶ tz¡n+1(m + 1)! nX¡2 n ¡ 2 nY¡2 = (¡1)n¡iti (z ¡ d + ¯d(m; n)): (m + n ¡ 1)! i i i=0 d=1 On the vMm(s; a; z) function 103 Hence L[s; 2F1(m + n; 1 ¡ z; m + 2; 1 ¡ t)] = Z µ ¶ 1 tz¡n+1(m + 1)! nX¡2 n ¡ 2 = e¡st (¡1)n¡iti (m + n ¡ 1)! i 0 i=0 nY¡2 d £ (z ¡ d + ¯i (m; n)) dt d=1 µ ¶ (m + 1)! nX¡2 n ¡ 2 nY¡2 = (¡1)n¡i (z ¡ d + ¯d(m; n)) (m + n ¡ 1)! i i i=0 d=1 Z 1 £ e¡sttz¡n+1+i dt : 0 Since, for Re (s) > 0 and Re (z) > 0 Z 1 e¡sttz¡n+1+i dt = sn¡z¡i¡2 Γ(z ¡ n + i + 2) 0 we have L[s; 2F1(m + n; 1 ¡ z; m + 2; 1 ¡ t)] = µ ¶ (m + 1)! nX¡2 n ¡ 2 = (¡1)n¡isn¡z¡i¡2 Γ(z ¡ n + i + 2) (m + n ¡ 1)! i i=0 nY¡2 d £ (z ¡ d + ¯i (m; n)) d=1 µ ¶ (m + 1)! Γ(z) nX¡2 n ¡ 2 Γ(z + m + n ¡ 1 ¡ i) = (¡s)i ; (m + n ¡ 1)! sz i Γ(z + m + 1) i=0 so that 1Mm(s; m + n; z) = µ ¶ µ ¶ z + m (m + 1)! Γ(z) nX¡2 n ¡ 2 Γ(z + m + n ¡ 1 ¡ i) = (¡s)i m + 1 (m + n ¡ 1)! sz i Γ(z + m + 1) i=0 µ ¶ s¡z nX¡2 n ¡ 2 = (¡s)iΓ(z + m + n ¡ 1 ¡ i): (m + n ¡ 1)! i i=0 104 A. Petojevi´c The relation (2.3) yields vMm(s; m + n; z) = µ ¶ Xv (¡1)k¡1sk¡z¡1 nX¡2 n ¡ 2 = (¡s)iΓ(z + m + n ¡ k ¡ i) : (m + n ¡ 1)! i k=1 i=0 1 2.2 The special case fvMm(s; a; n)gn=1 1 The function fvMm(s; a; n)gn=1 can be expressed in terms of the falling factorial polynomials Γ(x + 1) [x] = 1; [x] = x(x ¡ 1):::(x ¡ n + 1) = (n 2 N) 0 n Γ(x ¡ n + 1) in the form Theorem 2.2.
Load more

Recommended publications
  • And Some Well-Known Sequences
    1 2 Journal of Integer Sequences, Vol. 5 (2002), 3 Article 02.1.6 47 6 23 11 The function M (s; a; z) and some well-known v m sequences Aleksandar Petojevi¶c Aleja Mar·sala Tita 4/2 24000 Subotica Yugoslavia Email address: [email protected] Abstract In this paper we de¯ne the function vMm(s; a; z), and we study the special cases 1Mm(s; a; z) and nM¡1(1; 1; n + 1). We prove some new equivalents of Kurepa's hypothesis for the left factorial. Also, we present a generalization of the alternating factorial numbers. 1 Introduction Studying the Kurepa function +1 tz ¡ 1 K(z) = !z = e¡t dt (Re z > 0); t ¡ 1 Z0 G. V. Milovanovi¶c gave a generalization of the function +1 tz+m ¡ Q (t; z) M (z) = m e¡tdt (Re z > ¡(m + 1)); m (t ¡ 1)m+1 Z0 where the polynomials Qm(t; z), m = ¡1; 0; 1; 2; ::: are given by m m + z Q (t; z) = 0 Q (t; z) = (t ¡ 1)k: ¡1 m k Xk=0 µ ¶ This work was supported in part by the Serbian Ministry of Science, Technology and Development under Grant # 2002: Applied Orthogonal Systems, Constructive Approximation and Numerical Methods. 1 +1 The function fMm(z)gm=¡1 has the integral representation 1 z(z + 1) ¢ ¢ ¢ (z + m) z¡1 m (1¡»)=» 1 ¡ » Mm(z) = » (1 ¡ ») e ¡ z; d»; m! 0 » Z ³ ´ where ¡(z; x), the incomplete gamma function, is de¯ned by +1 ¡(z; x) = tz¡1e¡t dt: (1) Zx Special cases include M¡1(z) = ¡(z) and M0(z) = K(z); (2) where ¡(z) is the gamma function +1 ¡(z) = tz¡1e¡t dt: Z0 The numbers Mm(n) were introduced by Milovanovi¶c [10] and Milovanovi¶c and Petojevi¶c [11].
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]
  • Diagrammatic Monte-Carlo for Weak-Coupling Expansion of Non
    Diagrammatic Monte-Carlo for weak-coupling expansion of non-Abelian lattice field theories: large-N U (N) U (N) principal chiral model∗ × P. V. Buividovich† and A. Davody‡ Institute of Theoretical Physics, University of Regensburg, D-93053 Germany, Regensburg, Universit¨atsstrasse 31 (Dated: November 1st, 2017) We develop numerical tools for Diagrammatic Monte-Carlo simulations of non-Abelian lattice field theories in the t’Hooft large-N limit based on the weak-coupling expansion. First we note that the path integral measure of such theories contributes a bare mass term in the effective action which is proportional to the bare coupling constant. This mass term renders the perturbative expansion infrared-finite and allows to study it directly in the large-N and infinite-volume limits using the Diagrammatic Monte-Carlo approach. On the exactly solvable example of a large-N O (N) sigma model in D = 2 dimensions we show that this infrared-finite weak-coupling expansion contains, in addition to powers of bare coupling, also powers of its logarithm, reminiscent of re- summed perturbation theory in thermal field theory and resurgent trans-series without exponential terms. We numerically demonstrate the convergence of these double series to the manifestly non- perturbative dynamical mass gap. We then develop a Diagrammatic Monte-Carlo algorithm for sampling planar diagrams in the large-N matrix field theory, and apply it to study this infrared- finite weak-coupling expansion for large-N U (N) × U (N) nonlinear sigma model (principal chiral model) in D = 2. We sample up to 12 leading orders of the weak-coupling expansion, which is the practical limit set by the increasingly strong sign problem at high orders.
    [Show full text]
  • Renormalization Scheme and Gauge (In) Dependence of the Generalized
    Published for SISSA by Springer Received: January 24, 2018 Accepted: January 28, 2018 Published: February 26, 2018 Renormalization scheme and gauge (in)dependence of the generalized Crewther relation: what are the real JHEP02(2018)161 grounds of the β-factorization property? A.V. Garkusha,a;1 A.L. Kataevb;c and V.S. Molokoedovb;c aHigher School of Economics, Math Department, Myasnitskaya street 20, Moscow, 101000, Russia bInstitute for Nuclear Research of the Russian Academy of Sciences, 60th October Anniversary prospect 7a, Moscow, 117312, Russia cMoscow Institute of Physics and Technology, Institusky per. 9, Dolgoprudny, Moscow region, 141700, Russia E-mail: [email protected], [email protected], viktor [email protected] Abstract: The problem of scheme and gauge dependence of the factorization property of the renormalization group β-function in the SU(Nc) QCD generalized Crewther relation (GCR), which connects the flavor non-singlet contributions to the Adler and Bjorken po- 4 larized sum rule functions, is investigated at the O(as) level of perturbation theory. It is known that in the gauge-invariant renormalization MS-scheme this property holds in the QCD GCR at least at this order. To study whether this factorization property is true in all gauge-invariant schemes, we consider the MS-like schemes in QCD and the QED-limit of the GCR in the MS-scheme and in two other gauge-independent subtraction schemes, namely in the momentum MOM and the on-shell OS schemes. In these schemes we con- firm the existence of the β-function factorization in the QCD and QED variants of the GCR.
    [Show full text]
  • Arxiv:2001.00578V2 [Math.HO] 3 Aug 2021
    Errata and Addenda to Mathematical Constants Steven Finch August 3, 2021 Abstract. We humbly and briefly offer corrections and supplements to Mathematical Constants (2003) and Mathematical Constants II (2019), both published by Cambridge University Press. Comments are always welcome. 1. First Volume 1.1. Pythagoras’ Constant. A geometric irrationality proof of √2 appears in [1]; the transcendence of the numbers √2 √2 i π √2 , ii , ie would follow from a proof of Schanuel’s conjecture [2]. A curious recursion in [3, 4] gives the nth digit in the binary expansion of √2. Catalan [5] proved the Wallis-like infinite product for 1/√2. More references on radical denestings include [6, 7, 8, 9]. 1.2. The Golden Mean. The cubic irrational ψ =1.3247179572... is connected to a sequence 3 ψ1 =1, ψn = 1+ ψn 1 for n 2 − ≥ which experimentally gives rise to [10] p n 1 lim (ψ ψn) 3(1 + ) =1.8168834242.... n − ψ →∞ The cubic irrational χ =1.8392867552... is mentioned elsewhere in the literature with arXiv:2001.00578v2 [math.HO] 3 Aug 2021 regard to iterative functions [11, 12, 13] (the four-numbers game is a special case of what are known as Ducci sequences), geometric constructions [14, 15] and numerical analysis [16]. Infinite radical expressions are further covered in [17, 18, 19]; more gen- eralized continued fractions appear in [20, 21]. See [22] for an interesting optimality property of the logarithmic spiral. A mean-value analog C of Viswanath’s constant 1.13198824... (the latter applies for almost every random Fibonacci sequence) was dis- covered by Rittaud [23]: C =1.2055694304..
    [Show full text]
  • Arxiv:Math/0312202V1
    PUBLICATIONS DE L’INSTITUT MATHEMATIQUE´ Nouvelle s´erie, tome 57 (71), 1995, 19–28 Duro- Kurepa memorial volume ON KUREPA’S PROBLEMS IN NUMBER THEORY Dedicated to the memory of Prof. Duro- Kurepa A. Ivi´c, Z.ˇ Mijajlovi´c Abstract. We discuss some problems in number theory posed by Duro- Kurepa, including the so-called left factorial hypothesis that an odd prime p does not divide 0! + 1! + ··· +(p − 1)!. 1. Introduction D.- Kurepa posed several problems in number theory that drew attention of many workers in number theory. Certainly, the most known of his problems is the so called left factorial hypothesis, which is still an open problem. However, Kurepa asked several other questions that are less known, but we think that they are interesting as well. The aim of this paper is to review some of these problems, and to present some of the known results concerning them. We shall assume the following notation. We shall denote by N the set of + natural numbers (nonnegative integers), N denotes positive integers, while Zn arXiv:math/0312202v1 [math.NT] 10 Dec 2003 denotes the ring of integers modulo n. The greatest common divisor of integers a and b is denoted by (a,b). The Galois field of p elements, where p is a prime, is denoted by GF(p). If m and n are integers, by rest(m, n) we shall denote the remainder obtained from division of m by n. 2. The left factorial function D.- Kurepa defined in [Ku71] an arithmetic function K(n) that he denoted by !n and called it the left factorial, by n−1 K(n)=!n = i!, n N +.
    [Show full text]
  • On the Dn(S) Polynomials
    On the Dn(s) polynomials Aleksandar Petojevi´c University of Novi Sad, Teacher Training Faculty Podgoriˇcka 4, 25000 Sombor SERBIA and MONTENEGRO E-mail: [email protected] Abstract In this paper we study a sequence of polynomials n m m s Dn(s) = n! (−1) ; (n 2 N0): m! mX=0 We give connection between fvMm(s; a; r)gr2N functions and Dn(s) polyno- mials, where vMm(s; a; z) is the function defined in [8]. 1 Introduction and Definition In 1971 Kurepa (see [4, 5]) defined so-called the left factorial !n by: n−1 !0 = 0; !n = k! (n 2 N) Xk=0 and extended it to the complex half-plane Re (z) > 0 as +1 z t − 1 t !z = e− dt: Z0 t − 1 2000 Mathematics Subject Classification : Primary 11B34. Key words and phrases : Dn(s) polynomials, vMm(s; a; z) function, factorial function. 1 Such function can be also extended analytically to the whole complex plane by !z =!(z + 1) − Γ(z + 1), where Γ(z) is the gamma function defined by +1 z t Γ(z) = t −1e− dt (Re (z) > 0): Z0 Milovanovi´c in [6] defined and studied a sequence of the factorial functions +1 fMm(z)gm=−1 where M−1(z) = Γ(z) and M0(z) = !z. Namely, +1 z+m t − Qm(t; z) −t Mm(z) = m+1 e dt (Re (z) > −(m + 1)); (1.1) Z0 (t − 1) where the polynomials Qm(t; z), m = −1; 0; 1; 2; : : :, are given by m m + z k Q−1(t; z) = 0; Qm(t; z) = (t − 1) : k Xk=0 For m = −1; 0; 1; 2; ::: and Re (z) > v−m−2 in [8] is given the generalization of Milovanovi´c's factorial function: v k−1 z + m + 1 − k vMm(s; a; z) = (−1) L[s; 2F1(a; k − z; m + 2; 1 − t)]; m + 1 Xk=1 (1.2) where v is a positive integer, s; a; z are complex variables.
    [Show full text]
  • Package 'Zseq'
    Package ‘Zseq’ February 3, 2018 Type Package Title Integer Sequence Generator Version 0.2.0 Description Generates well-known integer sequences. 'gmp' package is adopted for comput- ing with arbitrarily large numbers. Every function has hyperlink to its correspond- ing item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the func- tion help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306). License GPL (>= 3) Encoding UTF-8 LazyData true Imports gmp RoxygenNote 6.0.1 NeedsCompilation no Author Kisung You [aut, cre] (<https://orcid.org/0000-0002-8584-459X>) Maintainer Kisung You <[email protected]> Repository CRAN Date/Publication 2018-02-02 23:07:14 UTC R topics documented: Zseq-package . .2 Abundant . .3 Achilles . .3 Bell .............................................4 Carmichael . .5 Catalan . .5 Composite . .6 Deficient . .7 Equidigital . .7 Evil .............................................8 Extravagant . .9 1 2 Zseq-package Factorial . .9 Factorial.Alternating . 10 Factorial.Double . 11 Fibonacci . 11 Frugal . 12 Happy............................................ 13 Juggler . 13 Juggler.Largest . 14 Juggler.Nsteps . 15 Lucas . 15 Motzkin . 16 Odious . 17 Padovan........................................... 17 Palindromic . 18 Palindromic.Squares . 19 Perfect . 19 Perrin . 20 Powerful . 21 Prime . 21 Regular . 22 Square . 23 Squarefree . 23 Telephone . 24 Thabit . 25 Triangular . 25 Unusual . 26 Index 27 Zseq-package Zseq : Integer Sequence Generator Description The world of integer sequence has long history, which has been accumulated in OEIS. Even though R is not a first pick for many number theorists, we introduce our package to enrich the R ecosystem as well as provide pedagogical toolset. We adopted gmp for flexible large number computations in that users can easily experience large number sequences on a non-exclusive generic computing platform.
    [Show full text]
  • Function, the Iterated Function Being That Involved in the Solution of the Two-Loop /9-Function Equation
    Durham E-Theses A convergent reformulation of perturbative QCD Alves(1), RicardoJooGaio How to cite: Alves(1), RicardoJooGaio(2000)A convergent reformulation of perturbative QCD, Durhamtheses, DurhamUniversity.AvailableatDurhamE− T hesesOnline : http : //etheses.dur.ac.uk/4259/ Use policy The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in Durham E-Theses • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full Durham E-Theses policy for further details. Academic Support Oce, Durham University, University Oce, Old Elvet, Durham DH1 3HP e-mail: [email protected] Tel: +44 0191 334 6107 http://etheses.dur.ac.uk A Convergent Reformulation of perturbative QCD Ricardo Joao Gaio Alves^ Centre for Particle Theory University of Durham October 2, 2000 A thesis submitted to the University of Durham for the degree of Doctor of Philosophy The copyright of this thesis rests with the aiitlior. No quotation from it should be puhlislicd in any form, includinj; Electronic and the Internet, without the author's prior written consent. All information derived from this thesis must he acknowlcdj;ed appropriately. ^The author was the recipient of a scholarship from Programa Praxis XXI-JNICT- Portugal. 3 JUL 2Q01 Abstract We present and explore a new formulation of perturbative QCD based not on the renormalised coupling but on the dimensional transmutation parameter of the theory and the property of asymptotic scaling.
    [Show full text]
  • Arxiv:Math/0406236V9 [Math.NT] 6 Nov 2008 U N Oeo T Atclrsolutions Particular Its of Some and Sum Function ABSTRACT
    SOME CONSIDERATIONS IN CONNECTION WITH ALTERNATING KUREPA’S FUNCTION Branko J. Maleˇsevi´c 1 1Faculty of Electrical Engineering University of Belgrade, 11000 Belgrade, Serbia E-mail: [email protected] ABSTRACT. In this paper we consider the functional equation for alternating factorial sum and some of its particular solutions (alternating Kurepa’s function A(z) from [18] and function A1(z)). We determine an extension of domain of functions A(z) and A1(z) in the sense of the principal value at point [6], [22]. Using the methods from [6] and [19] we give a new representation of alternating Kurepa’s function A(z), which is an analog of Slavi´c’s representation of Kurepa’s function K(z) [6], [8]. Also, we consider some representations of functions A(z) and A1(z) via incomplete gamma function and we consider differential transcendency of previous functions too. KEYWORDS: Gamma function, Kurepa’s function, Casimir energy. MSC (2000): 30E20, 11J91, 81V99. 1 The functional equation for alternating factorial sum and its particular solutions The main object of consideration in this paper is the functional equation for alter- nating factorial sum A(z)+ A(z − 1) = Γ(z + 1), (1) − arXiv:math/0406236v9 [math.NT] 6 Nov 2008 with respect to the function A : D −→ C with domain D ⊆ C\Z , where Γ is the gamma function, C is the set of complex numbers and Z− is set of negative integer numbers. A solution of functional equation (1) over the set of natural numbers (D = N) is the function of alternating left factorial An.
    [Show full text]
  • Exploring Arbitrarily High Orders of Optimized Perturbation Theory In
    Available online at www.sciencedirect.com ScienceDirect Nuclear Physics B 910 (2016) 469–495 www.elsevier.com/locate/nuclphysb Exploring arbitrarily high orders of optimized → 1 perturbation theory in QCD with nf 162 P.M. Stevenson T.W. Bonner Laboratory, Department of Physics and Astronomy, Rice University, Houston, TX 77251, USA Received 29 June 2016; accepted 14 July 2016 Available online 19 July 2016 Editor: Tommy Ohlsson Abstract Perturbative QCD with nf flavours of massless quarks becomes simple in the hypothetical limit → 1 nf 16 2 , where the leading β-function coefficient vanishes. The Banks–Zaks (BZ) expansion in ≡ 8 1 − a0 321 (16 2 nf ) is straightforward to obtain from perturbative results in MS or any renormaliza- tion scheme (RS) whose nf dependence is ‘regular’. However, ‘irregular’ RS’s are perfectly permissible and should ultimately lead to the same BZ results. We show here that the ‘optimal’ RS determined by the Principle of Minimal Sensitivity does yield the same BZ-expansion results when all orders of perturbation theory are taken into account. The BZ limit provides an arena for exploring optimized perturbation theory at arbitrarily high orders. These explorations are facilitated by a ‘master equation’ expressing the optimization ∗2 conditions in the fixed-point limit. We find an intriguing strong/weak coupling duality a → a /a about ∗ the fixed point a . © 2016 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). Funded by SCOAP3. 1. Introduction The initial impulse for these investigations was a concern with the compatibility of the Banks– Zaks (BZ) expansion [1–4] with renormalization-scheme (RS) invariance [5].
    [Show full text]
  • Package 'Zseq'
    Package ‘Zseq’ October 27, 2017 Type Package Title Integer Sequence Generator Version 0.1.1 Author Kisung You Maintainer Kisung You <[email protected]> Description Generates well-known integer sequences. 'Rmpfr' package is adopted for computing with arbitrarily large numbers with user- specified bit precision. Every function has hyperlink to its corresponding item in OEIS (The On- Line Encyclopedia of Integer Sequences) in the function help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978- 0125586306). License GPL (>= 3) Encoding UTF-8 LazyData true Imports Rmpfr RoxygenNote 6.0.1 NeedsCompilation no Repository CRAN Date/Publication 2017-10-27 16:18:07 UTC R topics documented: Zseq-package . .2 Abundant . .3 Achilles . .3 Bell .............................................4 Carmichael . .5 Catalan . .5 Composite . .6 Deficient . .7 1 2 Zseq-package Equidigital . .8 Evil .............................................8 Extravagant . .9 Factorial . 10 Factorial.Alternating . 11 Factorial.Double . 11 Fibonacci . 12 Frugal . 13 Happy............................................ 14 Juggler . 14 Juggler.Largest . 15 Juggler.Nsteps . 16 Lucas . 17 Motzkin . 18 Odious . 18 Padovan........................................... 19 Palindromic . 20 Palindromic.Squares . 21 Perfect . 21 Perrin . 22 Polite . 23 Powerful . 24 Prime . 24 Regular . 25 Square . 26 Squarefree . 26 Telephone . 27 Thabit . 28 Triangular . 29 Unusual . 29 Index 31 Zseq-package Zseq : Integer Sequence Generator Description The world of integer sequence has long history, which has been accumulated in OEIS. Even though R is not a first pick for many number theorists, we introduce our package to enrich the R ecosystem as well as provide pedagogical toolset. We adopted Rmpfr for flexible large number computations in that users can easily experience large number sequences on a non-exclusive generic computing platform.
    [Show full text]