We present a characterisation of { 1(q+1)+ 0, 1;n, q}-minihypers, q square, q = ph, p > 3 prime, h ≥ 2, q ≥ 1217, for 0+ 1 < q 7/12 2 − q1/4 2 . This improves a characterisation result of S. Ferret and L. Storme [6], involving more Baer subgeometries contained in the minihyper.

We introduce a dynamic and secondary-memory-based variant of the List of Clusters, which is shown to be competitive with the literature, especially on higher-dimensional spaces, where it outperforms the M-tree in searches and I/Os used for insertions. The basic principles of our design are applicable to other secondary-memory structures.

This paper presents characterizations of M-fuzzifying matroids bymeans of two kinds of fuzzy operators, called M-fuzzifying derived operatorsand M-fuzzifying difference derived operators.

‎The ABS methods‎, ‎introduced by Abaffy‎, ‎Broyden and Spedicato‎, ‎are‎‎direct iteration methods for solving a linear system where the‎‎$i$-th iteration satisfies the first $i$ equations‎, ‎therefore a‎ ‎system of $m$ equations is solved in at most $m$ steps‎. ‎In this‎‎paper‎, ‎we introduce a class of ABS-type methods for solving a full row‎‎rank linear equations‎, ‎w...