English
Related papers

Related papers: The Finite Basis Problem for Kiselman Monoids

200 papers

Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.

Group Theory · Mathematics 2019-01-03 Mikhail Volkov

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

Rings and Algebras · Mathematics 2026-02-24 Vesselin Drensky

We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid $\mathcal{K}_3$. Our characterization leads to a polynomial time algorithm to check whether a given identity holds in $\mathcal{K}_3$.

Group Theory · Mathematics 2020-01-07 Yuzhu Chen , Xun Hu , N. V. Kitov , Yanfeng Luo , M. V. Volkov

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…

Group Theory · Mathematics 2016-09-09 Olga Sapir

We search an identity basis for the adjoint Lie algebra of the algebra $M_{1,1}(K)$ over a field, where $K$ is either the infinite generated Grassmann algebra $E$ or $E^1$, the variant of the algebra with $1$. In particular, we prove that…

Rings and Algebras · Mathematics 2018-06-04 Olga Finogenova , Irina Sviridova

Building on the work of Gabriel Conant, we investigate the enumeration problems of finite distance monoids by applying the decomposition of Archimedean classes and studying their internal arithmetic progressions. Specifically, we first…

Combinatorics · Mathematics 2025-12-09 Yunjie Luo , Jie Sheng

Stalactic, taiga, sylvester and Baxter monoids arise from the combinatorics of tableaux by identifying words over a fixed ordered alphabet whenever they produce the same tableau via some insertion algorithm. In this paper, three sufficient…

Group Theory · Mathematics 2021-07-05 Bin Bin Han , Wen Ting Zhang

A k-gap is a finite k-sequence of pairwise disjoint monotone families of infinite subsets of N mixed in such a way that we cannot find a partition of N such that each family is trival on one piece of the partition. We prove that, relative…

Logic · Mathematics 2025-04-02 Antonio Avilés , Stevo Todorcevic

Kiselman's semigroup $K_n$ was studied by Kudryavtseva and Mazorchuk, who posed the question of whether it is possible to classify all endomorphisms of $K_n$. In this paper, we provide a complete classification of endomorphisms of $K_n$ and…

Group Theory · Mathematics 2025-09-22 Luka Andrensek

The class of finitely presented algebras over a field K with a set of generators a_1,...,a_n and defined by homogeneous relations of the form a_1a_2...a_n = a_{sigma(1)}a_{sigma(2)}...a_{sigma(n)}, where sigma runs through an abelian…

Rings and Algebras · Mathematics 2014-12-12 Ferran Cedo , Eric Jespers , Georg Klein

In this paper we explicitly compute finite bases of disjunctive identities and finite bases of regular representations for a number of interesting finite groups.

Group Theory · Mathematics 2009-09-25 Samuel Vovsi

It is shown that a finite monoid can have an infinite irredundant basis of equations.

Logic · Mathematics 2015-11-20 Marcel Jackson

Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped…

Group Theory · Mathematics 2026-03-19 Bin Bin Han , Wen Ting Zhang , Yan Feng Luo

We establish a criterion for a semigroup identity to hold in the monoid of $n \times n$ upper unitriangular matrices with entries in a commutative semiring $S$. This criterion is combinatorial modulo the arithmetic of the multiplicative…

Rings and Algebras · Mathematics 2018-05-01 Marianne Johnson , Peter Fenner

For every semilattice $\mathcal{S}=(S,+)$, the set $\mathrm{End}(\mathcal{S})$ of its endomorphisms forms a semiring under point-wise addition and composition. We prove that the semiring of all endomorphisms of the 3-element chain has no…

Group Theory · Mathematics 2026-05-05 Sergey V. Gusev , Mikhail V. Volkov

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

Group Theory · Mathematics 2009-07-07 Markus Lohrey , Benjamin Steinberg

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…

Representation Theory · Mathematics 2007-05-23 Vladimir Shchigolev

By classical results of Malcev, cancellative monoids need not be group-embeddable. In this paper, we describe and give presentations for and study an infinite family $\mathcal{M}_n$ of cancellative monoids which are not group-embeddable,…

Rings and Algebras · Mathematics 2025-05-30 Milo Edwardes , Daniel Heath

The class of finitely presented algebras A over a field K with a set of generators x_{1},...,x_{n} and defined by homogeneous relations of the form x_{i_1}x_{i_2}...x_{i_l}=x_{sigma(i_1)}x_{sigma(i_2)}...x_{sigma(i_l)}, where l geq 2 is a…

Rings and Algebras · Mathematics 2014-12-12 Ferran Cedo , Eric Jespers , Georg Klein