Related papers: Towards a homotopy theory of process algebra
This article discusses a relatively new geometric flow, called the hypersymplectic flow. In the first half of the article we explain the original motivating ideas for the flow, coming from both 4-dimensional symplectic topology and…
Process algebra and temporal logic are two popular paradigms for the specification, verification and systematic development of reactive and concurrent systems. These two approaches take different standpoint for looking at specifications and…
This paper presents our proposal for the evolution of the metamodel for the Task Algebra in the Task Flow model for the Discovery Method. The original Task Algebra is based on simple and compound tasks structured using operators such as…
We study the homotopy types of certain spaces closely related to the spaces of algebraic (rational) maps from the $m$ dimensional real projective space into the $n$ dimensional complex projective space for $2\leq m\leq 2n$ (we conjecture…
0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
We study how large language models (LLMs) ``think'' through their representation space. We propose a novel geometric framework that models an LLM's reasoning as flows -- embedding trajectories evolving where logic goes. We disentangle…
Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not…
A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow…
Directed Algebraic Topology is beginning to emerge from various applications. The basic structure we shall use for such a theory, a 'd-space', is a topological space equipped with a family of 'directed paths', closed under some operations.…
Linear temporal logic and automaton-based run-time verification provide a powerful framework for designing task and motion planning algorithms for autonomous agents. The drawback to this approach is the computational cost of operating on…
This article introduces the novel framework of max-algebraic hybrid automata as a hybrid modelling language in the max-plus algebra. We show that the modelling framework unifies and extends the switching max-plus linear systems framework…
We consider the inclusion of the space of algebraic (regular) maps between real algebraic varieties in the space of all continuous maps. For a certain class of real algebraic varieties, which include real projective spaces, it is well known…
Despite the wide variety of input types in machine learning, this diversity is often not fully reflected in their representations or model architectures, leading to inefficiencies throughout a model's lifecycle. This paper introduces an…
We prove that any globular subdivision of multipointed $d$-spaces gives rise to a dihomotopy equivalence between the associated flows. As a straightforward application, the flows associated to two multipointed $d$-spaces related by a finite…
In this work, we propose a new family of generative flows on an augmented data space, with an aim to improve expressivity without drastically increasing the computational cost of sampling and evaluation of a lower bound on the likelihood.…
Efficient implementations of parallel applications on heterogeneous hybrid architectures require a careful balance between computations and communications with accelerator devices. Even if most of the communication time can be overlapped by…
Various curve complexes with vertices representing multicurves on a surface $S$ have been defined, for example [3], [4] and [8]. The homology curve complex $\mathcal{HC}(S,\alpha)$ defined in [7] is one such complex, with vertices…
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…
Every Model of High-Level Computation (MHC) has an underlying composition mechanism for combining simple computing devices into more complex ones. Composition can be done by (explicitly or implicitly) defining control flow, data flow or any…