Related papers: Semilinear idempotent distributive l-monoids

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…

Let E be an arbitrary directed graph with no restrictions on the number of vertices and edges and let K be any field. We give necessary and sufficient conditions for the Leavitt path algebra L_K(E) to be of countable irreducible…

Jackson and Lee proved that certain six-element monoid generates a hereditarily finitely based variety $\mathbb E^1$ whose lattice of subvarieties contains an infinite ascending chain. We identify syntactic monoids which generate finitely…

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

A finite semigroup is finitely related (has finite degree) if its term functions are determined by a finite set of finitary relations. For example, it is known that all nilpotent semigroups are finitely related. A nilpotent monoid is a…

We prove that all invariant random subgroups of the lamplighter group $L$ are co-sofic. It follows that $L$ is permutation stable, providing an example of an infinitely presented such a group. Our proof applies more generally to all…

We show that any semi-direct sum $L$ of Lie algebras with Levi factor $S$ must be perfect if the representation associated with it does not possess a copy of the trivial representation. As a consequence, all invariant functions of $L$ must…

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

We provide a partial result on Taylor's modularity conjecture, and several related problems. Namely, we show that the interpretability join of two idempotent varieties that are not congruence modular is not congruence modular either, and we…

A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…

We study the nonsymmetric Macdonald polynomials specialized at infinity from various points of view. First, we define a family of modules of the Iwahori algebra whose characters are equal to the nonsymmetric Macdonald polynomials…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

If a finitely generated monoid M is defined by a finite number of degree-preserving relations, then it has linear growth if and only if it can be decomposed into a finite disjoint union of subsets (which we call "sandwiches") of the form…

We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…

The paper develops further the theory of quandle rings which was introduced by the authors in a recent work. Orderability of quandles is defined and many interesting examples of orderable quandles are given. It is proved that quandle rings…

Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…

We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary…

Given a monoid $S$ with $E$ any non-empty subset of its idempotents, we present a novel one-sided version of idempotent completion we call left $E$-completion. In general, the construction yields a one-sided variant of a small category…