In this short note, we answer a question of Martin and Sanders [Integr. Equ. Oper. Theory, 85 (2) (2016), 191-220] by showing the existence disjoint frequently hypercyclic operators which fail to be weakly mixing and, therefore, satisfy Disjoint Hypercyclicity Criterion. We also show that given an operator $T$ such $T \oplus T$ is hypercyclic, set $S$ $T, S$ are but Criterion SOT dense in algeb...

a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum subarrays, Ruzzo and Tompa gave an O(n) time solution for one-dimension. This solution is, however, difficult to extend to twodimensions. While a trivial solution of O(Kn) time is easily obtainable for two-dimensions, little study has been undertaken to better this. W...

Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression) for the case assuming union-by-rank strategy for merging. In t...