English
Related papers

Related papers: Finite complete rewriting systems for regular semi…

200 papers

We prove that a semiregular topological space $X$ is completely regular if and only if its topology is generated by a normal quasi-uniformity. This characterization implies that each regular paratopological group is completely regular. This…

General Topology · Mathematics 2021-11-01 Taras Banakh , Alex Ravsky

Purpose: To develop the algebraic foundation of finite commutative ternary $\Gamma$-semirings by identifying their intrinsic invariants, lattice organization, and radical behavior that generalize classical semiring and $\Gamma$-ring…

Rings and Algebras · Mathematics 2026-02-06 Chandrasekhar Gokavarapu , D Madhusudhana Rao

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc

We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a `$W$-product' $W(T,Y)$, where $T$ is a monoid, $Y$ is a semilattice and there is a…

Group Theory · Mathematics 2014-04-28 Peter R. Jones

We establish several finiteness properties of groups defined by algebraic difference equations. One of our main results is that a subgroup of the general linear group defined by possibly infinitely many algebraic difference equations in the…

Algebraic Geometry · Mathematics 2020-07-30 Michael Wibmer

Two different models for a Hopf-von Neumann algebra of bounded functions on the quantum semigroup of all (quantum) permutations of infinitely many elements are proposed, one based on projective limits of enveloping von Neumann algebras…

Operator Algebras · Mathematics 2012-06-26 Debashish Goswami , Adam Skalski

We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating…

Logic in Computer Science · Computer Science 2015-07-01 Takahito Aoto , Yoshihito Toyama

If $S$ is a discrete semigroup, then $\beta S$ has a natural, left-topological semigroup structure extending $S$. Under some very mild conditions, $U(S)$, the set of uniform ultrafilters on $S$, is a two-sided ideal of $\beta S$, and…

Rings and Algebras · Mathematics 2015-05-11 Will Brian

Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So…

Group Theory · Mathematics 2015-01-08 Attila Nagy

For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…

Dynamical Systems · Mathematics 2013-06-18 Oliver Mason , Fabian Wirth

In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…

Rings and Algebras · Mathematics 2025-11-18 Snehinh Sen

In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is representable over a finite base. This result gives a positive…

Logic · Mathematics 2021-12-21 Daniel Rogozin

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

Group Theory · Mathematics 2025-05-02 Marcel Wild

In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…

Commutative Algebra · Mathematics 2010-06-18 V. Blanco , J. C. Rosales

In this paper, a generalized version of the von Neumann universe known as the total universe is proposed to formally introduce non-well-founded sets that include infinitons, semi-infinitons and quasi-infinitons in Russell's paradox. All…

Logic · Mathematics 2026-04-28 Eugene Zhang

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

Rings and Algebras · Mathematics 2025-10-10 Dylan Johnston , Dmitriy Rumynin

We introduce the fundamental group $F(\mathcal{M})$ of a finite von Neumann algebra $\mathcal{M}$ with finite dimensional normal trace space. The form of $F(\mathcal{M})$ is completely determined. Moreover, there exists a finite von Neumann…

Operator Algebras · Mathematics 2016-08-24 Takashi Kawahara

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

Group Theory · Mathematics 2007-05-23 Nikolay Nikolov , Dan Segal

It is known that every semigroup of normal completely positive maps of a von Neumann can be ``dilated" in a particular way to an E_0-semigroup acting on a larger von Neumann algebra. The E_0-semigroup is not uniquely determined by the…

funct-an · Mathematics 2008-02-03 William Arveson

Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…

Logic in Computer Science · Computer Science 2010-12-23 Issam Maamria , Michael Butler
‹ Prev 1 3 4 5 6 7 10 Next ›