Related papers: Completely dissociative groupoids

Given a groupoid $< G, \star >$, and $k \geq 3$, we say that $G$ is antiassociative iff for all $x_1, x_2, x_3 \in G$, $(x_1 \star x_2) \star x_3$ and $x_1 \star (x_2 \star x_3)$ are never equal. Generalizing this, $< G, \star >$ is…

Let $(X,\bullet )$ be a groupoid (binary algebra) and $Bin(X\dot{)}$ denote the collection of all groupoids defined on $X$. We introduce two methods of factorization for this binary system under the binary groupoid product \textquotedblleft…

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…

A groupoid identity is said to be linear of length $2k$ if the same $k$ variables appear on both sides of the identity exactly once. We classify and count all varieties of groupoids defined by a single linear identity. For $k=3$, there are…

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

Infinitary operations, such as products indexed by countably infinite linear orders, arise naturally in the context of fundamental groups and groupoids. Despite the fact that the usual binary operation of the fundamental group determines…

This unpublished note contains some materials taken from my old study note on groupoids and small categories. It contains a proof for the fact that any groupoid is a group bundle over an equivalence relation. Moreover, the action of a…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ which leaves invariant each…

The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…

Groupoids are the oidification of groups, and they are largely used in topology and representation theory. We consider here the category $\mathsf{Gpd}$ of all groupoids with all morphisms, and the category $\mathsf{Gpd}_\Lambda$ of…

Using Composition--Diamond Lemma we construct presentations of groups $G = \langle x_1,\ldots,x_n \, | \, r_1,\ldots, r_m \rangle$ with the following property; for a fixed $1 \le i \le n$, and for all $1 \le j \le m$, Fox derivatives…

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…

We present some constructions of groupoids as: direct product, semidirect product, and we give necessary and sufficient conditions for a groupoid to be embedded into a direct product of groupoids. Also, we establish necessary and sufficient…

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…

Infinite products, indexed by countably infinite linear orders, arise naturally in the context of fundamental groupoids. Such products are called "transfinite" if the index orders are permitted to contain a dense suborder and are called…

The aim of this paper is to explain, mostly through examples, what groupoids are and how they describe symmetry. We will begin with elementary examples, with discrete symmetry, and end with examples in the differentiable setting which…

Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…