Related papers: Determining Generic Point Configurations From Unla…
An interesting problem in solid state physics is to compute discrete breather solutions in $\mathcal{N}$ coupled 1--dimensional Hamiltonian particle chains and investigate the richness of their interactions. One way to do this is to compute…
We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper, we present a geometric approach to analyzing contractive and…
We introduce the notions of tree-like path and tree-like equivalence between paths and prove that the latter is an equivalence relation for paths of finite length. We show that the equivalence classes form a group with some similarity to a…
Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…
A directed path whose edges are assigned labels "up", "down", "right", or "left" is called \emph{four-directional}, and \emph{three-directional} if at most three out of the four labels are used. A \emph{direction-consistent embedding} of an…
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…
The signature of a path is a sequence of tensors which allows to uniquely reconstruct the path. By employing the geometric theory of nonlinear systems of ordinary differential equations, we find necessary and sufficient algebraic conditions…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
In this paper we investigate fixed-point numbers and entropies of endomorphisms on abelian varieties. It was shown quite recently that the number of fixed-points of an iterated endomorphism on a simple complex torus is either periodic or…
In this paper, we study partial automorphisms and, more generally, injective partial endomorphisms of a finite undirected path from Semigroup Theory perspective. Our main objective is to give formulas for the ranks of the monoids…
Our work studies the enumeration and random generation of unlabeled combinatorial classes of unrooted graphs. While the technique of vertex pointing provides a straightforward procedure for analyzing a labeled class of unrooted graphs by…
Disjoint paths problems are among the most prominent problems in combinatorial optimization. The edge- as well as vertex-disjoint paths problem, are NP-complete on directed and undirected graphs. But on undirected graphs, Robertson and…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a…
Recently designed biomolecular approaches to build single chain polypeptide polyhedra as molecular origami nanostructures have risen high interest in various double traces of the underlying graphs of these polyhedra. Double traces are walks…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…