It is well known that the discrete Sierpinski triangle can be defined as the nonzero residues modulo 2 of Pascal’s triangle, and that from this definition one can easily const...
A partial difference set having parameters (n2, r(n - 1), n + r2 - 3r, r2 - r) is called a Latin square type partial difference set, while a partial difference set having paramete...
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
New (96, 20, 4)-symmetric design has been constructed, unique under the assumption of an automorphism group of order 576 action. The correspondence between a (96, 20, 4)-symmetric ...