gsoc 2021 introduction + Big Ell problem details

[Madhav Wagle]

Hi everyone,

I am Madhav Wagle. I am an incoming masters student in the CS department at UCSD with an interest in cs theory.  I have contributed to Sage's graph theory modules previously.

I am interested in contributing to the Big Ell project. 

As far as I understand,

given f(n) ≤ c g(n)​​, for n ≥ n_{0} and some c​

We need a structure Ell(g(n)) that tracks g(n), c and n_{0}​

as opposed to O(g(n)) which only tracks g(n)

The problem description mentions "Asymptotic Methods in Analysis" by N. G. de Brujin but there is no open/free copy of the text. Is there some reference text or implementation where I can get more detail on the expected behavior of this Notation? 

Also would a CS theoretic understanding of the Big Oh notation be sufficient or some serious analysis background is also needed for this project?

Thanks,

Madhav