Related papers: Nominal C-Unification
Certain $*$-semigroups are associated with the universal $C^*$-algebra generated by a partial isometry, which is itself the universal $C^*$-algebra of a $*$-semigroup. A fundamental role for a $*$-structure on a semigroup is emphasized, and…
Conventional canonical quantization procedures directly link various c-number and q-number quantities. Here, we advocate a different association of classical and quantum quantities that renders classical theory a natural subset of quantum…
We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem min |sigma(F(X)-G)|_alpha + |C(X)- d|_beta subject to A(X)-b in Q; where sigma(X) denotes the vector of singular values of X,…
This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support…
We compute the nuclear dimension of separable, simple, unital, nuclear, Z-stable C*-algebras. This makes classification accessible from Z-stability and in particular brings large classes of C*-algebras associated to free and minimal actions…
Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what…
We introduce a definition of the locally trivial $G$-C*-algebra, which is a noncommutative counterpart of the total space of a locally compact Hausdorff numerable principal $G$-bundle. To obtain this generalization, we have to go beyond the…
The isomorphism problem for centrally nilpotent loops can be tackled by methods of cohomology. We develop tools based on cohomology and linear algebra that either lend themselves to direct count of the isomorphism classes (notably in the…
Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations.…
We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to…
We classify unital monomorphisms into certain simple Z-stable C^*-algebras up to approximate unitary equivalence. The domain algebra C is allowed to be any unital separable commutative C^*-algebra, or any unital simple separable nuclear…
In our setting enumeration amounts to generate all solutions of a problem instance without duplicates. We address the problem of enumerating the models of B-formulae. A B-formula is a propositional formula whose connectives are taken from a…
The study of open quantum systems relies on the notion of unital completely positive semigroups on $C^*$-algebras representing physical systems. The natural generalisation would be to consider the unital completely positive semigroups on…
We introduce the nuclear dimension of a C*-algebra; this is a noncommutative version of topological covering dimension based on a modification of the earlier concept of decomposition rank. Our notion behaves well with respect to inductive…
Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However, there are still relatively few asymmetric unification…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
We study uniform perturbations of intermediate C*-subalgebras of inclusions of simple C*-algebras. If a unital simple C*-algebra has a simple C*-subalgebra of finite index, then sufficiently close simple intermediate C*-subalgebras are…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
The unification type of an equational theory is defined using a preorder on substitutions, called the instantiation preorder, whose scope is either restricted to the variables occurring in the unification problem, or unrestricted such that…
Logics and automata models for languages over infinite alphabets, such as Freeze LTL and register automata, serve the verification of processes or documents with data. They relate tightly to formalisms over nominal sets, such as…