A Generic Framework for Engineering Graph Canonization Algorithms

The state-of-the-art tools for practical graph canonization are all based on the individualization-refinement paradigm, and their difference is primarily in the choice of heuristics they include and in the actual tool implementation. It is thus not possible to make a direct comparison of how individual algorithmic ideas affect the performance on different graph classes. We present an algorithmic software framework that facilitates implementation of heuristics as independent extensions to a common core algorithm. It therefore becomes easy to perform a detailed comparison of the performance and behaviour of different algorithmic ideas. Implementations are provided of a range of algorithms for tree traversal, target cell selection, and node invariant, including choices from the literature and new variations. The framework readily supports extraction and visualization of detailed data from separate algorithm executions for subsequent analysis and development of new heuristics. Using collections of different graph classes we investigate the effect of varying the selections of heuristics, often revealing exactly which individual algorithmic choice is responsible for particularly good or bad performance. On several benchmark collections, including a newly proposed class of difficult instances, we additionally find that our implementation performs better than the current state-of-the-art tools

Regular maps of high density

A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and we conclude that all regular maps of this type belong to a family of maps naturally defined on the Fermat curves x^n+y^n+z^n=0, excepting the one corresponding to the tetrahedron.Comment: 13 pages, 4 figure

On the Symmetries of Integrability

We show that the Yang-Baxter equations for two dimensional models admit as a group of symmetry the infinite discrete group $A_2^{(1)}$. The existence of this symmetry explains the presence of a spectral parameter in the solutions of the equations. We show that similarly, for three-dimensional vertex models and the associated tetrahedron equations, there also exists an infinite discrete group of symmetry. Although generalizing naturally the previous one, it is a much bigger hyperbolic Coxeter group. We indicate how this symmetry can help to resolve the Yang-Baxter equations and their higher-dimensional generalizations and initiate the study of three-dimensional vertex models. These symmetries are naturally represented as birational projective transformations. They may preserve non trivial algebraic varieties, and lead to proper parametrizations of the models, be they integrable or not. We mention the relation existing between spin models and the Bose-Messner algebras of algebraic combinatorics. Our results also yield the generalization of the condition $q^n=1$ so often mentioned in the theory of quantum groups, when no $q$ parameter is available.Comment: 23 page

Symmetric Interconnection Networks from Cubic Crystal Lattices

Torus networks of moderate degree have been widely used in the supercomputer industry. Tori are superb when used for executing applications that require near-neighbor communications. Nevertheless, they are not so good when dealing with global communications. Hence, typical 3D implementations have evolved to 5D networks, among other reasons, to reduce network distances. Most of these big systems are mixed-radix tori which are not the best option for minimizing distances and efficiently using network resources. This paper is focused on improving the topological properties of these networks. By using integral matrices to deal with Cayley graphs over Abelian groups, we have been able to propose and analyze a family of high-dimensional grid-based interconnection networks. As they are built over $n$-dimensional grids that induce a regular tiling of the space, these topologies have been denoted \textsl{lattice graphs}. We will focus on cubic crystal lattices for modeling symmetric 3D networks. Other higher dimensional networks can be composed over these graphs, as illustrated in this research. Easy network partitioning can also take advantage of this network composition operation. Minimal routing algorithms are also provided for these new topologies. Finally, some practical issues such as implementability and preliminary performance evaluations have been addressed