Distribution of integer partitions with large number of summands
|
|
- Johnathan Hamilton
- 6 years ago
- Views:
Transcription
1 ACTA ARITHMETICA LXXVIII4 (997 Distribution of integer partitions with large number of summands by Hsien-Kuei Hwang (Taipei Introduction Let p(n denote the number of partitions of n (into positive integers and let p(n, m denote the number of partitions of n into exactly m parts, where the summands are counted with their multiplicities For convenience, define p(0 = and p(n = 0 if n < 0 It is obvious that ( p(n, m = p(n m for n and m n/2 We shall show that this relation holds asymptotically for a wider range of m in the following sense Theorem Let c = 2/3 π and 0 < ε < If m c ( + ε n log n then the relation (2 p(n, m = p(n m( + O(n ε/2 holds uniformly in m as n An interesting consequence of the theorem is the following result Corollary If m c n log n + x n, where x, then p(n, m = p(n m( + O(e cx/2 The term c n log n is nothing but the asymptotic value of the mean number of summands in a random partition of n, each partition of n being equally likely; cf [7] Note that the number of partitions of n with m s is given by p(n m p(n m for 0 m n; and, consequently, p(n m is nothing but the number of partitions of n which have m s Thus the element plays an important rôle in the counting function p(n, m when m is larger than the mean value Our aim in this paper is to show that such a phenomenon holds for more general partitions The proof of the theorem is rather simple and relies on a method that we previously employed in [0] (for Dirichlet series for an analytic proof of a result of Nicolas [5] From the formula (2, it is obvious that our method is [35]
2 352 H- K Hwang based on explicitly isolating the contribution of the element to the counting function p(n, m This method is quite general and can be applied to other partition problems; it can be regarded as analytic version of the sieve of Eratosthenes; cf [4, Ch IV] A general theorem under a scheme due to Meinardus [3] will be derived in Section 4, which applies, in particular, to partitions into powers Finally, we further refine the analysis to establish the limiting distribution (with convergence rate for the number of summands in partitions into parts k, k = o(n /4 (log n, thus extending and improving the results by Auluck et al [2] Notation We shall use the notation [z n ]f(z to represent the coefficient of z n in the Taylor expansion of f(z The notation [u m z n ]g(u, z is then defined as [u m ]([z n ]g(u, z All limits (including O,, o and, whenever unspecified, will be taken as n The constant c always denotes 2/3π 2 The proof of Theorem Let p (2 (n, m denote the number of partitions of n into m parts, each being 2 Then p(n, m = p (2 (n j, m j 0 j m = 0 j n m = p(n m p (2 (n m + j, j j n 2m Using the inequalities (cf Lemma below j n 2m p (2 (n + j, m + j (3 p (2 (n, m p(n 2m, we obtain ( p(n, m = p(n m + O 0 j<n 2m From the well-known asymptotic relation (cf [, 4] n p (2 (n + j, m + j p(j (4 p(n = ec 4 3 n ( + O(n /2, it follows that ( ( (n me c n 2m c n m p(n, m = p(n m + O n 2m This completes the proof 3 The generality of the method Let = {λ, λ 2, } be a (finite or infinite sequence of positive integers such that λ < λ 2 < Let
3 Distribution of integer partitions 353 p (n, m = p ( (n, m denote the number of partitions of n into m parts λ j, so that p (n, mu m z n = uz λ j n,m j Similarly, we define p (ν (n, m via the generating function p (ν (n, mum z n = uz λ (ν =, 2, j n,m j ν The inequality (3 bears the following general form Lemma For all positive integers n, m and µ, p (µ (n, m [zn λ µm ] z λ j λ µ j>µ P r o o f Observe that p (µ (n, m is the number of solutions of the equations { rµ λ µ + r µ+ λ µ+ + = n, r µ + r µ+ + = m, where the r j s are non-negative integers; or, equivalently, the number of solutions of the equations { rµ+ (λ µ+ λ µ + r µ+2 (λ µ+2 λ µ + = n λ µ m, r µ+ + r µ+2 + m The lemma follows since the number of such solutions is less than or equal to the number of partitions of n λ µ m into parts λ j λ µ, j > µ Proposition For any positive integer µ, we have (5 p (n, m = ( ν S ν + R µ where ( (6 S ν = [z n λνm ] and R µ S µ j<ν ν<µ z λ ν λ j z λ ν λ j ( j>ν z λ j λ ν P r o o f (Compare [4, Thm 4] For µ =, the result reduces to Lemma We suppose µ 2 First of all, observe that p ( (n, m = 0 j m = j 0 p (2 (n λ j, m j p (2 (n λ m + λ j, j j n λ 2 m λ 2 λ, p (2 (n + λ j, m + j
4 354 H- K Hwang It is easily verified that for each N 0, j 0 By induction we obtain (6 with R µ = ( µ p (2 (N + λ j, j = [z N ] j 2 j n λ 2 m λ 2 λ j 2 n λ 3 m (λ 3 λ j j µ n λ µm (λµ λ j (λµ λ µ 2 j µ 2 λµ λ µ λ 3 λ p (µ z λ j λ (n + Applying Lemma, we deduce the required result i<µ λ i j i, m + i<µ Corollary 2 For any odd number ν and even number µ 2, S S 2 + S µ p (n, m S S S ν Obviously, R µ = 0 when µ > µ 0, where µ 0 is the largest positive integer such that n λ µ0 m 0 Corollary 3 If m > (n + λ /λ 2 then p (n, m = p (2 (n λ m, where p (2 (n = [zn ] z λ j λ j 2 The decomposition (5 is especially useful when m becomes large and µ = 2 4 An analytic scheme In this section we apply Proposition to derive a result generalizing Theorem using a Mellin transform technique, hereafter referred to as an analytic scheme, due to Meinardus [3]; cf also Andrews [, Ch 6] Concrete examples to which this result applies will be discussed in the next section Let λ < λ 2 < be a sequence of positive integers satisfying the following conditions: (M Let D(s = j λ s j The Dirichlet series D converges in the halfplane Re s > α > 0, and can be analytically continued into the half-plane Re s α 0, for some α 0 > 0 In Re s α 0, D is analytic except for a simple pole at s = α with residue A (M2 There exists an absolute constant c > 0 such that D(σ+it t c uniformly for σ α 0 as t ± (M3 Define g(τ = j e λjτ, where τ = r + iy with r > 0 and π y π There exists a positive constant ϑ < such that g(r + iy ϑg(r uniformly for r y π as r 0 + j i
5 Distribution of integer partitions 355 Condition (M3 is a condition of Haselgrove and Temperley [8] Set β := (AΓ ( + αζ( + α /(α+, where Γ denotes the Gamma function and ζ is Riemann s zeta function, and ( D(s B := lim s α Let p (2 (n be defined as in Corollary 3 A s α Theorem 2 Suppose the sequence satisfies (M (M3 If α = ( j λ j diverges, then (7 p (n, m = p (2 (n λ m( + O(n α /2 + n (λ 2 λ ε/2, uniformly for m A+ε 2β n log n, where ε > 0, α = min{, α 0 }, and (8 p (2 (n = ξnυ e 2β n ( + O(n α /2, with υ = 4 (2D( Aλ and ξ = λ e D (0+B 2 π β 3/2 D(0 Aλ On the other hand, if 0 < α < ( j λ j j 2 e λ /λ j λ /λ j converges, then (9 p (n, m = p (2 (n λ m( + O(n α /(α+ + e β(λ 2 λ ω n, uniformly for m ω n n /(α+, where ω n is any sequence of n tending to infinity, α = min{, α, α, α 0 }, and (0 p (2 (n = ηnκ e (+α βn α/(α+( + O(n α /(α+, with κ = 2D(0 4 α 2(α + and η = λ e D (0 2 π β3/2 D(0 λ /λ j j 2 Note that if α =, then β = A/6 π and 2β = c A P r o o f (sketch We first dispose of the case when m n/λ by Corollary 3 We next show that the two sequences = {λ j λ } j 2 and 2 = {λ 2 λ } {λ j λ 2 } j 3 also satisfy (M (M3 The formulae (7 (0, apart from the error terms, follow then from Meinardus s original theorem For techniques leading to the required (better error terms, see Appendix Let D (s = j 2 (λ j λ s and D 2 (s = (λ 2 λ s + j 3 (λ j λ 2 s for Re s > α Analytic continuations of these two functions in terms of D
6 356 H- K Hwang can be obtained in the usual way (cf [6] We have D (s = D(s λ s + ( s + l λ l l (D(s + l λ s l, l D 2 (s = (λ 2 λ s + D(s λ s + ( s + l λ l l 2(D(s + l λ s l λ s l 2, l the right-hand side providing the required analytic continuation for Re s α 0 Note that when 0 < α < both functions so continued have a simple pole at s = α (if α > α 0 ; and that when α = the pole at 0 is cancelled by the corresponding binomial factor s Thus and 2 satisfy (M with the number α 0 there replaced by min{ α, α 0 } when 0 < α < (and remains otherwise unaltered These representations also guarantee that condition (M2 holds for both sequences (with a possibly different c by the same property of Also from these representations, we deduce that (i if α = then D (0 = D(0 + Aλ, D 2 (0 = D(0 + Aλ 2, ( ( log λ λ j D (0 = D (0 + log λ + B j 2 (ii if 0 < α < then D (0 = D 2 (0 = D(0, D (0 = D (0 + log λ j 2 ( log λ λ j λ λ j Finally, the remaining condition (M3 is easily checked Thus, we obtain (8 and (0 Now by Proposition with µ = 2, we have where p (n, m = p (2 (n λ m + R 2, R 2 [z n λ2m ] z λ 2 λ z λ j λ 2 If α = the right-hand side is bounded above, on applying Meinardus s theorem to the sequence 2, by j 3 R 2 (n λ 2 m υ+a(λ 2 λ /2 e 2β n λ 2 m From this estimate and (8, the result (7 follows If 0 < α < then by ;
7 applying the same theorem ( α + R 2 (n λ 2 m κ exp α which together with (0 implies (9 Distribution of integer partitions 357 β(n λ 2m α/(α+, By a similar method, we derive that the expected number of summands, where each -partition of n is equally likely, is asymptotic to (cf [9] A n log n if α =, c D( β n/(α+ if 0 < α < Furthermore, from the generating function uz λ z λ = zλj j uz λ z λ, j j 2 it follows that the number of -partitions of n in which there are m λ s is given by p (n λ m, where p (n is the total number of -partitions of n (cf [3, ]: ( with p (n = [z n ] z λ j j j = ϱn σ e (+/αβnα/(α+ ( + O(n min{,α,α 0}/(α+, σ = 2D(0 2 + α 2(α + and ϱ = ed (0 β /2 D(0 2π(α + Since the error term in ( is better than that in Meinardus s original paper, a sketch of the proof is given in the Appendix 5 Applications Consider first the case when λ j = j + k, where k is a fixed integer The assumptions of Theorem 2 being easily checked with α =, we obtain ( p (n, m = p(n km( + O(n ε/2, uniformly for m c ( + ε n log n, 0 < ε <, and for each fixed k Thus removing from the set of positive integers the first k numbers does not change drastically the asymptotic behaviour of p in the specified range ( The quantities p, when written without their subscript, have Z + as their underlying set
8 358 H- K Hwang Note that in this case a direct application of Proposition using (4 is simpler Moreover, the condition that k = O( can be relaxed and we can show that p (n, m = p(n km( + O(n ε/2 e k(log n2 /(4c n, for m c ( + ε n log n and k = o(ε n(log n For examples for which A, take D(s = ( k s ζ(s, where k 3 Then our theorem applies with A = (k /k As another application of Theorem 2, consider the case when λ j = j k, where k is a fixed positive integer 2 The conditions (M (M3 being satisfied as in [8] (using estimates from Waring s problem, we obtain uniformly for p (n, m = p (2 (n m( + O(n /(k+ + e β(2k ω n, m ω n n k/(k+ with β = where ω n and ( k/(k+ Γ ( + /kζ( + /k, k with p (2 (n = γ kn (5k+/(2k+2 e (+kβn/(k+( + O(n /(k+, γ k = (2π (k+/2 ( + /k /2 β 2 j 2 j k Note that the expected number of summands is asymptotic to (cf [9] for k 2 ζ(k β nk/(k+ ( + O(n /(k+, 6 Cases of failure In this section we show by two examples that although conditions (M (M3 are rather restrictive, results similar to Theorem 2 may hold for more general partitions From the above discussions, we naturally predict for general -partitions that p (n, m [z n λm ] z λ j λ, j 2 for m in a certain range (lying to the right of the mean value, even without explicit representation of the asymptotic behaviour of the right-hand side in terms of elementary functions as in the results of the last section This is the case for, say, partitions into primes Take first λ j = k(j + h, where k 2, h < k and (h, k = Then p (n, m = 0 whenever n hm 0 (mod k Applying (5, we obtain
9 by the derivations of (2 Distribution of integer partitions 359 p (n, m = p((n hm/k( + O(n ε/2, for m +ε k c n log n and for n hm 0 (mod k, the O-term depending on k We can of course let k with n and the relation still holds provided that k = o( n Next consider the Mahler partition λ j = 2 j Let p (2 (n = [zn ] z 2j j Then by (5, we have p (n, m = p (2 (n m + R 2 where R 2 [z n 2m z ] z z = 2j 2 j 2 0 j (n /2 m p (2 (j Using standard analytic methods as in [3, 8] or the Tauberian theorems in [6, 2], we can verify that p (n, m p (2 (n m whenever (m log n/n Note that the expected number of summands in a random Mahler partition is asymptotic to (cf [8] (2 log 2n/ log n, each partition of n being assigned the same probability 7 Limiting distributions In this section we show that the above method is also suitable for deriving limiting distribution of the number of summands For simplicity we consider only the case when λ j = j+k, that is, is the set of positive integers k For further results on the limiting distribution of the number of summands in partitions, see [8, 22 25, 2, 20, 7] Let ξ n (k represent the number of summands (counted with multiplicities in a random -partition of n (ie, into parts k, each -partition of n being equally likely Auluck et al [2] showed, by a method due to Erdős and Lehner [5], that (2 Pr{ξ n ( = m} = p (n, m n /2 exp p(n ( c2 x 2c exp ( c2 x, uniformly for m = c n log n + x n, x = O( The distribution on the right-hand side is an extreme-value distribution; cf [25] We shall further refine the analysis in Section 2 to obtain the following result which is more general and precise than (2 Theorem 3 If m = c n log n + x n then (3 Pr{ξ (k n = m} = (2/ck (k! n exp ( c2 kx 2c ( exp c2 ( ( k 2 x (log n 2 + O, n
10 360 H- K Hwang uniformly for all x and for k = o(n /4 (log n Furthermore, if k, where k = o(n /4 (log n, then for (4 m = 2 n log 2 n n c ck + x2 c (x = O(, k we have ( (5 Pr{ξ n (k = m} = e x 2 /2 x 3 ( + O + k2 (log n 2, 2π σn,k k n uniformly in k, where σ n,k = 2 n/(c k Note that when k =, the result (3 may be derived from the general formulae of Szekeres [24, 25]; cf also [4] Once we have started with (5, the remaining derivations become more or less standard; thus details will be omitted P r o o f (sketch By Proposition, we have for any µ, (6 p(n, m = ( ν [z n (ν+k m ]f ν (z + R µ+, where ν µ ( f ν (z = k<ν and R µ+ [z n (µ+km ]f µ+ (z Set z k ( z k z k, k N = π 6(n (ν + k m and write z = e τ, where τ = N + iθ, θ π It can be verified that (cf [, Ch VI] (7 f ν (e τ = τ ν+3/2 e π2 /(6τ ( + O(ν 2 τ, 2π (ν! uniformly for ν = o(n /4 and θ N On the other hand, we have (8 f ν (e τ < f ν (e /N e N/20, for N < θ π This can be seen as follows Obviously, log f ν (z log f ν ( z z ( z z z Now if N < θ π then z z = e /N /2 ( ( e /N 2 + 2e /N ( cos θ 4e + π 2 (e 2, where we have used the inequalities cos θ 2θ 2 /π 2 for θ π, and
11 Distribution of integer partitions 36 x 2 e x ( e x 2 e(e 2 for 0 x Now using the inequality e /N ( e /N N/e for N, we obtain ( z z N ( ( /2 4e + z z e π 2 (e 2 > N 20, as required From the two estimates (7 and (8, we deduce, by Laplace s method, that [z n (ν+k m ]f ν (z = (2/cν (n (ν + k m (ν 3/2 4 e c n (ν+k m 3 (ν! ( ( ν 2 + O, n (ν + k m for ν = o(n /4 In view of the asymptotic formula (cf also [4] p (n = [z n ] j k z j ( k (k! c = 4 n (k+/2 e c n ( + O(k 2 n /2 (k = o(n /4, 3 2 obtained by applying, say, the saddle-point method, we have (9 p (n [z n (ν+k m ]f ν (z (k!(ν! n(ν+k 2/2 e c(ν+k m/(2 n ( k 2 + ν 2 = (2/cν+k 2 ( + O n + ν(ν + km n + (ν + k2 m 2 n 3/2 Thus for m = c n log n + x n and k = o(n /4 (log n, we obtain p (n [z n (ν+k m ]f ν (z = (2/cν+k 2 e c(ν+k x/2 (k! (ν! n ( ( ν 2 + k 2 + O (log n 2 n From this relation and (6, (3 follows (by choosing a sufficiently large µ in (6 Similarly, substituting (4 into (9, we deduce (5 The theorem is comparable with the results of Fristedt [7] for the limiting distribution of the size of the kth largest summand (Y k, in his notation in a random partition of n (integers Actually, the two quantities have, by conjugacy, the same distribution Although his range of validity of (5 for k is slightly larger than ours (k = o(n /4, our local limit theorems (3 and (5 are stronger than his global limit theorems (without convergence rates
12 362 H- K Hwang then We can rewrite the formula (3 in a different form as follows If m = 2 n c Pr{ξ (k n = m} = ck a gamma distribution log 2 n cy, y > 0, 2 n yk e y k! ( ( k 2 (log n 2 + O, n 8 Concluding remarks One may extend Theorem 3 to general partitions under Meinardus s (or other scheme, the result obtained being comparable to those in [8, 2, 20] One may also consider the case of repeated λ j, that is, the sequence satisfies λ λ 2, the computations involved being more complicated The method used here is also suitable for the quantities studied by Szalay and Turán in [22, 23] The generating functions there are of the forms ( j<k z j ( j k uz j and ( j k uz j ( j>k z j where k It should be mentioned, as emphasized in [9], that if the multiplicity of each summand is counted only once, or if each part is allowed to appear at most once, then the limiting distributions of the number of summands are Gaussian for a large class of partitions For more quantitative results, see [9] General combinatorial inequalities for p (n, m are developed in [], which are especially useful for partitions with a small number of summands Appendix In this appendix, we sketch the proof of (; details can be found in [9] In Meinardus s original paper, the error term for p (n in ( is of the form O(n κ, where (cf [3, ] κ = α α + min δ being an arbitrary positive number Set { min{, α0 } δ α 4, }, 2 δ F (z = j ( z λ j Write z = e τ = e r iy, where r > 0 and π y π By Mellin transform (cf [3, ], we have (20 F (e τ = e D (0 τ D(0 e AΓ (αζ(α+τ α ( + O( τ α,,
13 Distribution of integer partitions 363 uniformly for y r, as r 0 +, where α = min{, α 0 } On the other hand, by our assumption (M3, we deduce that (2 F (e r iy F (e r e c 2r α (c 2 > 0, uniformly for r y π From the estimate (20, it follows that (22 F (e r iy F (e r e c 3r α/7 (c 3 > 0, uniformly for r +3α/7 y r, as r 0 + Choose now ( /(α+ AαΓ (αζ(α + (23 r = n By Cauchy s formula using (20 (23, we have (24 p (n = I + I 2 + O(F (e r e nr c 4n α/(7α+7, where I = ed (0+nr 2π and (25 r D(0 \ I 2 r D(0+α e nr \ t r 3α/7 ( + it D(0 e inrt+aγ (αζ(α+r t r 3α/7 + it D(0 e AΓ (αζ(α+r r D(0+α +α/2 e nr+aγ (αζ(α+r α, where we used the inequalities α (+it α dt, α Re(+it α dt Re( + it α ( + t 2 α/2 ( 2 α/2 t 2 for t For I, setting b = α(α + AΓ (αζ(α + and making the change of variables v 2 = b 2 r α t 2, we obtain where I = ed (0+nr+AΓ (αζ(α+r α 2πb r D(0+α/2 α/7 br \ br α/7 e v 2 /2 T r (v dv, T r (v = + (α + 2v2 6D(0 r α/2 iv + O((v 6 + v 2 r α, 6b from which we deduce that (26 I = ed (0+nr+AΓ (αζ(α+r α 2π b r D(0+α/2 ( + O(r α Thus ( follows from (23 (26
14 364 H- K Hwang References [] G E Andrews, The Theory of Partitions, Encyclopedia Math Appl 2, Addison- Wesley, 976 [2] F C Auluck, S Chowla and H Gupta, On the maximum value of the number of partitions of n into k parts, J Indian Math Soc 6 (942, 05 2 [3] N G de Bruijn, On Mahler s partition problem, Indag Math 0 (948, [4] J Dixmier et J-L Nicolas, Partitions sans petits sommants, in: A Tribute to Paul Erdős, A Baker, B Bollobás and A Hajnal (eds, Cambridge University Press, 990, [5] P Erdős and J Lehner, The distribution of the number of summands in the partitions of a positive integer, Duke Math J 8 (94, [6] P Flajolet, X Gourdon and P Dumas, Mellin transforms and asymptotics: harmonic sums, Theoret Comput Sci 44 (995, 3 58 [7] B Fristedt, The structure of random partitions of large integers, Trans Amer Math Soc 337 (993, [8] C B Haselgrove and H N V Temperley, Asymptotic formulae in the theory of partitions, Proc Cambridge Philos Soc 50 (954, [9] H-K Hwang, Limit theorems for the number of summands in integer partitions, submitted [0], Sur la répartition des valeurs des fonctions arithmétiques, I Le nombre de facteurs premiers d un entier, submitted [] H-K Hwang and Y-N Yeh, Distribution of integer partitions with a small number of summands, in preparation [2] D V L e e, The asymptotic distribution of the number of summands in unrestricted -partitions, Acta Arith 65 (993, [3] G Meinardus, Asymptotische Aussagen über Partitionen, Math Z 59 (954, [4] W Narkiewicz, Number Theory, World Scientific, Singapore, 983 (translated by S Kanemitsu [5] J-L Nicolas, Sur la distribution des nombres ayant une quantité fixée de facteurs premiers, Acta Arith 44 (984, [6] W B Pennington, On Mahler s partition problem, Ann of Math 57 (953, [7] L B Richmond, The moments of partitions, I, Acta Arith 26 (975, [8], Mahler s partition problem, Ars Combin 2 (976, [9], The moments of partitions, II, Acta Arith 28 (975, [20], Some general problems on the number of parts in partitions, ibid 66 (994, [2] W S c h w a r z, Einige Anwendungen Tauberscher Sätze in der Zahlentheorie C Mahler s Partitionsproblem, J Reine Angew Math 228 (967, [22] M Szalay and P Turán, On some problems of the statistical theory of partitions with application to characters of the symmetric group I, Acta Math Acad Sci Hungar 29 (977, [23],, On some problems of the statistical theory of partitions with application to characters of the symmetric group II, ibid,
15 Distribution of integer partitions 365 [24] G Szekeres, Some asymptotic formulae in the theory of partitions II, Quart J Math Oxford 4 (953, 96 [25], Asymptotic distribution of partitions by number and size of parts, in: Number Theory, Colloq Math Soc János Bolyai 5, North-Holland, 987, Institute of Statistical Science Academia Sinica Taipei 5, Taiwan hkhwang@statsinicaedutw Received on and in revised form on (2952
Arithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationPROOF OF THE ALDER-ANDREWS CONJECTURE
PROOF OF THE ALDER-ANDREWS CONJECTURE CLAUDIA ALFES MARIE JAMESON AND ROBERT J LEMKE OLIVER Abstract Motivated by classical identities of Euler Schur Rogers Ramanujan Alder investigated q d n Q d n the
More informationTHE ORDER OF ELEMENTS IN SYLOW p-subgroups OF THE SYMMETRIC GROUP
THE ORDER OF ELEMENTS IN SYLOW p-subgroups OF THE SYMMETRIC GROUP JAN-CHRISTOPH SCHLAGE-PUCHTA Abstract. Define a random variable ξ n by choosing a conjugacy class C of the Sylow p-subgroup of S p n by
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 {jdixon,daniel}@math.carleton.ca
More informationZeros of the Riemann Zeta-Function on the Critical Line
Zeros of the Riemann Zeta-Function on the Critical Line D.R. Heath-Brown Magdalen College, Oxford It was shown by Selberg [3] that the Riemann Zeta-function has at least c log zeros on the critical line
More informationBounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers
3 47 6 3 Journal of Integer Seuences, Vol. (7), rticle 7..3 ounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers Roger Woodford Department of Mathematics University
More informationTHE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION. Aleksandar Ivić
THE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION Aleksandar Ivić Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. (2), 4 48. Abstract. The Laplace transform of ζ( 2 +ix) 4 is investigated,
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationTHE EXPONENTIAL DISTRIBUTION ANALOG OF THE GRUBBS WEAVER METHOD
THE EXPONENTIAL DISTRIBUTION ANALOG OF THE GRUBBS WEAVER METHOD ANDREW V. SILLS AND CHARLES W. CHAMP Abstract. In Grubbs and Weaver (1947), the authors suggest a minimumvariance unbiased estimator for
More informationA POLYNOMIAL VARIATION OF MEINARDUS THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Page00 000 S 0002-9939XX0000-0 A POLYNOMIAL VARIATION OF MEINARDUS THEOREM DANIEL PARRY Abstract. We develop a polynomial analogue
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationSome remarks on the Erdős Turán conjecture
ACTA ARITHMETICA LXIII.4 (1993) Some remarks on the Erdős Turán conjecture by Martin Helm (Mainz) Notation. In additive number theory an increasing sequence of natural numbers is called an asymptotic basis
More informationOn Gauss sums and the evaluation of Stechkin s constant
On Gauss sums and the evaluation of Stechkin s constant William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Igor E. Shparlinski Department of Pure
More informationPacking Ferrers Shapes
Packing Ferrers Shapes Noga Alon Miklós Bóna Joel Spencer February 22, 2002 Abstract Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n p(n) rectangle using
More informationSOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1<j<co be
SOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1
More informationSplitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field.
Splitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field. Eric Schmutz Mathematics Department, Drexel University,Philadelphia, Pennsylvania, 19104. Abstract Let M n be
More informationOn the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences
On the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences J. C. Lagarias A.. Odlyzko J. B. Shearer* AT&T Labs - Research urray Hill, NJ 07974 1. Introduction
More informationExact exponent in the remainder term of Gelfond s digit theorem in the binary case
ACTA ARITHMETICA 136.1 (2009) Exact exponent in the remainder term of Gelfond s digit theorem in the binary case by Vladimir Shevelev (Beer-Sheva) 1. Introduction. For integers m > 1 and a [0, m 1], define
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 informationPARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES
PARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES KEN ONO, ROBERT SCHNEIDER, AND IAN WAGNER In celebration of Krishnaswami Alladi s 60th birthday Abstract If gcd(r, t) = 1, then a theorem of Alladi
More informationSome elementary explicit bounds for two mollifications of the Moebius function
Some elementary explicit bounds for two mollifications of the Moebius function O. Ramaré August 22, 213 Abstract We prove that the sum { /d 1+ε is bounded by, uniformly in x 1, r and ε >. We prove a similar
More informationThe Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(2k)
The Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(k) Cezar Lupu 1 1 Department of Mathematics University of Pittsburgh Pittsburgh, PA, USA Algebra,
More informationPolyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH
Polyexponentials Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH 45810 k-boyadzhiev@onu.edu 1. Introduction. The polylogarithmic function [15] (1.1) and the more general
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationarxiv:math/ v1 [math.nt] 27 Feb 2004
arxiv:math/0402458v1 [math.nt] 27 Feb 2004 On simultaneous binary expansions of n and n 2 Giuseppe Melfi Université de Neuchâtel Groupe de Statistique Espace de l Europe 4, CH 2002 Neuchâtel, Switzerland
More informationPermutations with Inversions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 4 2001, Article 01.2.4 Permutations with Inversions Barbara H. Margolius Cleveland State University Cleveland, Ohio 44115 Email address: b.margolius@csuohio.edu
More informationOn prime factors of integers which are sums or shifted products. by C.L. Stewart (Waterloo)
On prime factors of integers which are sums or shifted products by C.L. Stewart (Waterloo) Abstract Let N be a positive integer and let A and B be subsets of {1,..., N}. In this article we discuss estimates
More informationDisjoint Subgraphs in Sparse Graphs 1
Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk
More informationSquares in products with terms in an arithmetic progression
ACTA ARITHMETICA LXXXVI. (998) Squares in products with terms in an arithmetic progression by N. Saradha (Mumbai). Introduction. Let d, k 2, l 2, n, y be integers with gcd(n, d) =. Erdős [4] and Rigge
More informationON MORDELL-TORNHEIM AND OTHER MULTIPLE ZETA-FUNCTIONS. (m + n) s 3. n s 2
ON MORDELL-TORNHEIM AND OTHER MULTIPLE ZETA-FUNCTIONS KOHJI MATSUMOTO. Introduction In 950, Tornheim [4] introduced the double series m s n s 2 (m + n) s 3 (.) m= n= of three variables, and studied its
More informationPATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1.
Problem Sheet 3. From Theorem 3. we have ζ (s) = + s s {u} u+sdu, (45) valid for Res > 0. i) Deduce that for Res >. [u] ζ (s) = s u +sdu ote the integral contains [u] in place of {u}. ii) Deduce that for
More informationOn rational approximation of algebraic functions. Julius Borcea. Rikard Bøgvad & Boris Shapiro
On rational approximation of algebraic functions http://arxiv.org/abs/math.ca/0409353 Julius Borcea joint work with Rikard Bøgvad & Boris Shapiro 1. Padé approximation: short overview 2. A scheme of rational
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationIntegers without large prime factors in short intervals and arithmetic progressions
ACTA ARITHMETICA XCI.3 (1999 Integers without large prime factors in short intervals and arithmetic progressions by Glyn Harman (Cardiff 1. Introduction. Let Ψ(x, u denote the number of integers up to
More informationThe zeros of the derivative of the Riemann zeta function near the critical line
arxiv:math/07076v [mathnt] 5 Jan 007 The zeros of the derivative of the Riemann zeta function near the critical line Haseo Ki Department of Mathematics, Yonsei University, Seoul 0 749, Korea haseoyonseiackr
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationOn a combinatorial method for counting smooth numbers in sets of integers
On a combinatorial method for counting smooth numbers in sets of integers Ernie Croot February 2, 2007 Abstract In this paper we develop a method for determining the number of integers without large prime
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
More informationRational approximations to π and some other numbers
ACTA ARITHMETICA LXIII.4 (993) Rational approximations to π and some other numbers by Masayoshi Hata (Kyoto). Introduction. In 953 K. Mahler [2] gave a lower bound for rational approximations to π by showing
More informationStudy of some equivalence classes of primes
Notes on Number Theory and Discrete Mathematics Print ISSN 3-532, Online ISSN 2367-8275 Vol 23, 27, No 2, 2 29 Study of some equivalence classes of primes Sadani Idir Department of Mathematics University
More informationTHE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5
THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 JEREMY LOVEJOY Abstract. We establish a relationship between the factorization of n+1 and the 5-divisibility of Q(n, where Q(n is the number
More informationSolving a linear equation in a set of integers II
ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.
More informationOn an identity of Gessel and Stanton and the new little Göllnitz identities
On an identity of Gessel and Stanton and the new little Göllnitz identities Carla D. Savage Dept. of Computer Science N. C. State University, Box 8206 Raleigh, NC 27695, USA savage@csc.ncsu.edu Andrew
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationON CLASSES OF EVERYWHERE DIVERGENT POWER SERIES
ON CLASSES OF EVERYWHERE DIVERGENT POWER SERIES G. A. KARAGULYAN Abstract. We prove the everywhere divergence of series a n e iρn e inx, and 1 [ρn] a n cos nx, for sequences a n and ρ n satisfying some
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 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 informationGoldbach and twin prime conjectures implied by strong Goldbach number sequence
Goldbach and twin prime conjectures implied by strong Goldbach number sequence Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this note, we present a new and direct approach to prove the Goldbach
More informationRiemann s explicit formula
Garrett 09-09-20 Continuing to review the simple case (haha!) of number theor over Z: Another example of the possibl-suprising application of othe things to number theor. Riemann s explicit formula More
More informationThe Asymptotic Expansion of a Generalised Mathieu Series
Applied Mathematical Sciences, Vol. 7, 013, no. 15, 609-616 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.013.3949 The Asymptotic Expansion of a Generalised Mathieu Series R. B. Paris School
More informationMath 259: Introduction to Analytic Number Theory How small can disc(k) be for a number field K of degree n = r 1 + 2r 2?
Math 59: Introduction to Analytic Number Theory How small can disck be for a number field K of degree n = r + r? Let K be a number field of degree n = r + r, where as usual r and r are respectively the
More 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 informationEXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS
Annales Univ. Sci. Budapest. Sect. Comp. 48 018 5 3 EXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS Sergey Varbanets Odessa Ukraine Communicated by Imre Kátai Received February
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
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 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 informationHardy type asymptotics for cosine series in several variables with decreasing power-like coefficients Victor Kozyakin
International Journal of Advanced Research in Mathematics Submitted: 06-03-8 ISSN: 97-63, Vol. 5, pp 35-5 Revised: 06-04-5 doi:0.805/www.scipress.com/ijarm.5.35 Accepted: 06-05-3 06 SciPress Ltd., Switzerland
More informationARITHMETIC PROGRESSIONS IN SPARSE SUMSETS. Dedicated to Ron Graham on the occasion of his 70 th birthday
ARITHMETIC PROGRESSIONS IN SPARSE SUMSETS Dedicated to Ron Graham on the occasion of his 70 th birthday Ernie Croot 1 School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 Imre Ruzsa
More informationSubset sums modulo a prime
ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by
More informationIrrationality of the Sums of Zeta Values
Mathematical Notes, vol. 79, no. 4, 2006, pp. 561 571. Translated from Matematicheskie Zametki, vol. 79, no. 4, 2006, pp. 607 618. Original Russian Text Copyright c 2006 by T. Hessami Pilehrood, Kh. Hessami
More informationSingular Overpartitions
Singular Overpartitions George E. Andrews Dedicated to the memory of Paul Bateman and Heini Halberstam. Abstract The object in this paper is to present a general theorem for overpartitions analogous to
More informationON THE FRACTIONAL PARTS OF LACUNARY SEQUENCES
MATH. SCAND. 99 (2006), 136 146 ON THE FRACTIONAL PARTS OF LACUNARY SEQUENCES ARTŪRAS DUBICKAS Abstract In this paper, we prove that if t 0,t 1,t 2,... is a lacunary sequence, namely, t n+1 /t n 1 + r
More informationIrrationality exponent and rational approximations with prescribed growth
Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing
More informationarxiv: v2 [math.nt] 4 Nov 2012
INVERSE ERDŐS-FUCHS THEOREM FOR k-fold SUMSETS arxiv:12093233v2 [mathnt] 4 Nov 2012 LI-XIA DAI AND HAO PAN Abstract We generalize a result of Ruzsa on the inverse Erdős-Fuchs theorem for k-fold sumsets
More informationOn the Number of Divisors of n 2 1
On the Number of Divisors of n 2 arxiv:507.08893v [math.nt] 30 Jul 205 Adrian W. Dudek Mathematical Sciences Institute The Australian National University adrian.dudek@anu.edu.au Abstract We prove an asymptotic
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationarxiv: v2 [math.co] 9 May 2017
Partition-theoretic formulas for arithmetic densities Ken Ono, Robert Schneider, and Ian Wagner arxiv:1704.06636v2 [math.co] 9 May 2017 In celebration of Krishnaswami Alladi s 60th birthday. Abstract If
More informationTHE SUM OF DIGITS OF n AND n 2
THE SUM OF DIGITS OF n AND n 2 KEVIN G. HARE, SHANTA LAISHRAM, AND THOMAS STOLL Abstract. Let s q (n) denote the sum of the digits in the q-ary expansion of an integer n. In 2005, Melfi examined the structure
More informationUniform convergence of N-dimensional Walsh Fourier series
STUDIA MATHEMATICA 68 2005 Uniform convergence of N-dimensional Walsh Fourier series by U. Goginava Tbilisi Abstract. We establish conditions on the partial moduli of continuity which guarantee uniform
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationAn Elementary Proof that any Natural Number can be Written as the Sum of Three Terms of the Sequence n2
1 47 6 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.6 An Elementary Proof that any Natural Number can be Written as the Sum of Three Terms of the Sequence n Bakir Farhi Department of Mathematics
More informationThe Truncated Pentagonal Number Theorem
The Truncated Pentagonal Number Theorem George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 16802 USA Mircea Merca Doctoral School in Applied Mathematics University
More informationOn the second smallest prime non-residue
On the second smallest prime non-residue Kevin J. McGown 1 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093 Abstract Let χ be a non-principal Dirichlet
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 number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
More informationDirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007
Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
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 informationAN ANALOG OF THE HARMONIC NUMBERS OVER THE SQUAREFREE INTEGERS
AN ANALOG OF THE HARMONIC NUMBERS OVER THE SQUAREFREE INTEGERS DICK BOLAND Abstract. A nice, short result establishing an asymptotic equivalent of the harmonic numbers, H n, in terms of the reciprocals
More informationReciprocity formulae for general Dedekind Rademacher sums
ACTA ARITHMETICA LXXIII4 1995 Reciprocity formulae for general Dedekind Rademacher sums by R R Hall York, J C Wilson York and D Zagier Bonn 1 Introduction Let B 1 x = { x [x] 1/2 x R \ Z, 0 x Z If b and
More informationDIGITAL EXPANSION OF EXPONENTIAL SEQUENCES
DIGITAL EXPASIO OF EXPOETIAL SEQUECES MICHAEL FUCHS Abstract. We consider the q-ary digital expansion of the first terms of an exponential sequence a n. Using a result due to Kiss und Tichy [8], we prove
More informationWeierstrass and Hadamard products
August 9, 3 Weierstrass and Hadamard products Paul Garrett garrett@mat.umn.edu ttp://www.mat.umn.edu/ garrett/ [Tis document is ttp://www.mat.umn.edu/ garrett/m/mfms/notes 3-4/b Hadamard products.pdf].
More informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
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 informationOn p-blocks of symmetric and alternating groups with all irreducible Brauer characters of prime power degree. Christine Bessenrodt
On p-blocks of symmetric and alternating groups with all irreducible Brauer characters of prime power degree Christine Bessenrodt Institut für Algebra, Zahlentheorie und Diskrete Mathematik Leibniz Universität
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 informationTHE ZERO-DISTRIBUTION AND THE ASYMPTOTIC BEHAVIOR OF A FOURIER INTEGRAL. Haseo Ki and Young One Kim
THE ZERO-DISTRIBUTION AND THE ASYMPTOTIC BEHAVIOR OF A FOURIER INTEGRAL Haseo Ki Young One Kim Abstract. The zero-distribution of the Fourier integral Q(u)eP (u)+izu du, where P is a polynomial with leading
More informationON PARTITION FUNCTIONS OF ANDREWS AND STANLEY
ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY AE JA YEE Abstract. G. E. Andrews has established a refinement of the generating function for partitions π according to the numbers O(π) and O(π ) of odd parts
More informationSOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE
SOME PÓLYA-TYPE IRREDUCIBILITY CRITERIA FOR MULTIVARIATE POLYNOMIALS NICOLAE CIPRIAN BONCIOCAT, YANN BUGEAUD, MIHAI CIPU, AND MAURICE MIGNOTTE Abstract. We provide irreducibility criteria for multivariate
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
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 informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationPARITY OF THE PARTITION FUNCTION. (Communicated by Don Zagier)
ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 1, Issue 1, 1995 PARITY OF THE PARTITION FUNCTION KEN ONO (Communicated by Don Zagier) Abstract. Let p(n) denote the number
More informationON A SINE POLYNOMIAL OF TURÁN
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 48, Number 1, 18 ON A SINE POLYNOMIAL OF TURÁN HORST ALZER AND MAN KAM KWONG ABSTRACT. In 1935, Turán proved that ( n + a j ) S n,a() = sin(j) >, n j n, a N,
More information