相关论文: A group-theoretical interpretation of the word pro…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

Let $G$ be an amenable group. We define and study an algebra $\mathcal{A}_{sn}(G)$, which is related to invariant means on the subnormal subgroups of $G$. For a just infinite amenable group $G$, we show that $\mathcal{A}_{sn}(G)$ is…

Denote by $\mathcal T_n$ and $\mathcal S_n$ the full transformation semigroup and the symmetric group on the set $\{1,\ldots,n\}$, and $\mathcal E_n=\{1\}\cup(\mathcal T_n\setminus \mathcal S_n)$. Let $\mathcal T(X,\mathcal P)$ denote the…

Given a set-theoretical solution of the pentagon equation $s:S\times S\to S\times S$ on a set $S$ and writing $s(a, b)=(a\cdot b,\, \theta_a(b))$, with $\cdot$ a binary operation on $S$ and $\theta_a$ a map from $S$ into itself, for every…

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

A finitely generated group $G$ is called poly-context-free if its word problem $\mathrm{WP}(G)$ is an intersection of finitely many context-free languages. We consider the quaternionic lattices $\Gamma_\tau$ over the field…

We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the…

We show that the rank r component of the free idempotent generated semigroup of the biordered set of the full linear monoid of n x n matrices over a division ring Q has maximal subgroup isomorphic to the general linear group GL_r(Q), where…

In this paper we provide an overview of the class of inverse semigroups $S$ such that every congruence on $S$ relates at least one idempotent to a non-idempotent; such inverse semigroups are called $E$-disjunctive. This overview includes…

We show that if $w$ is a multilinear commutator word and $G$ a finite group in which every metanilpotent subgroup generated by $w$-values is of rank at most $r$, then the rank of the verbal subgroup $w(G)$ is bounded in terms of $r$ and $w$…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We prove the existence of a regular semigroup F(X) weakly generated by X such that all other regular semigroups weakly generated by X are homomorphic images of F(X). The semigroup F(X) is introduced by a presentation and the word problem…

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

If G is a finitely generated powerful pro-p group satisfying a certain law v=1, and if G can be generated by a normal subset T of finite width which satisfies a positive law, we prove that G is nilpotent. Furthermore, the nilpotency class…

The famous Tits' alternative states that a linear group either contains a nonabelian free group or is soluble-by-(locally finite). We study in this paper similar alternatives in pseudofinite groups. We show for instance that an…

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…