ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
Abstract. We say that a coloring c : []n 2 is continuous if it is continuous with respect to some second countable topology on . A coloring c is potentially continuous if it is co...