This calculator computes the value of the "chapter" functions listed below. Computation will stop after 60 seconds. Use the notebook for longer computations.
$G$ is a Group. Ex: 4 is $\mathbb{Z}_4$ and 2x4 is $\mathbb{Z}_2\times\mathbb{Z}_4$.
The $\nu$ function is defined so that $\nu_\Lambda(G, m, H)$ is the largest size of $H_\Lambda A,$ where $|A| = m.$ In other words, $\nu(G, m, h)$ is the largest the $H$-fold sumset of a size $m$ subset of $G$ can be.
Note that we have a relation (see Proposition A.9)
The phi function is defined so that $\phi_\Lambda(G,H)$ is the minimum size of a spanning set of $G$. A spanning set is a set $A$ so that the $H$-fold sumset of $A$ is the entire group $G$.
The $\sigma$ function is defined so that $\sigma_\Lambda(G,H)$ is the maximum size of a sidon set of $G$. A sidon set is defined precisely in Chapter C of Bela's book.
The $\rho$ function is defined so that $\rho_\Lambda(G, m, H)$ is the smallest size of $H_\Lambda A$, where $|A| = m$. In other words, $\rho_\Lambda(G, m, H)$ is the smallest the $H$-fold $\Lambda$ sumset of a size $m$ subset of $G$ can be.
The $\chi$ function is defined so that $\chi_\Lambda(G, H)$ is the smallest $m$ for which every $m$ size subset of $G$ spans $G$.
The $\tau$ function is defined so that $\tau_\Lambda(G, H)$ is the maximum size of a zero-$H$-free sumset. In other words, it's the largest size of a set $A$ such that $HA$ does not contain 0.
The $\mu$ function is defined so that $\mu_\Lambda(G, \{k, l\})$ is the maximum size of a set $A$ such that $k_\Lambda A$ is disjoint from $l_\Lambda A$.