Displaying 1021 – 1040 of 1461

Showing per page

On the decidability of semigroup freeness∗

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

On the Delta set of a singular arithmetical congruence monoid

Paul Baginski, Scott T. Chapman, George J. Schaeffer (2008)

Journal de Théorie des Nombres de Bordeaux

If a and b are positive integers with a b and a 2 a mod b , then the set M a , b = { x : x a mod b or x = 1 } is a multiplicative monoid known as an arithmetical congruence monoid (or ACM). For any monoid M with units M × and any x M M × we say that t is a factorization length of x if and only if there exist irreducible elements y 1 , ... , y t of M and x = y 1 y t . Let ( x ) = { t 1 , ... , t j } be the set of all such lengths (where t i < t i + 1 whenever i < j ). The Delta-set of the element x is defined as the set of gaps in ( x ) : Δ ( x ) = { t i + 1 - t i : 1 i < k } and the Delta-set of the monoid M is given by x M M × Δ ( x ) . We consider the Δ ( M ) when M = M a , b is an ACM with...

On the derived length of parasoluble groups

Alessio Russo (2003)

Bollettino dell'Unione Matematica Italiana

In this paper groups are considered inducing groups of power automorphisms on each factor of their derived series. In particular, it is proved that soluble groups with such property have derived length at most 3, and that this bound is best possible.

On the diameter of the intersection graph of a finite simple group

Xuanlong Ma (2016)

Czechoslovak Mathematical Journal

Let G be a finite group. The intersection graph Δ G of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G , and two distinct vertices X and Y are adjacent if X Y 1 , where 1 denotes the trivial subgroup of order 1 . A question was posed by Shen (2010) whether the diameters of intersection graphs of finite non-abelian simple groups have an upper bound. We answer the question and show that the diameters of intersection...

Currently displaying 1021 – 1040 of 1461