Displaying 61 – 80 of 87

Showing per page

Existence and reduction of generalized Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi polynomials

Luis M. Navas, Francisco J. Ruiz, Juan L. Varona (2019)

Archivum Mathematicum

One can find in the mathematical literature many recent papers studying the generalized Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi polynomials, defined by means of generating functions. In this article we clarify the range of parameters in which these definitions are valid and when they provide essentially different families of polynomials. In particular, we show that, up to multiplicative constants, it is enough to take as the “main family” those given by 2 λ e t + 1 α e x t = n = 0 n ( α ) ( x ; λ ) t n n ! , λ { - 1 } , and as an “exceptional family”...

Expansion in S L d ( 𝒪 K / I ) , I square-free

Péter P. Varjú (2012)

Journal of the European Mathematical Society

Let S be a fixed symmetric finite subset of S L d ( 𝒪 K ) that generates a Zariski dense subgroup of S L d ( 𝒪 K ) when we consider it as an algebraic group over m a t h b b Q by restriction of scalars. We prove that the Cayley graphs of S L d ( 𝒪 K / I ) with respect to the projections of S is an expander family if I ranges over square-free ideals of 𝒪 K if d = 2 and K is an arbitrary numberfield, or if d = 3 and K = .

Expansions of binary recurrences in the additive base formed by the number of divisors of the factorial

Florian Luca, Augustine O. Munagi (2014)

Colloquium Mathematicae

We note that every positive integer N has a representation as a sum of distinct members of the sequence d ( n ! ) n 1 , where d(m) is the number of divisors of m. When N is a member of a binary recurrence u = u n 1 satisfying some mild technical conditions, we show that the number of such summands tends to infinity with n at a rate of at least c₁logn/loglogn for some positive constant c₁. We also compute all the Fibonacci numbers of the form d(m!) and d(m₁!) + d(m₂)! for some positive integers m,m₁,m₂.

Explicit algebraic dependence formulae for infinite products related with Fibonacci and Lucas numbers

Hajime Kaneko, Takeshi Kurosawa, Yohei Tachiya, Taka-aki Tanaka (2015)

Acta Arithmetica

Let d ≥ 2 be an integer. In 2010, the second, third, and fourth authors gave necessary and sufficient conditions for the infinite products k = 1 U d k - a i ( 1 + ( a i ) / ( U d k ) ) (i=1,...,m) or k = 1 V d k - a i ( 1 + ( a i ) ( V d k ) (i=1,...,m) to be algebraically dependent, where a i are non-zero integers and U n and V n are generalized Fibonacci numbers and Lucas numbers, respectively. The purpose of this paper is to relax the condition on the non-zero integers a 1 , . . . , a m to non-zero real algebraic numbers, which gives new cases where the infinite products above are algebraically dependent....

Explicit formulas for the constituent matrices. Application to the matrix functions

R. Ben Taher, M. Rachidi (2015)

Special Matrices

We present a constructive procedure for establishing explicit formulas of the constituents matrices. Our approach is based on the tools and techniques from the theory of generalized Fibonacci sequences. Some connections with other results are supplied. Furthermore,we manage to provide tractable expressions for the matrix functions, and for illustration purposes we establish compact formulas for both the matrix logarithm and the matrix pth root. Some examples are also provided.

Exponential generating function of hyperharmonic numbers indexed by arithmetic progressions

István Mező (2013)

Open Mathematics

There is a circle of problems concerning the exponential generating function of harmonic numbers. The main results come from Cvijovic, Dattoli, Gosper and Srivastava. In this paper, we extend some of them. Namely, we give the exponential generating function of hyperharmonic numbers indexed by arithmetic progressions; in the sum several combinatorial numbers (like Stirling and Bell numbers) and the hypergeometric function appear.

Exponential Sums with Farey Fractions

Igor E. Shparlinski (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

For positive integers m and N, we estimate the rational exponential sums with denominator m over the reductions modulo m of elements of the set ℱ(N) = {s/r : r,s ∈ ℤ, gcd(r,s) = 1, N ≥ r > s ≥ 1} of Farey fractions of order N (only fractions s/r with gcd(r,m) = 1 are considered).

Currently displaying 61 – 80 of 87