Related papers: Verified Parameterized Choreographies Technical Re…
This paper is dedicated to the analysis and detailed study of a procedure to generate both the weighted arithmetic and harmonic means of $n$ positive real numbers. Together with this interpretation, we prove some relevant properties that…
This text consists of the introduction, table of contents, and bibliography of a long manuscript (703 pages) that is currently submitted for publication. This manuscript develops an extension of Garside's approach to braid groups and…
In Paper I, Greisen & Calabretta (2002) describe a generalized method for assigning physical coordinates to FITS image pixels. This paper implements this method for all spherical map projections likely to be of interest in astronomy. The…
We present Cho-Reo-graphies (CR), a new language model that unites two powerful programming paradigms for concurrent software based on communicating processes: Choreographic Programming and Exogenous Coordination. In CR, programmers specify…
We develop the notion of a (pro-) conformal pseudo operad and apply it to the construction of the basic cohomology complex of a vertex algebra. The paper heavily uses the ideas and constructions of the work of Tamarkin [Tam02]
The purpose of this paper is to present projective geometry in a synthetic, visual and intuitive style through the central notion of harmonicity which leads to harmonic curves. This presentation includes new results, unpublished proofs of…
A chorded cycle is a cycle with at least one chord. Gould asked in [Graphs Comb. 38 (2022) 189] the question: What spectral conditions imply a graph contains a chorded cycle? For a graph with fixed size, extremal spectral conditions are…
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, cover- ing areas as diverse as refactorings, network topologies or reconfigurable software. Being a formal method,…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…
The aim of this paper is to prove characterization theorems for higher order derivations. Among others we prove that the system defining higher order derivations is stable. Further characterization theorems in the spirit of N.~G.~de Bruijn…
We present a unified approach to compute the total vertex irregularity strength (tvs) of various graphs, employing a novel technique recently proposed by Barra et al. For graphs such as cycles, paths, prisms, wheels, complete graphs, helm…
Calibration is a key step in the signal processing pipeline of any radio astronomical instrument. The required sky, ionospheric and instrumental models for this step can suffer from various kinds of incompleteness. In this paper we analyze…
Robotic systems are multi-dimensional entities, combining both hardware and software, that are heavily dependent on, and influenced by, interactions with the real world. They can be variously categorised as embedded, cyberphysical,…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
We give a scheme for interpreting shaded tangles as quantum programs, with the property that isotopic tangles yield equivalent programs. We analyze many known quantum programs in this way -- including entanglement manipulation and error…
Following the definition of perturbed metric space, in this paper, some fixed point theorems are established for $ F $-perturbed mappings in complete perturbed metric spaces and justify the result by counter example. Finally, an application…
For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…