Related papers: Semijoins of Annotated Relations
There are countless sources of data available to governments, companies, and citizens, which can be combined for good or evil. We analyse the concepts of combining data from common sources and linking data from different sources. We model…
In this paper we explore the task of modeling semi-structured object sequences; in particular, we focus our attention on the problem of developing a structure-aware input representation for such sequences. Examples of such data include user…
We investigate semiring provenance--a successful framework originally defined in the relational database setting--for description logics. In this context, the ontology axioms are annotated with elements of a commutative semiring and these…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
To convert a fractional solution to an instance of a constraint satisfaction problem into a solution, a rounding scheme is needed, which can be described by a collection of symmetric operations with one of each arity. An intriguing…
The full lattices in a finite dimensional commutative ${\mathbb Q}$-algebra form a commutative semigroup. In the case of an algebraic number field the top part of a certain quotient semigroup is the class group. For a separable algebra some…
Motivated by questions arising in the study of the spectral theory of models of aperiodic order, we investigate sums of functions of semibounded closed subsets of the real line. We show that under suitable thickness assumptions on the sets…
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…
This paper studies the class of logarithmically completely monotonic (LCM) functions. These functions play an important role in characterising externally positive linear systems which find applications in important control problems such as…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are basic programming features, such as reading or updating the…
We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…
Amortized analysis is a cost analysis technique for data structures in which cost is studied in aggregate: rather than considering the maximum cost of a single operation, one bounds the total cost encountered throughout a session.…
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…
In this paper we present the construction of explicit quasi-isomorphisms that compute the cyclic homology and periodic cyclic homology of crossed-product algebras associated with (discrete) group actions. In the first part we deal with…
We consider semigroups of transformations (partial mappings defined on a set $A$) closed under the set-theoretic intersection of mappings treated as subsets of $A\times A$. On such semigroups we define two relations: the relation of…
Distinguished selfadjoint extensions of operators which are not semibounded can be deduced from the positivity of the Schur Complement (as a quadratic form). In practical applications this amounts to proving a Hardy-like inequality.…
In this article we prove that quasi-multiplicative (with respect to the usual length function) mappings on the permutation group $\SSn$ (or, more generally, on arbitrary amenable Coxeter groups), determined by self-adjoint contractions…
Ladder operators are useful, if not essential, in the analysis of some given physical system since they can be used to find easily eigenvalues and eigenvectors of its Hamiltonian. In this paper we extend our previous results on abstract…
We develop the theory of minimal realizations and factorizations of rational functions where the coefficient space is a ring of the type introduced in our previous work, the scaled quaternions, which includes as special cases the…