English
Related papers

Related papers: Pseudovarieties of semigroups

200 papers

We consider semigroup algorithmic problems in the wreath product $\mathbb{Z} \wr \mathbb{Z}$. Our paper focuses on two decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain the…

Group Theory · Mathematics 2023-06-22 Ruiwen Dong

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

We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…

Rings and Algebras · Mathematics 2020-06-04 Agata Pilitowska , Anna Zamojska-Dzienio

In this paper, we propose a weak version of quotient for the algebraic action of a group on a variety, which we shall call a pseudo-quotient. They arise when we focus on the purely topological properties of good GIT quotients regardless of…

Algebraic Geometry · Mathematics 2023-11-03 Ángel González-Prieto

Loday's dendriform algebras and its siblings pre-Lie and zinbiel have received attention over the past two decades. In recent literature, there has been interest in a generalization of these types of algebra in which each individual…

Rings and Algebras · Mathematics 2020-07-14 Marcelo Aguiar

In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…

Commutative Algebra · Mathematics 2023-11-23 Manuel B. Branco , Ignacio Ojeda , José Carlos Rosales

A quasivariety has the weak ES property when the epimorphisms between its finitely generated members are surjective. A characterization of quasivarieties with the weak ES property is obtained and a method for detecting failures of this…

Logic · Mathematics 2025-05-20 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are…

Logic in Computer Science · Computer Science 2021-05-21 Amaldev Manuel , Dhruv Nevatia

This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings'…

Formal Languages and Automata Theory · Computer Science 2010-12-08 Laurent Bartholdi , Pedro V. Silva

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

A congruence on an inverse semigroup $S$ is determined uniquely by its kernel and trace. Denoting by $\rho_k$ and $\rho_t$ the least congruence on $S$ having the same kernel and the same trace as $\rho$, respectively, and denoting by…

Group Theory · Mathematics 2020-12-04 Ying-Ying Feng , Li-Min Wang , Zhi-Yong Zhou

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

Logic in Computer Science · Computer Science 2019-01-18 Ziyuan Gao , Sanjay Jain , Bakhadyr Khoussainov , Wei Li , Alexander Melnikov , Karen Seidel , Frank Stephan

A class of pseudodifferential operators on the Heisenberg group is defined. As it should be, this class is an algebra containing the class of differential operators. Furthermore, those pseudodifferential operators act continuously on…

Analysis of PDEs · Mathematics 2013-03-07 Hajer Bahouri , Clotilde Fermanian-Kammerer , Isabelle Gallagher

Convolution semigroups of states on a quantum group form the natural noncommutative analogue of convolution semigroups of probability measures on a locally compact group. Here we initiate a theory of weakly continuous convolution semigroups…

Operator Algebras · Mathematics 2009-10-28 J. Martin Lindsay , Adam Skalski

The aim of this manuscript is to give some basic notions related to numerical semigroups, and from these on the one hand describe a classical application to the study of singularities of plane algebraic curves, and on the other, show how…

Algebraic Geometry · Mathematics 2014-11-25 Abdallah Assi , Pedro A. García-Sánchez

We continue some recent investigations of W. Dziobiak, J. Jezek, and M. Maroti. Let G=(G,\cdot) be a commutative group. A semilattice over G is a semilattice enriched with G as a set of unary operations acting as semilattice automorphisms.…

Rings and Algebras · Mathematics 2012-08-29 Ildikó V. Nagy

The parameter coclass has been used successfully in the study of nilpotent algebraic objects of different kinds. In this paper a definition of coclass for nilpotent semigroups is introduced and semigroups of coclass 0, 1, and 2 are…

Rings and Algebras · Mathematics 2014-04-17 Andreas Distler

We investigate the rank of pseudovarieties defined by several of the variants of nilpotency conditions for semigroups in the sense of Mal'cev. For several of them, we provide finite bases of pseudoidentities. We also show that the…

Group Theory · Mathematics 2022-07-15 J. Almeida , M. H. Shahzamanian

We establish an Eilenberg-type correspondence for data languages, i.e. languages over an infinite alphabet. More precisely, we prove that there is a bijective correspondence between varieties of languages recognized by orbit-finite nominal…

Formal Languages and Automata Theory · Computer Science 2019-05-02 Henning Urbat , Stefan Milius