Related papers: Verified Parameterized Choreographies Technical Re…
In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a…
In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give…
In this paper convergence theorems for sequences of scalar, vector and multivalued Pettis integrable functions on a topological measure space are proved for varying measures vaguely convergent.
We review some recent development in the theory of spatial extremes related to Pareto Processes and modeling of threshold exceedances. We provide theoretical background, methodology for modeling, simulation and inference as well as an…
The paper gives the main lines of a general theory for physical measurements.
We provide the detailed proof of a strengthened version of the M. Artin Approximation Theorem.
Vertex operator algebras are mathematically rigorous objects corresponding to chiral algebras in conformal field theory. Operads are mathematical devices to describe operations, that is, $n$-ary operations for all $n$ greater than or equal…
We give a corrected version of Corollary 3.33 in: H. Flenner, S. Kaliman, and M. Zaidenberg, Birational transformations of weighted graphs. Affine algebraic geometry. Osaka Univ. Press, 2007, 107-147.
In this paper, we introduce a notion of twisted restricted conformal blocks on totally ramified orbicurves and establish an isomorphism between the space of twisted restricted conformal blocks and the space of twisted conformal blocks. The…
These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that…
In the paradigm of choreographic programming, the overall behaviour of a distributed system is coded as a choreography from a global viewpoint. The choreography can then be automatically projected (compiled) to a correct implementation for…
In this paper, we build the foundation for a theory of controlled rough paths on manifolds. A number of natural candidates for the definition of manifold valued controlled rough paths are developed and shown to be equivalent. The theory of…
Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…
In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the…
We propose algebraic protocols that enable the definition of protocol templates and session types analogous to the definition of domain-specific types with algebraic datatypes. Parameterized algebraic protocols subsume all regular as well…
Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.
In this article, we present a new characterization of the completeness of a partial metric space--which we call \textit{orbital characterization}-- using fixed point results.
Inference of physical parameters from reference data is a well studied problem with many intricacies (inconsistent sets of data due to experimental systematic errors, approximate physical models...). The complexity is further increased when…
Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…