Related papers: Nominal C-Unification
Symmetric submodular function minimization admits purely combinatorial algorithms using special orderings of the ground set. Extending the minimum-cut algorithm of Nagamochi and Ibaraki (1992), Queyranne (1998) showed that the maximum…
We consider the functor C that to a unital C*-algebra A assigns the partial order set C(A) of its commutative C*-subalgebras ordered by inclusion. We investigate how some C*-algebraic properties translate under the action of C to…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics…
We give a new syntax independent definition of the notion of a generalized algebraic theory as an initial object in a category of categories with families (cwfs) with extra structure. To this end we define inductively how to build a valid…
In this paper we put forward the definition of particular subsets on a unital C*-algebra, that we call isocones, and which reduce in the commutative case to the set of continuous non-decreasing functions with real values for a partial order…
In this article we give a short and informal overview of some aspects of the theory of C*- and von Neumann algebras. We also mention some classical results and applications of these families of operator algebras.
We give an overview of the question: which positive elements in an operator algebra can be written as a linear combination of projections with positive coefficients. A special case of independent interest is the question of which positive…
These notes aim to provide a classical approach to solving some conformable differential equations based on prior knowledge of how to solve ordinary differential equations. That is, using the methods of separation of variables, homogeneous…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
We establish the existence of multiple solutions for a nonlinear problem of critical type. The problem considered is fractional in nature, since it is obtained by the superposition of $(s,p)$-fractional Laplacians of different orders. The…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set…
We investigate relations on elements in C*-algebras, including *-polynomial relations, order relations and all relations that correspond to universal C*-algebras. We call these C*-relations and define them axiomatically. Within these are…
Let p/q be a rational number. Numeration in base p/q is defined by a function that evaluates each finite word over A_p={0,1,...,p-1} to some rational number. We let N_p/q denote the image of this evaluation function. In particular, N_p/q…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
We continue our study of the general theory of possibly nonselfadjoint algebras of operators on a Hilbert space, and modules over such algebras, developing a little more technology to connect `nonselfadjoint operator algebra' with the…
In each variant of the lambda-calculus, factorization and normalization are two key-properties that show how results are computed. Instead of proving factorization/normalization for the call-by-name (CbN) and call-by-value (CbV) variants…