English
Related papers

Related papers: Two nonfinitely based additively idempotent semiri…

200 papers

We examine varieties of epigroups as unary semigroups, that is semigroups equipped with an additional unary operation of pseudoinversion. The article contains two main results. The first of them indicates a countably infinite family of…

Group Theory · Mathematics 2020-01-22 S. V. Gusev , B. M. Vernikov

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

Commutative Algebra · Mathematics 2023-07-04 Scott T. Chapman , Harold Polo

A Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. We say that a Puiseux monoid $M$ is exponential provided that there exist a positive rational $r$ and a set $S$ consisting of nonnegative integers,…

Commutative Algebra · Mathematics 2021-12-06 Sofía Albizu-Campos , Juliet Bringas , Harold Polo

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

Rings and Algebras · Mathematics 2021-02-17 Fernando Martin-Maroto , Gonzalo G. de Polavieja

An incline is an additively idempotent semiring in which the product of two elements is always less than or equal to either factor. This paper proves that the only regular inclines are distributive lattices, which also implies that there is…

Rings and Algebras · Mathematics 2013-08-30 Song-Chol Han , Hak-Rim Ri

This article addresses two central problems in the theory of quandle rings. First, motivated by Conjecture 3.10 in Internat. J. Math. 34 (2023), no. 3, Paper No. 2350011: for a semi-latin quandle $X$, every nonzero idempotent in the…

Rings and Algebras · Mathematics 2026-02-04 Valeriy Bardakov , Mohamed Elhamdadi

A finite semifield $D$ is a finite nonassociative ring with identity such that the set $D^*=D\setminus\{0\}$ is closed under the product. In this paper we obtain a computer-assisted description of all 64-element finite semifields, which…

Rings and Algebras · Mathematics 2008-08-08 I. F. Rúa , Elías F. Combarro , J. Ranilla

In this paper, we prove that the semigroups of invertible matrices with nonnegative elements over linearly oredered associative rings are elementarily equivalent if and only if the matrices have the same dimension and the rings are…

Rings and Algebras · Mathematics 2007-05-23 Elena I. Bunina , Alexandr V. Mikhalev

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Combinatorics · Mathematics 2024-09-24 Gal Gross

We show that a locally finite variety which omits abelian types is self-regulating if and only if it has a compatible semilattice term operation. Such varieties must have a type-set {5}. These varieties are residually small and, when they…

Rings and Algebras · Mathematics 2009-09-25 Keith A. Kearnes , Ågnes Szendrei

We prove the subadditivity property for the maximal degrees of the syzygies of facet ideals simplicial forests. For such an ideal $I$, if the $i$-th Betti number is nonzero and $i=a+b$, we show that there are monomials in the lcm lattice of…

Commutative Algebra · Mathematics 2016-05-26 Sara Faridi

Recall that an element $x\in R$ is {\bf complemented} if there is a $y\in R$ such that $xy = 0$ and $x + y \in {\rm reg}(R)$. In a recent article [1], the authors investigated those rings for which every non-nilpotent element is…

Rings and Algebras · Mathematics 2026-05-26 W. Wm. McGovern , Y. Zhou

We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…

Group Theory · Mathematics 2015-10-06 Olga Sapir

Denote by PSelf(X) (resp., Self(X)) the partial (resp., full) transformation monoid over a set X, and by Sub(V) (resp., End(V)) the collection of all subspaces (resp., endomorphisms) of a vector space V. We prove various results that imply…

Rings and Algebras · Mathematics 2008-10-15 Joao Araujo , Friedrich Wehrung

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

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

Number Theory · Mathematics 2008-07-23 Bakir Farhi

We associate a graph ${\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent…

Group Theory · Mathematics 2014-03-03 E. Jespers , M. H. Shahzamanian

A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…

Rings and Algebras · Mathematics 2026-01-13 Jason P. Bell , Ken Brown , Zahra Nazemian , Daniel Smertnig

For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is called "proper". It is known that the Boolean semiring, the…

Formal Languages and Automata Theory · Computer Science 2015-03-14 Zoltan Esik , Andreas Maletti

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov