相关论文: A finite basis theorem for residually finite, cong…

A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent…

Two languages are "finitely different" if their symmetric difference is finite. We consider the DFAs of finitely different regular languages and find major structural similarities. We proceed to consider the smallest DFAs that recognize a…

We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…

In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…

We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…

We establish the Minimal Model Program for arithmetic threefolds whose residue characteristics are greater than five. In doing this, we generalize the theory of global $F$-regularity to mixed characteristic and identify certain stable…

It is well known that an equivalence relation is invariant under the basic operations of an algebra if and only if it is invariant under the unary polynomials of the algebra. We show that a higher arity version of this property holds for a…

A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…

We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…

A quasivariety has the weak ES property when the epimorphisms between its finitely generated members are surjective. A characterization of quasivarieties with the weak ES property is obtained and a method for detecting failures of this…

Motivated by Lang-Vojta's conjecture, we show that the set of dominant rational self-maps of an algebraic variety over a number field with only finitely many rational points in any given number field is finite by combining Amerik's theorem…

We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…

The main objective of this paper is to study the relationship between a solvable evolution algebra and its subalgebra lattice, emphasizing two of its main properties: distributivity and modularity. First, we will focus on the nilpotent…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

We classify integer abc-equations c = a + b (to be defined), according to their radical R(abc) and prove that the resulting equivalence classes contain only a finite number of such equations. The proof depends on a 1933 theorem of Kurt…

We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…

The following article treats about convex geometries which are lower semi-modular and join semi-distributive lattices. Firstly, it is shown that there is a class $K$ of infinite convex geometries which can be build out of finite ones by…

For a given language $L$, we study the languages $X$ such that for all distinct words $u, v \in L$, there exists a word $x \in X$ that appears a different number of times as a factor in $u$ and in $v$. In particular, we are interested in…

We give an example of a finitely based locally finite variety which has uncountably many term clones. (Such varieties were known before.)

We prove a finiteness result for dominant rational maps whose orbifold base is of general type. Our finiteness result generalizes Maehara's theorem that a given variety dominates only finitely many projective varieties of general type up to…