Related papers: Disjoint-union partial algebras
P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…
For a given inverse semigroup S , we introduce the notion of algebraic crossed product by using a given partial action of S, and we will prove that under some condition it is associative. Also we will introduce the concept of partial…
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…
We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…
According to the classical theorem, every irreducible algebraic variety endowed with a nontrivial rational action of a connected linear algebraic group is birationally isomorphic to a product of another algebraic variety and ${\bf P}^s$…
A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…
We introduce the notion of a categorical join, which can be thought of as a categorification of the classical join of two projective varieties. This notion is in the spirit of homological projective duality, which categorifies classical…
Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…
We study diverse parametrized versions of the operad of associative algebra, where the parameter are taken in an associative semigroup $\Omega$ (generalization of matching or family associative algebras) or in its cartesian square…
We define and develop the notion of a discretisable quasi-action. It is shown that a cobounded quasi-action on a proper non-elementary hyperbolic space $X$ not fixing a point of $\partial X$ is quasi-conjugate to an isometric action on…
The set theory relations \in, \backslash, \Delta, \cap, and \cup have corollaries in subspace relations. Geometric Algebra is introduced as the ideal framework to explore these subspace operations. The relations \in, \backslash, and \Delta…
To a regular projection of a knot we associate a finite dimensional non-commutative associative algebra which is self-injective and special biserial.
We study intertwining operator algebras introduced and constructed by Huang. In the case that the intertwining operator algebras involve intertwining operators among irreducible modules for their vertex operator subalgebras, a number of…
Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…
Nominal unification is an extension of first-order unification that takes into account the \alpha-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal…
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…
A finite algebra $\bA=\alg{A;\cF}$ is \emph{dualizable} if there exists a discrete topological relational structure $\BA=\alg{A;\cG;\cT}$, compatible with $\cF$, such that the canonical evaluation map $e\_{\bB}\colon \bB\to \Hom(…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…