Related papers: Pseudometrics and preorders on sets of integer seq…
Our basic structure is a finite-dimensional complex Hilbert space $H$. We point out that the set of effects on $H$ form a convex effect algebra. Although the set of operators on $H$ also form a convex effect algebra, they have a more…
We consider a class of functions defined on metric spaces which generalizes the concept of piecewise Lipschitz continuous functions on an interval or on polyhedral structures. The study of such functions requires the investigation of their…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
This work exploits the logical foundation of session types to determine what kind of type discipline for the pi-calculus can exactly capture, and is captured by, lambda-calculus behaviours. Leveraging the proof theoretic content of the…
Nonparametric series regression often involves specification search over the tuning parameter, i.e., evaluating estimates and confidence intervals with a different number of series terms. This paper develops pointwise and uniform inferences…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
D-finite functions and P-recursive sequences are defined in terms of linear differential and recurrence equations with polynomial coefficients. In this paper, we introduce a class of numbers closely related to D-finite functions and…
In any setting in which observable properties have a quantitative flavour, it is natural to compare computational objects by way of \emph{metrics} rather than equivalences or partial orders. This holds, in particular, for probabilistic…
Nominal sets provide a foundation for reasoning about names. They are used primarily in syntax with binders, but also, e.g., to model automata over infinite alphabets. In this paper, nominal sets are related to nominal renaming sets, which…
In this article we introduce a new type of local zeta functions and study some connections with pseudodifferential operators in the framework of non-Archimedean fields. The new local zeta functions are defined by integrating complex powers…
A Bayesian pseudocoreset is a compact synthetic dataset summarizing essential information of a large-scale dataset and thus can be used as a proxy dataset for scalable Bayesian inference. Typically, a Bayesian pseudocoreset is constructed…
A semantics of concurrent programs can be given using precubical sets, in order to study (higher) commutations between the actions, thus encoding the "geometry" of the space of possible executions of the program. Here, we study the…
A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
We discuss the phenomenon of preacceleration in the light of a method of successive approximations used to construct the physical order reduction of a large class of singular equations. A simple but illustrative physical example is analyzed…
This paper is a contribution to the study of the relations between special functions, Lie algebras and rigged Hilbert spaces. The discrete indices and continuous variables of special functions are in correspondence with the representations…
In this paper we study some fundamental algebraic properties of slice functions and slice regular functions over an alternative $^*$-algebra $A$ over $\mathbb{R}$. These recently introduced function theories generalize to higher dimensions…
This work presents a reduced order modelling technique built on a high fidelity embedded mesh finite element method. Such methods, and in particular the CutFEM method, are attractive in the generation of projection-based reduced order…
We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at…