Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...
In this article we study Sobolev metrics of order one on diffeomorphism groups on the real line. We prove that the space equipped with the homogeneous Sobolev metric of order one is a flat space in the sense of Riemannian geometry, as it is isometric to an ...
Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...
In previous work, we defined the category of functors F-quad, associated to F-2-vector spaces equipped with a nondegenerate quadratic form. In this paper, we define a special family of objects in the category F-quad, named the mixed functors. We give the c ...