Let $G$ be a finite simple non-complete connected graph on $[n] = \{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter ...

In [Ramanujan J. 52 (2020), 275-290], Romik considered the Taylor expansion of Jacobi's theta function $\theta_3(q)$ at $q=e^{-\pi}$ and encoded it in an integer sequence $(d(n))_{n\ge0}$ for which he provided a recursive ...

We prove a version of Jordan's classification theorem for finite subgroups of $\mathrm{GL}_{n}(K)$ that is at the same time quantitatively explicit, CFSG-free, and valid for arbitrary $K$. This is the first proof to satisfy ...