Forbidden ordinal patterns are ordinal patterns (or ‘rank blocks’) that cannot appear in the orbits generated by a map taking values on a linearly ordered space, in which case we say that the map has forbidden patterns. Once a map has a forbidden pattern of a given length L0, it has forbidden patterns of any length L ≥ L0 and their number grows superexponentially with L. Using recent results on...

grading of agricultural products has always been a subject of research by scientists. one of the criteria to be chosen for grading of fruits is the fruit's level of ripeness. different methods have been employed to assess the status of fruit ripeness some of which are destructive and others are not so. in this research, a noninvasive capacitive method was used to estimate the ripeness leve...

For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...