Related papers: Reduction Operators and Completion of Rewriting Sy…
In this work we make use of deformed operators to construct the coherent states of some nonlinear systems by generalization of two definitions: i) As eigenstates of a deformed annihilation operator and ii) by application of a deformed…
A method of reducing general quaternion functions of first degree, i.e., linear quaternion functions, to quaternary canonical form is given. Linear quaternion functions, once reduced to canonical form, can be maintained in this form under…
On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…
In this paper the concept of Parikh-reducing Church-Rosser systems is studied. It is shown that for two classes of regular languages there exist such systems which describe the languages using finitely many equivalence classes of the…
Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While positive semidefinite matrices form the underlying…
We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular…
Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…
For many-particle systems defined on lattices we investigate the global structure of effective Hamiltonians and observables obtained by means of a suitable basis transformation. We study transformations which lead to effective Hamiltonians…
We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In…
We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…
The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…
We present an operator-algebraic approach to the quantization and reduction of lattice field theories. Our approach uses groupoid C*-algebras to describe the observables and exploits Rieffel induction to implement the quantum gauge…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
The {\em reticulation} of an algebra $A$ is a bounded distributive lattice whose prime spectrum of ideals (or filters), endowed with the Stone topology, is homeomorphic to the prime spectrum of congruences of $A$, with its own Stone…
By the operator of relative complementation is meant a mapping assigning to every element x of an interval [a,b] of a lattice L the set x^{ab} of all relative complements of x in [a,b]. Of course, if L is relatively complemented then x^{ab}…
A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…
Lattice-like structures can provide a combination of high stiffness with light weight that is useful in many applications, but a resolved finite element mesh of such structures results in a computationally expensive discretization. This…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
We consider linear narrow operators on lattice-normed spaces. We prove that, under mild assumptions, every finite rank linear operator is strictly narrow (before it was known that such operators are narrow). Then we show that every…
We study quotients of the magmatic operad, that is the free nonsymmetric operad over one binary generator. In the linear setting, we show that the set of these quotients admits a lattice structure and we show an analog of the Grassmann…