The smallest bioreactor

Selecting the Smallest Extreme Value Population with the Smallest Variance

The Generalized Smallest Grammar Problem The Generalized Smallest Grammar Problem

The Smallest Grammar Problem – the problem of finding the smallest context-free grammar that generates exactly one given sequence – has never been successfully applied to grammatical inference. We investigate the reasons and propose an extended formulation that seeks to minimize non-recursive grammars, instead of straight-line programs. In addition, we provide very efficient algorithms that app...

An Algorithm for Finding the Smallest Set of Smallest Rings

This paper describes an algorithm which finds the smallest set of smallest rings of a ring system without the necessity of finding all rings in the ring system. The algorithm first finds the smallest rings in which unused atoms occur and then progresses to find the smallest rings in which unused edges and faces occur until the smallest set of rings required to describe the complete ring system ...

Graphs with smallest forgotten index

The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...

The smallest neutrino mass

We consider models where one Majorana neutrino is massless at tree level (like the see saw with two right-handed neutrinos), and compute the contribution to its mass m generated by two-loop quantum corrections. The result is m ∼ 10 eV in the SM and m ∼ 10 eV · (tan β/10) in the MSSM, compatible with the restricted range suggested by Affleck-Dine baryogenesis.