Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
A support for Andy's (P.Walker's) slog-matrix-method
#1
Hi -

in a selfstudy of the possibility of defining a "bernoulli-polynomial"-like solution for the problem of summing of like powers of logarithms and its generalizations to arbitrary lower and upper summation-bounds a and b I tried the method of indefinite summation. There I had to find an infinite-sized matrix-reciprocal (inverse) in the same spirit as the matrix-reciprocal which occurs in the slog-ansatz of Andy Robbins(also used earlier by P.Walker).

Interestingly the matrix-reciprocal, which can be defined in the same way, gives not only meaningfully approximated values. That would be nice enough, but we might not be able to check, whether the computed values are always true approximations to the expected values. Actually we get even more: we seem to get exactly the coefficients of the most meaningful closed-form-function for this sums-of-like-powers-problem, namely involving the lngamma-function.

This occurence of the lngamma here is interesting in twofold manner:

a) it supports Andy's/P.Walker's matrix-ansatz for the solution of the tetration/slog

b) it supports the meaningfulness of the choice of the L. Euler's gamma-definition for the interpolation of the factorial besides of the criterion of log convexity (maybe this has then a similar effect for the solution of tetration).

I began to write a small article about that for my "mathematical miniatures" website, but am a bit distracted currently by my teaching duties and my weak health, and do not know when I'll have time to polish it up fully for presentation. However I thought it might already be useful/interesting to be accessible here in the current state; I think it should be readable, be selfcontained enough and understandable so far. If not, I'd like to answer/elaborate on specific questions.

I uploaded the *.pdf to this forum, see attachment


Gottfried

P.s.: this is very near to that first-time observation in the thread http://math.eretrandre.org/tetrationforu...hp?tid=632 where I used that slog-matrix-computation rather as a curiosity, where here I'm focusing specifically on it.


.pdf   BernoulliForLogSums.pdf (Size: 123.46 KB / Downloads: 751)
Gottfried Helms, Kassel
Reply
#2
Hey, Gottfried very interesting.

I have too done indefinite summation excessively. I wrote a paper in my second year of undergrad. To summarize, I'll give the formula for indefinite summation as I wrote it.

If



Then the indefinite sum,



Can be given by the formula, for Euler's Gamma function ,



If you're curious I can write a quick write-up. It's largely a simple consequence of Ramanujan's Master Theorem. I would link the original paper but, it has much to be desired from. It was one of the first papers I ever wrote so it's a tad hand-wavey.

This function will be unique, so if your bernoulli sum satisfies,



Then it is equivalent to when taking .

Not too sure if this helps at all; but exponentially bounded indefinite sums are very simple to construct (largely due to Ramanujan, I just made a few short-cuts in his construction).
Reply
#3
Hi James - nice to see some consideration of this. As the time goes I'm a bit exhausted on this thing, but I'd like to see your "tad" paper. Have you seen the discussion in MSE where I had some questions which were answered nicely?
See https://math.stackexchange.com/questions...-summation

Perhaps it would be a nice thing to polish the essay a bit with help of your expertise?   

Gottfried
Gottfried Helms, Kassel
Reply
#4
A small remark

sums and integrals are related.

much has already been said about the " continu sum ".

but one idea not mentioned often is if and how

csum A(i) is related to csum B(i), where A and B are functional inverses of eachother ?

We know how the analogue works for integrals.

regards

tommy1729
Reply
#5
Actually the paper isn't as bad as I remember, lol. Here's a link: https://arxiv.org/pdf/1503.06211.pdf

I do take for granted that the reader knows what Ramanujan's Master Theorem is. The version I use is, if,



Which is nothing more than a slightly tweaked version of Ramanujan's Master Theorem. I choose to write this using fractional calculus, where if,

Reply


Possibly Related Threads...
Thread Author Replies Views Last Post
  A different approach to the base-change method JmsNxn 0 238 03/17/2021, 11:15 PM
Last Post: JmsNxn
  Sat March 6th second Tetration mtg; Peter Walker's 1991 paper sheldonison 13 1,833 03/07/2021, 08:30 PM
Last Post: JmsNxn
  Doubts on the domains of Nixon's method. MphLee 1 411 03/02/2021, 10:43 PM
Last Post: JmsNxn
  My interpolation method [2020] tommy1729 1 1,966 02/20/2020, 08:40 PM
Last Post: tommy1729
  Kneser method question tommy1729 9 7,518 02/11/2020, 01:26 AM
Last Post: sheldonison
  Half-iterates and periodic stuff , my mod method [2019] tommy1729 0 1,622 09/09/2019, 10:55 PM
Last Post: tommy1729
  2 fixpoints , 1 period --> method of iteration series tommy1729 0 2,872 12/21/2016, 01:27 PM
Last Post: tommy1729
  Tommy's matrix method for superlogarithm. tommy1729 0 2,865 05/07/2016, 12:28 PM
Last Post: tommy1729
  IOS 9.3 does not support Latex ?!? tommy1729 0 2,225 03/27/2016, 06:26 PM
Last Post: tommy1729
  [split] Understanding Kneser Riemann method andydude 7 13,347 01/13/2016, 10:58 PM
Last Post: sheldonison



Users browsing this thread: 1 Guest(s)