中文
相关论文

相关论文: A complete rewrite system and normal forms for (S)…

200 篇论文

We present a metagrammatical formalism, {\em generic rules}, to give a default interpretation to grammar rules. Our formalism introduces a process of {\em dynamic binding} interfacing the level of pure grammatical knowledge representation…

cmp-lg · 计算机科学 2008-02-03 Julio Gonzalo , Teresa Solias

Let $T_X$ be the full transformation monoid over a finite set $X$, and fix some $a\in T_X$ of rank $r$. The variant $T_X^a$ has underlying set $T_X$, and operation $f\star g=fag$. We study the congruences of the subsemigroup $P=Reg(T_X^a)$…

环与代数 · 数学 2024-08-13 Igor Dolinka , James East , Nik Ruškuc

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

范畴论 · 数学 2007-05-31 Jonathan A. Cohen

A DR-semigroup $S$ (also known as a reduced E-semiabundant or reduced E-Fountain semigroup) is here viewed as a semigroup equipped with two unary operations $D,R$ satisfying finitely many equational laws. Examples include DRC-semigroups…

环与代数 · 数学 2026-01-08 Tim Stokes

We show that every matrix all of whose entries are in a fixed subgroup of the group of units of a commutative ring with identity is equivalent to a standard form. As a consequence, we improve the proof of Theorem 5 in D. Best, H.…

组合数学 · 数学 2016-11-11 Akihiro Munemasa , Pritta Etriana Putri

In the second section, we introduce hemiring-valued pseudonormed rings and generalize Albert's result which states that every finite-dimensional algebra can be normed. Next, we introduce shrinkable hemirings and prove that dense division…

交换代数 · 数学 2025-08-05 Peyman Nasehpour

Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a…

环与代数 · 数学 2017-01-26 Kalyan Hansda

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…

计算机科学中的逻辑 · 计算机科学 2018-04-24 Ştefan Ciobâcă , Dorel Lucanu

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic 0. In this paper we classify all regular decompositions of $\mathfrak{g}$ and its irreducible root system $\Delta$. A regular…

环与代数 · 数学 2024-05-01 Stepan Maximov

The article $-$ part of a larger thesis which aims to give a detailed description of the generalisation to the category of groups with operators of the classical theory of semisimplicity for modules $-$ presents a straightforward…

群论 · 数学 2020-12-15 Sebastian Cristian Lesnic

A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…

群论 · 数学 2022-11-14 Victoria Gould , Craig Miller , Thomas Quinn-Gregson , Nik Ruskuc

Let $(R,\mathfrak{m}_R,k)$ be a one-dimensional complete local reduced $k$-algebra over a field of characteristic zero. R. Berger conjectured that $R$ is regular if and only if the universally finite module of differentials $\Omega_R$ is…

交换代数 · 数学 2022-11-21 Sarasij Maitra , Vivek Mukundan

This notes explains how standard algorithms that construct sorting networks have been formalised and proved correct in the Coq proof assistant using the SSReflect extension.

数据结构与算法 · 计算机科学 2022-03-04 Laurent Théry

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…

群论 · 数学 2014-04-28 Peter R. Jones

A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…

组合数学 · 数学 2007-05-23 A. Heyworth , M. Johnson

We reveal new aspects of the structure of Hilbert space $C_0$-semigroups $\mathcal T = (T(t))_{t\ge 0}$ similar to semigroups of contractions. In particular, we prove that $\mathcal T$ is similar to a semigroup of contractions if and only…

泛函分析 · 数学 2025-09-04 J. Oliva-Maza , Y. Tomilov

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

群论 · 数学 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

Given a group G, we construct, in a canonical way, an inverse semigroup S(G) associated to G. The actions of S(G) are shown to be in one-to-one correspondence with the partial actions of G, both in the case of actions on a set, and that of…

funct-an · 数学 2008-02-03 Ruy Exel

Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and…

群论 · 数学 2025-07-30 Zachary Mesyan

For any commutative ring $A$ we introduce a generalization of $S$-noetherian rings using a hereditary torsion theory $\sigma$ instead of a multiplicatively closed subset $S\subseteq{A}$. It is proved that if $A$ is a totally…

交换代数 · 数学 2020-11-06 Pascual Jara
‹ 上一页 1 8 9 10 下一页 ›