相关论文: Uniform decision problems in automatic semigroups
All exactly integrable systems connected with the semisimple algebras of the second rank with an arbitrary choice of the grading in them are presented in explicit form. General solution of such systems are expressed in terms of the matrix…
Around 1980 commutator theory was generalized from groups to arbitrary algebras using the socalled term condition commutator. The semigroups that are abelian with respect to this commutator were classified by Warne (1994). We study what…
Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…
In this paper, we discuss the inverse problem of determining a semisimple group algebra from the knowledge of rings of the type sum_{t=1}^s M_{n_t}(Ft), where j is an arbitrary integer and F_t is finite field for each t, and show that it is…
We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case,…
We consider membership problems for rational subsets of the semigroup of $2\times 2$ matrices over $\mathbb{Q}$. For a semigroup $M$, the rational subsets $\mathrm{Rat}(M)$ are defined as the sets accepted by NFAs whose transitions are…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
This paper shows how to construct explicitly an automaton that generates an arbitrary numerical semigroup.
We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.
We describe the commuting graph of a Rees matrix semigroup over a group and investigate its properties: diameter, clique number, girth, chromatic number and knit degree. The maximum size of a commutative subsemigroup of a Rees matrix…
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties in terms of "forbidden" semigroups. We also describe residually completely 0-simple varieties of…
A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an $\mathcal{R}$-unique ordered idempotent. Here we explore the theory of right inverse ordered semigroups. We show that a regular…
A description of the endomorphisms of semidirect products of two groups as a group of $2\times 2$ matrices of maps is already known. Using this description, we have studied the concept of determinant for the endomorphisms of semidirect…
We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Sch\"{u}tzenberger graph of every positive word…
Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…
Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…
We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…
We present some fundamental results on (possibly nonlinear) algebraic semigroups and monoids. These include a version of Chevalley's structure theorem for irreducible algebraic monoids, and the description of all algebraic semigroup…