Related papers: Generalized Cayley's $\Omega$-processes
This paper develops from scratch a theory of Galois rings and orders over arbitrary fields. Our approach is different from others in the literature in that there is no non-modularity assumption. We prove, when the field is algebraically…
Since sum which is not necessarily commutative is defined in \Omega-algebra A, then \Omega-algebra A is called \Omega-group. I also considered representation of \Omega-group. Norm defined in \Omega-group allows us to consider continuity of…
Given a C*-algebra A with a left action of a locally compact quantum group G on it and a unitary 2-cocycle Omega on \hat G, we define a deformation A_Omega of A. The construction behaves well under certain additional technical assumptions…
A magmoid is a non-empty set with a partial binary operation; group-like magmoids generalize group-like magmas such as semigroups, monoids and groups. In this article, we first consider the many ways in which the notions of associative…
We develop a general field-covariant approach to quantum gauge theories. Extending the usual set of integrated fields and external sources to "proper" fields and sources, which include partners of the composite fields, we define the master…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
In this paper, we introduce a new concept of generalized matrix rings and build up the general theory of radicals for g.m.rings. Meantime, we obtain $$\bar{r}_b(A)=g.m.r_b(A)=\sum\{r_b(A_{ij})\mid i, j\in I\}=r_b(A)$$
Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the…
In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…
We show how to reconstruct a process theory of local systems starting from a global theory of reversible processes on a single global system, by using the purification principle. In such a process theory, local systems are not given, but…
We prove that large classes of algebras in the framework of root of unity quantum cluster algebras have the structures of maximal orders in central simple algebras and Cayley-Hamilton algebras in the sense of Procesi. We show that every…
Cayley's theorem tells us that all groups $\mathbf{G}$ occur as subgroups of the group of automorphisms over some set $X$. In this paper we consider a `sort-of' converse to this question: given a set $X$ and some transformation group…
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…
Let $G$ be a finite group and $N_{\Omega}(G)$ be the intersection of the normalizers of all subgroups belonging to the set $\Omega(G),$ where $\Omega(G)$ is a set of all subgroups of $G$ which have some theoretical group property. In this…
We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.