English
Related papers

Related papers: Quasi-automatic semigroups

200 papers

The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…

Group Theory · Mathematics 2019-01-11 Yang Dandan , Igor Dolinka , Victoria Gould

We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$^0$: (1)…

Group Theory · Mathematics 2025-09-23 Trevor Jack

Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…

Rings and Algebras · Mathematics 2018-08-24 J. East , A. Egri-Nagy , J. D. Mitchell , Y. Péresse

In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of auto- maticity. We focus on semigroups of \beta-adics developpements, for which we obtain a criterion of strong automaticity.

Combinatorics · Mathematics 2015-03-19 Paul Mercat

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

Combinatorics · Mathematics 2018-09-27 Calvin Leng , Christopher O'Neill

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

A new type of semigroups which appears while dealing with $N=1$ superconformal symmetry in superstring theories is considered. The ideal series having unusual abstract properties is constructed. Various idealisers are introduced and…

High Energy Physics - Theory · Physics 2008-11-26 Steven Duplij

For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…

Combinatorics · Mathematics 2019-11-11 Maria Bras-Amorós , Julio Fernández-González

Let $X$ be a Banach space, and $T:[0,\infty)\rightarrow {\mathcal{L}}(X,X),$ the bounded linear operators on $X.$ A family $\{T(t)\}_{t\ge 0}\subseteq {% \mathcal{L}}(X,X)$ is called a one-parameter semigroup if $T(s+t)=T(s)T(t),$ and…

Functional Analysis · Mathematics 2016-09-20 Mohammed AL Horani , Roshdi Khalil , Thabet Abdeljawad

We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…

Rings and Algebras · Mathematics 2019-02-12 Manuel Delgado , Vítor H. Fernandes

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

Group Theory · Mathematics 2023-04-26 Ruiwen Dong

We study semigroups of convex monotone operators on spaces of continuous functions and their behaviour with respect to $\Gamma$-convergence. In contrast to the linear theory, the domain of the generator is, in general, not invariant under…

Analysis of PDEs · Mathematics 2025-04-28 Jonas Blessing , Robert Denk , Michael Kupper , Max Nendel

This paper provides a complete characterization of quasicontractive $C_0$-semigroups on Hardy and Dirichlet space with a prescribed generator of the form $Af=Gf'$. We show that such semigroups are semigroups of composition operators and we…

Functional Analysis · Mathematics 2015-02-20 C. Avicou , I. Chalendar , J. R. Partington

Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which…

Group Theory · Mathematics 2012-10-01 Michael K. Kinyon , Aleksandar Krapež , J. D. Phillips

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

Group Theory · Mathematics 2024-10-16 Marco Vergani

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

A finite group is called semi-rational if the distribution induced on it by any word map is a virtual character. Amit and Vishne give a sufficient condition for a group to be semi-rational, and ask whether it is also necessary. We answer…

Group Theory · Mathematics 2018-03-21 Tzoor Plotnikov

Value semigroups of non irreducible singular algebraic curves and their fractional ideals are submonoids of $\mathbb Z^n$ that are closed under infimums, have a conductor and fulfill a special compatibility property on their elements.…

Commutative Algebra · Mathematics 2017-09-11 Marco D'Anna , Pedro A. García-Sánchez , Vincenzo Micale , Laura Tozzo

We define for discrete finitely presented groups a new property related to their asymptotic representations. Namely we say that a groups has the property AGA if every almost representation generates an asymptotic representation. We give…

Operator Algebras · Mathematics 2015-06-26 V. Manuilov

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…

Formal Languages and Automata Theory · Computer Science 2013-01-11 Ali Akhavi , Ines Klimann , Sylvain Lombardy , Jean Mairesse , Matthieu Picantin