Related papers: Generalized pathways
Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…
Cyclic polytopes have been studied since at least the early last century by Caratheodory and others.A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
How do we estimate the probability of an abundant objects' formation, with minimal context or assumption about is origin? To explore this we have previously introduced the concept of pathway assembly (as pathway complexity), in a graph…
In this paper we discuss generalized group, provides some interesting examples. Further we introduce a generalized module as a module like structure obtained from a generalized group and discuss some of its properties and we also describes…
A concise discussion of the axiomatic approach to the concept of parallel transport is presented. Attention is drawn to a bijective map between the sets of connections and (axiomatically defined) parallel transports. The transports along…
Generalized cycles can be thought of as the extension of form-cycle duality between holomorphic forms and cycles, to meromorphic forms and generalized cycles. They appeared as an ubiquitous tool in the study of spectral curves and…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
We introduce a new type of means. It is new in two ways: its domain consists of sets and its values are sets too. We investigate the properties and behavior of such generalization. We also present many naturally arisen examples for such…
The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences of rewrites', computational paths can be seen as the grounds on which the…
The concept of generalized path algebras was introduced in (Coelho and Liu, 2000). It was shown in (Ib\'a\~nez Cobos et al., 2008) how to obtain the Gabriel quiver of a given generalized path algebra. In this article, we generalize the…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
In this paper, the notion of generic transversality and its characterization are given. The characterization is also a further improvement of the basic transversality result and its strengthening which was given by John Mather.
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…