Related papers: Finite bands are finitely related
Idempotents yield much insight in the structure of finite semigroups and semirings. In this article, we obtain some results on (multiplicatively) idempotents of the endomorphism semiring of a finite chain. We prove that the set of all…
We show that every finite ring has a partition, where each block corresponds to one idempotent. Remarkably, this partition provides a way to \emph{lift} a wide variety of special elements such as idempotents, nilpotents, unipotents, roots…
For a finite group G, we introduce the complete suboperad $Q_G$ of the categorical G-Barratt-Eccles operad $P_G$. We prove that $P_G$ is not finitely generated, but $Q_G$ is finitely generated and is a genuine $E_\infty$ G-operad (i.e., it…
We study the class of symmetric $n$-ary bands. These are $n$-ary semigroups $(X,F)$ such that $F$ is invariant under the action of permutations and idempotent, i.e., satisfies $F(x,\ldots,x)=x$ for all $x\in X$. We first provide a structure…
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.
We present new conditions for semigroups of positive operators to converge strongly as time tends to infinity. Our proofs are based on a novel approach combining the well-known splitting theorem by Jacobs, de Leeuw and Glicksberg with a…
In the present work we explore relationships between multiplicative functions defined in \cite{Garonzi_2018}, \cite{Lazorec}. To do so, we use other important quotients defined and studied in \cite{ndeg}, \cite{Marius}, thus establishing…
We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
In 1985, Bucher, Ehrenfeucht and Haussler studied derivation relations associated with a given set of context-free rules. Their research motivated a question regarding homomorphisms from the semigroup of all words onto a finite ordered…
We give completely combinatorial proofs of the main results of [3] using polygons. Namely, we prove that the mapping class group of a surface with boundary acts faithfully on a finitely-generated linear category. Along the way we prove some…
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…
We develop a systematic theory of eventually positive semigroups of linear operators mainly on spaces of continuous functions. By eventually positive we mean that for every positive initial condition the solution to the corresponding Cauchy…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…
Answering a question of A. V. Vasil'ev, we show that each finite symmetric (or alternating) group $H$ is a retract of any group containing $H$ as a verbally closed subgroup.
A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary…