English
Related papers

Related papers: Finite Decomposition Semigroups

200 papers

In this paper, we give an introduction to basic concepts of automaton semigroups. While we must note that this paper does not contain new results, it is focused on extended introduction in the subject and detailed examples.

Group Theory · Mathematics 2018-01-30 Jānis Buls , Līga Užule , Aigars Valainis

Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…

History and Overview · Mathematics 2016-07-21 Damon Binder

We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…

Functional Analysis · Mathematics 2013-07-01 Roman Drnovšek , Heydar Radjavi

Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…

Rings and Algebras · Mathematics 2014-04-17 Andreas Distler , Bettina Eick

In this paper we study ends of finitely generated semigroups. The ends we are working with are the ends of the undirected graphs of Cayley graphs of finitely generated semigroups. We prove that the number of ends is preserved for…

Group Theory · Mathematics 2013-11-12 Vesna Kilibarda , Victor Maltcev , Simon Craik

We describe the structure of 0-simple countably compact topological inverse semigroups and the structure of congruence-free countably compact topological inverse semigroups.

Group Theory · Mathematics 2008-04-10 Oleg Gutik , Dušan Repovš

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

Geometric Topology · Mathematics 2022-03-07 A. N. Bartholomew , M. J. Dunwoody

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…

Formal Languages and Automata Theory · Computer Science 2013-10-21 Ines Klimann , Jean Mairesse , Matthieu Picantin

We give a constructive treatment of some basic concepts and results in semigroup theory. Focusing on semigroups equipped with an apartness relation, we give analogues, from the point of view of apartness, of several classical constructions…

Group Theory · Mathematics 2021-09-07 Erik Darpö , Melanija Mitrović

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.

Group Theory · Mathematics 2020-03-24 Marius Tărnăuceanu

The principle result of this article is the determination of the possible finite subgroups of arithmetic lattices in U(2,1).

Group Theory · Mathematics 2009-01-26 D. B. McReynolds

This paper contains a stronger version of a final identification theorem for the `generic' groups of finite Morley rank.

Group Theory · Mathematics 2011-11-28 Ayse Berkman , Alexandre Borovik

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

Group Theory · Mathematics 2018-10-02 Jonas Deré , Mark Pengitore

A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…

Combinatorics · Mathematics 2018-07-09 C. R. Donoven , J. D. Mitchell , W. A. Wilson

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…

Group Theory · Mathematics 2014-11-11 Guo-An Diao , Mark Feighn

The purpose of this paper is to compute the non-zero semigroup determinant of the class of finite semigroups in which every two idempotents commute. This class strictly contains the class of finite semigroups that have central idempotents…

Group Theory · Mathematics 2024-06-26 M. H. Shahzamanian

A subgroup $H$ of a finite group $G$ is said to be an $\mathscr{H}C$-subgroup of $G$ if there exists a normal subgroup $T$ of $G$ such that $G=HT$ and $H^g \cap N_T(H)\leq H$ for all $g\in G$. In this paper, we investigate the structure of…

Group Theory · Mathematics 2014-10-28 Lijun Huo , Xiaoyu Chen , Wenbin Guo

This article contains a basic introduction to the local study of finite groups, including a brief perspective on the theory of fusion systems and $p$-local finite groups. -- Este art\'iculo contiene una introducci\'on b\'asica al estudio…

Group Theory · Mathematics 2024-11-12 José Cantarero

Computations in the cohomology of finite groups.

Algebraic Topology · Mathematics 2007-12-03 Ian J Leary

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

Group Theory · Mathematics 2023-03-07 Valentina Grazian , Carmine Monetta , Marialaura Noce