We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. We prove that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil (\frac{n-3}{2})^{\log_32} \rceil \}$, where ${\rm rad}(G^*)$ denotes the radius of the triangulation's dual, which is at least logarithmic...
In order processing, consecutive sequences (e.g., 1-2-3) are generally processed faster than nonconsecutive sequences (e.g., 1-3-5) (also referred to as the reverse distance effect). A common explanation for this effect is that order processing operates via a memory-based associative mechanism whereby consecutive sequences are processed faster beca...
