相关论文: Automatic structures for semigroup constructions

We construct large families of groups admitting free transitive actions on median spaces. In particular, we construct groups which act freely and transitively on the complete universal real tree with continuum valence such that any subgroup…

We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.

This is a part of an ongoing project, the goal of which is to classify all semi-direct products $\mathfrak s=\mathfrak g{\ltimes} V$ such that $\mathfrak g$ is a simple Lie algebra, $V$ is a $\mathfrak g$-module, and $\mathfrak s$ has a…

In this paper, we consider topological semigroup actions on compact topological spaces. Under mild assumptions on the semigroup and the action, we construct a semi-direct product groupoid with a Haar system. We also show that it is…

We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that…

We introduce a new construction of matrix wreath products of algebras that is similar to wreath products of groups. We then use it to prove embedding theorems for Jacobson radical, nil, and primitive algebras. In \S\ref{Section6}, we…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Our aim in this paper is to give some examples of $(a, 1)f$ Riemannian structures (a generalization of an $r$-paracontact structure) induced on product of spheres of codimension $r$ ($r \in \{1,2\} $) in an $m$-dimensional Euclidean space…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…

We introduce analogs of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. When the color set is a semigroup, an internal product can be introduced. This leads to the construction of generalized…

Cup products provide a natural approach to access higher bounded cohomology groups. We extend vanishing results on cup products of Brooks quasimorphisms of free groups to cup products of median quasimorphisms, i.e., Brooks-type…

The aim of this paper is to see how commuting graphs interact with two semigroup constructions: the zero-union and the direct product. For both semigroup constructions, we investigate the diameter, clique number, girth, chromatic number and…

Operation-based Conflict-free Replicated Data Types (CRDTs) are eventually consistent replicated data types that automatically resolve conflicts between concurrent operations. Op-based CRDTs must be designed differently for each data type,…

Constant Rank (CR) state machines play an important role in the general structure theory of Finite State Machines. A machine is of constant rank if each input and input-sequence maps the state set onto the same number of next states.…

We determine the automorphism group for some well known constructions of finite semifields. In particular, we compute the automorphism group of Sandler's semifields and in certain cases the automorphism groups of the Hughes-Kleinfeld and…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

We construct quasi-isometric embeddings from right-angled Artin groups into the outer automorphism group of a free group. These homomorphisms are in analogy with those constructed in \cite{CLM}, where the target group is the mapping class…