相关论文: A complete rewrite system and normal forms for (S)…
We show how to use extended word series in the reduction of continuous and discrete dynamical systems to normal form and in the computation of formal invariants of motion in Hamiltonian systems. The manipulations required involve complex…
The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…
We introduce the concept of a restriction semigroupoid S, which unifies the notion of restriction semigroups and restriction categories within a single structure. We prove a representation theorem, showing that every restriction…
We introduce the new notion of general bilinear forms (generalizing sesquilinear forms) and prove that for every ring $R$ (not necessarily commutative, possibly without involution) and every right $R$-module $M$ which is a generator (i.e.…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…
Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…
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…
We extend Gow's theorem on products of semisimple regular conjugacy classes to finite groups whose generalized Fitting subgroup is Z(G)S where S is a quasisimple group of Lie type in characteristic p and Z(G) has order prime to p.
The use of compositions simplifies some aspects of the theory of numerical semigroups. We illustrate this by giving a new proof for the asymptotic number C((1 + $\sqrt$ 5)/2) g of numerical semigroups of genus g and by describing the…
A Conway semiring is a semiring $S$ equipped with a unary operation $^*:S \to S$, always called 'star', satisfying the sum star and product star identities. It is known that these identities imply a Kleene type theorem. Some computationally…
Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…
This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
It is shown that, in the theory of absorption semigroups, two possible ways of defining regularity for absorption rates are in fact equivalent.
The paper deals with $\Sigma-$composition and $\Sigma$-essential composition of terms, which lead to stable and s-stable varieties of algebras. A full description of all stable varieties of semigroups, commutative and idempotent groupoids…
General coherence theorems are constructed that yield explicit presentations of categorical and algebraic objects. The categorical structures involved are finitary discrete Lawvere 2-theories, though they are approached within the language…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric…
We introduce some deformations of the biset category and prove a semisimplicity property. We also consider another group category, called the subgroup category, whose morphisms are subgroups of direct products, the composition being star…
Reachability logic has been applied to $\mathbb{K}$ rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic…