Related papers: Partial groups as partial groups

In this work, we give a survey of recent developments in the theory of partial actions of groups and Hopf algebras.

This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

For a free partial action of a group in a set we realize the associated partial skew group ring as an algebra of functions with finite support over an equivalence relation and we use this result to characterize the ideals in the partial…

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…

Recently we have shown that the equivalence classes of metrics on the double of a metric space $X$ form an inverse semigroup. Here we define an inverse subsemigroup related to a family of isometric subspaces of $X$, which is more…

In this paper, continuous binary operations of a topological space are studied and a criterion of their invertibility is proved. The classification problem of groups of invertible continuous binary operations of locally compact and locally…

It has recently been claimed that the inclusion of a Pauli term in (2+1) dimensions gives rise to a new type of anomalous spin term. The form of that term is shown to contradict the structure relations for the inhomogeneous Lorentz group.

We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…

We show that for certain class of oligomorphic groups there is a version of multiplication of double cosets in the Ismagilov--Olshanski sense. Categories of (reduced) double cosets are realized as certain categories of partial bijections.…

A priori, the set of birational transformations of an algebraic variety is just a group. We survey the possible algebraic structures that we may add to it, using in particular parametrised family of birational transformations.

In analogy with the semi-Fibonacci partitions studied recently by Andrews, we define semi-Pell compositions and semi-$m$-Pell compositions. We find that these are in bijection with certain weakly unimodal $m$-ary compositions. We give…

Given a category, one may construct slices of it. That is, one builds a new category whose objects are the morphisms from the category with a fixed codomain and morphisms certain commutative triangles. If the category is a groupoid, so that…

We introduce the notion of the partial group algebra with projections and relations and show that this C*-algebra is a partial crossed product. Examples of partial group algebras with projections and relations are the Cuntz-Krieger algebras…

We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…

A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…

Let X be a set and Bin(X) the set of all binary operations on X. We say that a subset of Bin(X) is a distributive set of operations if all pairs of elements are right distributive. J.Przytycki posed the question of which groups can be…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We obtain algebraic characterizations of relative notions of size in a discrete semigroup that generalize the usual combinatorial notions of syndetic, thick, and piecewise syndetic sets. "Filtered" syndetic and piecewise syndetic sets were…