I took the liberty of creating the upper-bounds tag, and of retagging the linked upper-bonds question.

Given $\gamma \in [0, 1)$, an integer $N \ge 2$, and a decreasing null sequence of positive numbers $e_1,e_2,\ldots,e_t,\ldots$, I'm interested in estimating the sum $S_N := \sum_{t=1}^N\gamma^t e_{N-t}$. Question What is a good upper bound for $S_N$ for large $N$ ? Observations Empirically, ...

Let $a,b \in (0, 1)$ and $N \ge 1$, and consider the incomplete gamma function $x \mapsto \Gamma(1-a,x)$. Question Is there a simple bound (involving 'simple function's) for the expression $\Gamma(1-b,\log(a))-\Gamma(1-b,N\log(a))$ ? Motivation Ultimately, I'm interesting in bounding the sum ...

Recently I dug up some biographical details of Lindsay Burch, of Hilbert-Burch Theorem fame, whose few papers have had quite an impact on commutative algebra. This made me curious about the first women who obtained PhDs in abstract algebra in the US and Britain. Question 1: Who was the first wom...